OXIESEC PANEL
- Current Dir:
/
/
var
/
www
/
breader
/
inc
/
simplepie
/
library
/
SimplePie
/
Cache
Server IP: 139.59.38.164
Upload:
Create Dir:
Name
Size
Modified
Perms
📁
..
-
07/27/2024 04:04:53 PM
rwxrwxrwx
📄
00075c93132acf7a6e46e48d2291ce41.spc
5.69 KB
08/08/2022 06:41:41 AM
rwxrwxrwx
📄
0102169e52b6a27a410e7b237202fe84.spc
140.81 KB
06/20/2024 08:52:22 AM
rwxrwxrwx
📄
027d4dde1e82475da3d9afe4844afb1d.spc
2.63 KB
08/04/2022 02:47:12 PM
rwxrwxrwx
📄
03036edfece701eaa1537fea4014dd44.spc
56.35 KB
08/28/2024 10:14:14 AM
rwxrwxrwx
📄
0446f65691fba260d3eabbd1377240f8.spc
5.75 KB
08/03/2021 02:55:43 AM
rwxrwxrwx
📄
04d0c6cc2bf146b1318b78f84416b912.spc
124.45 KB
06/20/2024 08:52:14 AM
rwxrwxrwx
📄
0582678c8cfff117f770f9368b70c2b5.spc
19.33 KB
10/06/2021 12:58:29 AM
rwxrwxrwx
📄
0601d608f5e2ea8e198130b17fe6ef01.spc
157 bytes
04/20/2023 03:33:59 PM
rwxrwxrwx
📄
061ad7f2b0116c570fdc35c36824c7c6.spc
42.24 KB
05/14/2024 04:53:51 AM
rwxrwxrwx
📄
06e0c598a46c483b6b9d775e1ba1ecd4.spc
124.09 KB
07/03/2024 11:17:48 AM
rwxrwxrwx
📄
0802b12194f292de0e9d9617ac014785.spc
290.02 KB
07/09/2022 04:43:03 PM
rwxrwxrwx
📄
083aed319a0b5c8691e31d9150d8005e.spc
19.84 KB
04/02/2024 02:41:54 AM
rwxrwxrwx
📄
0a3bf48c84477cd58dbc2036a0331134.spc
70.63 KB
03/03/2023 03:29:10 AM
rwxrwxrwx
📄
0b5e5f226006af7e46d02ba8ce216a45.spc
54.71 KB
06/20/2024 08:52:24 AM
rwxrwxrwx
📄
0b73d04c6bba0acaf2f9a569f388313a.spc
33.59 KB
07/12/2023 02:13:33 PM
rwxrwxrwx
📄
0b8a46fca237497cfc90498f9eb909ab.spc
686.66 KB
02/14/2024 01:18:37 AM
rwxrwxrwx
📄
0ce2bdd7061489c6136e7614d421b874.spc
47.7 KB
03/23/2023 06:13:09 AM
rwxrwxrwx
📄
0de8a2204854bb5dd311607494c671e4.spc
828.58 KB
04/27/2022 03:38:58 AM
rwxrwxrwx
📄
0e15494dca4aeb24ea769582482c5162.spc
150.58 KB
04/20/2023 03:33:43 PM
rwxrwxrwx
📄
0eaec40cfb584fcb55fcdfb5d76684b9.spc
16.95 KB
03/30/2023 03:18:33 AM
rwxrwxrwx
📄
0ed254d4d9db6e3afe193b00bc6471bb.spc
89.85 KB
05/21/2024 04:51:10 AM
rwxrwxrwx
📄
0f079d9bb09fef940c38ee73b52b91d4.spc
34.42 KB
10/05/2021 09:26:01 AM
rwxrwxrwx
📄
0f5e21d9d8354d10ea23d99101259ba2.spc
42.06 KB
07/17/2024 02:56:55 AM
rwxrwxrwx
📄
0ffc1fa29a6bad7fb49e55940c374610.spc
75.61 KB
05/23/2024 12:21:08 PM
rwxrwxrwx
📄
1071b4a15b6c2fe6f7a96f194d0ba524.spc
196 bytes
08/28/2024 10:14:23 AM
rwxrwxrwx
📄
10ae571a6266a8e21b0fbb15f552a1cb.spc
13.15 KB
07/17/2024 02:56:58 AM
rwxrwxrwx
📄
118c129ff99a905e4e9325e388b841fe.spc
45.34 KB
10/06/2021 01:12:01 AM
rwxrwxrwx
📄
131a4ad07dda46888cbbc1cb4c710a91.spc
59.6 KB
06/20/2024 08:52:24 AM
rwxrwxrwx
📄
132dee0a955be7733cc009e546de18da.spc
100.76 KB
10/06/2021 12:25:04 AM
rwxrwxrwx
📄
142d8795402a4e8a520be8ebea6f54f3.spc
22.7 KB
06/20/2024 08:52:34 AM
rwxrwxrwx
📄
1469d584e9747d132077c9df3cda6c97.spc
121.15 KB
07/17/2024 02:56:55 AM
rwxrwxrwx
📄
1479626ef8ef423638ca62f43b3e0f8d.spc
95.45 KB
06/20/2024 08:52:43 AM
rwxrwxrwx
📄
16e016e3ca27d793aa9172c1913c3f23.spc
26.74 KB
10/13/2021 06:46:54 AM
rwxrwxrwx
📄
19f3a21c36072f501f634db8e658bc9f.spc
16.6 KB
05/02/2024 07:13:38 AM
rwxrwxrwx
📄
1b8954ae7aab6fd9784cbcc827133f80.spc
186 bytes
08/12/2021 10:27:02 AM
rwxrwxrwx
📄
1c0bbac8beea30e555f26fd02994e7a5.spc
19.96 KB
04/02/2024 02:41:54 AM
rwxrwxrwx
📄
1c1a63fc25720b7c22c9c28fa2aa9379.spc
236.54 KB
08/12/2021 10:27:08 AM
rwxrwxrwx
📄
1f1672e0ecc5e7a6d278c930015520ab.spc
166 bytes
03/23/2023 06:13:09 AM
rwxrwxrwx
📄
1f4cf3ae9ba91935f556711c1cfc34d4.spc
88.33 KB
06/20/2024 08:52:38 AM
rwxrwxrwx
📄
1f5e96e3f1a01f95ab611ec1458fe470.spc
169.16 KB
07/17/2024 02:57:03 AM
rwxrwxrwx
📄
20a75b688975a2d5d342eae9f4c33411.spc
1.22 MB
04/27/2022 03:32:10 AM
rwxrwxrwx
📄
225d97aca36305a8b407ea6d8d5b187e.spc
55.08 KB
06/20/2024 08:52:44 AM
rwxrwxrwx
📄
242d3dabf79d13154fcc384ff8b2d25e.spc
113.19 KB
07/17/2024 02:56:54 AM
rwxrwxrwx
📄
25512b0d18ae6e4d20d027abbc467365.spc
31.2 KB
06/19/2021 12:29:12 PM
rwxrwxrwx
📄
25948504a82cd8da1985fddd4500c1c7.spc
153.7 KB
04/27/2022 03:38:55 AM
rwxrwxrwx
📄
26e0c631724f3653c10c3123546ab5e2.spc
110.09 KB
02/21/2022 03:01:10 PM
rwxrwxrwx
📄
2704664dff0e40e19de087fe00892bc2.spc
24.51 KB
08/12/2021 10:27:02 AM
rwxrwxrwx
📄
274ae07ff50cfde2bda57a71703b62f4.spc
2.54 KB
05/04/2024 06:41:03 AM
rwxrwxrwx
📄
2799184659106c88b5072a3e3f763a4d.spc
2.54 KB
03/12/2024 05:50:14 AM
rwxrwxrwx
📄
2801f3bdd649962fa663f608c2383280.spc
154.53 KB
11/05/2021 11:40:13 AM
rwxrwxrwx
📄
28099e26c5c9a06acb85a41ccd789efc.spc
500.36 KB
07/03/2024 11:17:48 AM
rwxrwxrwx
📄
2aabe0323264e3f60916621039be0e76.spc
42.37 KB
02/18/2022 06:14:46 AM
rwxrwxrwx
📄
2abcd685295b4a261ad2e866188e5e11.spc
125.3 KB
06/20/2024 08:52:21 AM
rwxrwxrwx
📄
2aed529f6407470bef913050a1d118ef.spc
151 bytes
01/05/2023 02:13:14 PM
rwxrwxrwx
📄
2b2654a64e8b0f5d9cf497e0883b2042.spc
96.1 KB
03/28/2023 10:36:23 AM
rwxrwxrwx
📄
2dae1abba28ecd05f3e1e91f308cf8c4.spc
87.25 KB
11/05/2021 11:40:07 AM
rwxrwxrwx
📄
2db16a36af8daf383cb739dd57a44d90.spc
147.19 KB
07/17/2024 02:57:01 AM
rwxrwxrwx
📄
2de250597c053bd81359233c14c51db4.spc
286.38 KB
06/06/2021 03:15:58 PM
rwxrwxrwx
📄
2fb670ecdcda7db936aa7d2f018a79e4.spc
23.75 KB
06/20/2024 08:52:22 AM
rwxrwxrwx
📄
30d5af6cd4c10ea02520bcaba31f3d1c.spc
141.02 KB
07/26/2024 07:37:50 AM
rwxrwxrwx
📄
31591159e55bceb27be71ce43cd1517e.spc
443.64 KB
03/16/2022 05:35:22 PM
rwxrwxrwx
📄
31f817c15425941589a9819216265501.spc
68.33 KB
08/28/2024 10:14:14 AM
rwxrwxrwx
📄
34661b0e5b23f423b303c946172b39f8.spc
20.99 KB
08/28/2024 10:14:17 AM
rwxrwxrwx
📄
3567037b5acd1842946ba40397edead4.spc
84.5 KB
06/20/2024 08:52:39 AM
rwxrwxrwx
📄
37cf2adae9335c54f1dbc436922e6cfc.spc
181 bytes
05/21/2024 04:14:40 PM
rwxrwxrwx
📄
389ae768f4ecb350b56b92da3b04c1ac.spc
180.5 KB
08/28/2024 10:14:21 AM
rwxrwxrwx
📄
3bcfb7838de30c68c7acc437c16935cc.spc
142.35 KB
09/23/2022 10:34:29 AM
rwxrwxrwx
📄
3ca755a78dd04c91695e5fcee845991f.spc
42.02 KB
04/05/2023 07:09:34 AM
rwxrwxrwx
📄
3d135369c757ae57c3c873e6070d5ac6.spc
46.18 KB
09/09/2024 03:09:14 PM
rwxrwxrwx
📄
3e4e8d898fc42bca52bf888c3a33ef23.spc
614.85 KB
08/13/2024 02:27:32 PM
rw-r--r--
📄
3e804b49f84699d48348b3bee312090d.spc
25.24 KB
03/23/2023 06:57:07 AM
rwxrwxrwx
📄
3f92b590befbddc6f7237f2ff7a2ca21.spc
407.55 KB
08/01/2023 07:53:29 AM
rwxrwxrwx
📄
3f93802ae5a285cffaf04f22ceb596fb.spc
307.02 KB
08/03/2021 02:55:41 AM
rwxrwxrwx
📄
419e5468f73de12da7ac55b064ff6e04.spc
19.87 KB
04/17/2023 02:08:43 PM
rwxrwxrwx
📄
43cdef0c688f38c395285fd09bd1d8b6.spc
163 bytes
11/21/2023 07:57:07 AM
rwxrwxrwx
📄
445a8424173fb9de0f08493a09557c92.spc
39.14 KB
05/23/2024 12:21:14 PM
rwxrwxrwx
📄
447b88825763019604aca4e363415120.spc
3.18 KB
10/05/2021 09:26:02 AM
rwxrwxrwx
📄
44a6e222af7ac1e000190688f3824d27.spc
103.66 KB
08/24/2022 06:38:59 AM
rwxrwxrwx
📄
45ec354e05ea3a553e89c9f9d1ee7a6f.spc
67.86 KB
08/28/2024 10:14:14 AM
rwxrwxrwx
📄
48926180fcc9ab4ab897cfbc5279409e.spc
170 bytes
07/11/2024 09:08:36 AM
rwxrwxrwx
📄
4904c558085c30a9ca52969c7f875cf8.spc
155 bytes
06/18/2024 08:58:50 AM
rwxrwxrwx
📄
490fd4abfc32189cff5d5f38ddaaff5b.spc
22.31 KB
11/05/2021 11:40:08 AM
rwxrwxrwx
📄
491e4a0adc576f7c32fdb7ee38bb0997.spc
88.77 KB
08/04/2022 02:46:49 PM
rwxrwxrwx
📄
492e918dde587df3095914b1f67cd6ee.spc
31.56 KB
04/20/2023 03:34:22 PM
rwxrwxrwx
📄
4b6d0ec22ab2dc33cffefef17cf9a288.spc
87.42 KB
06/20/2024 08:52:31 AM
rwxrwxrwx
📄
4b6fa8105439c52ea4f2c1f18e0957e2.spc
181 bytes
06/18/2024 08:58:27 AM
rwxrwxrwx
📄
4c3facd12e8f40cab8114677f681ebaf.spc
134 bytes
04/20/2023 03:34:27 PM
rwxrwxrwx
📄
4ca537d8aa4727a23841361c475118e1.spc
42.22 KB
06/20/2024 08:52:23 AM
rwxrwxrwx
📄
4d1bb795413f82f68c666caa0c0c27bb.spc
148.14 KB
08/31/2023 01:16:08 AM
rwxrwxrwx
📄
4e8baeaef3679f9460ffdecddbb1f6a7.spc
35.08 KB
05/02/2024 07:13:41 AM
rwxrwxrwx
📄
5064bfc366d30fb3250bafeacadc83db.spc
22.11 KB
08/13/2024 02:27:36 PM
rw-r--r--
📄
50ba71d2f35fb5e96b224d907d33d263.spc
720.35 KB
02/26/2023 07:17:42 AM
rwxrwxrwx
📄
51447ae67b6d856982df0ea0496cf24b.spc
18.89 KB
09/03/2024 09:10:45 AM
rwxrwxrwx
📄
522fe4b133aa24cb42c79b24ecb5c838.spc
134.37 KB
12/06/2023 04:54:15 AM
rwxrwxrwx
📄
5432740bf8126b80fd18515165c5cf20.spc
22.07 KB
04/17/2023 02:08:44 PM
rwxrwxrwx
📄
55fad6ae8bfedfb81fafc8bd5112a79f.spc
31.16 KB
07/06/2021 11:10:27 AM
rwxrwxrwx
📄
577d0589862161e3aaa25ed8758b2765.spc
29.23 KB
08/28/2024 10:14:20 AM
rwxrwxrwx
📄
57e4b3f5cadf2d33fa630cb96499349a.spc
154 bytes
07/02/2021 12:21:39 PM
rwxrwxrwx
📄
588359e68ff59d4ef53aaf3edb6a44cf.spc
6.77 KB
07/26/2024 07:16:40 AM
rwxrwxrwx
📄
5a06bba505584742f9e590f2f81e0ff3.spc
128 bytes
10/14/2021 10:14:57 AM
rwxrwxrwx
📄
5c6d487a1fbb288f7f0f73b55f6b2df1.spc
41.86 KB
07/26/2024 06:33:59 AM
rwxrwxrwx
📄
5c744a4198beb7326dcf101f961486b4.spc
56.94 KB
07/17/2024 02:56:53 AM
rwxrwxrwx
📄
5ef8b2cef4776b3e3f9f79092ce932ca.spc
124.66 KB
06/20/2024 08:52:18 AM
rwxrwxrwx
📄
5fc9bcdda34ec7e72510b177a0164b7b.spc
602.71 KB
07/17/2024 02:56:54 AM
rwxrwxrwx
📄
60bc545cda9dafe75484b88be1dd4ae9.spc
67.49 KB
06/20/2024 08:52:13 AM
rwxrwxrwx
📄
60fe2edd86b212feb0f71552066ef55d.spc
186.19 KB
08/28/2024 10:14:21 AM
rwxrwxrwx
📄
6270f865db79068a5dedb78ba877e7a0.spc
100.02 KB
05/29/2024 06:44:42 AM
rwxrwxrwx
📄
6370a4a7eb9be29e32a96811bc0dd7b6.spc
19.59 KB
04/02/2024 02:41:54 AM
rwxrwxrwx
📄
63f55618eba7b0585577fb08ea8818dc.spc
41.42 KB
07/26/2024 06:33:59 AM
rwxrwxrwx
📄
651d4f6bf953adef7c5b8f05f01e1151.spc
32.47 KB
04/20/2023 03:34:01 PM
rwxrwxrwx
📄
66267a4d6dba7887fc7d4a1aa2da9b75.spc
123.73 KB
06/20/2024 08:52:15 AM
rwxrwxrwx
📄
663e01e065755a523f15f61782ef2fd0.spc
28.3 KB
08/28/2024 10:14:23 AM
rwxrwxrwx
📄
66506bf5272cefcb56085b4b77463bd8.spc
280.88 KB
07/03/2024 11:17:51 AM
rwxrwxrwx
📄
669fa07a0da20a5d0da35d972d5fcac5.spc
99.77 KB
04/20/2023 03:33:37 PM
rwxrwxrwx
📄
679d4423c6016aeb24557d767a509bbb.spc
46.29 KB
08/12/2021 10:27:00 AM
rwxrwxrwx
📄
68b07b9d8602e8295a1069c1af39ca9b.spc
18.57 KB
09/23/2023 02:54:32 AM
rwxrwxrwx
📄
69185497e5f13fd4744a2c39d76fb812.spc
32.55 KB
08/28/2024 10:14:13 AM
rwxrwxrwx
📄
69b3abe3aa88d144d3591d56873de72b.spc
150 bytes
12/06/2021 01:33:37 PM
rwxrwxrwx
📄
6a0ab3ec7216c8caa50e266f3ff16993.spc
22.35 KB
04/17/2023 02:08:43 PM
rwxrwxrwx
📄
6c7544e2246a222bbde6ad7d0406c8db.spc
200.49 KB
05/23/2024 12:21:11 PM
rwxrwxrwx
📄
6c7c31384f1626a700bc8fbd2f584add.spc
57.94 KB
06/20/2024 08:52:24 AM
rwxrwxrwx
📄
6cf9d92f08956fa74016014a99dc793e.spc
28.51 KB
02/21/2022 02:59:01 PM
rwxrwxrwx
📄
6ee565104f90a8212dd7e14133d6e4ae.spc
193 bytes
10/06/2021 12:58:29 AM
rwxrwxrwx
📄
6eede30400457c4277e91f133b7a27a6.spc
60.73 KB
06/20/2024 08:52:24 AM
rwxrwxrwx
📄
71f0008f42879a3e550851568b3494d0.spc
1.8 MB
06/20/2024 08:52:29 AM
rwxrwxrwx
📄
72ff111641b87f5d234c3ded91959234.spc
136.69 KB
08/04/2022 02:46:41 PM
rwxrwxrwx
📄
7400954e05f62bf45dcf5c1087223df4.spc
2.63 KB
07/17/2024 02:57:05 AM
rwxrwxrwx
📄
7463e454c4ab831179d37c4e86643dc2.spc
266.75 KB
06/20/2024 08:52:31 AM
rwxrwxrwx
📄
74a014a9f44690e4a045b1753c1ef5c9.spc
159 bytes
10/06/2021 01:11:59 AM
rwxrwxrwx
📄
76c5af11f8b8bd34c58097da8689d2a2.spc
185.34 KB
04/02/2024 02:41:53 AM
rwxrwxrwx
📄
76e6555adc909bfac627ceaba91df128.spc
167.17 KB
07/17/2024 02:57:07 AM
rwxrwxrwx
📄
78ea3147f80e467c8740931f2f934bee.spc
163 bytes
12/04/2023 08:39:52 AM
rwxrwxrwx
📄
7ab2d04babf16e9d06f787e38f186748.spc
89.36 KB
08/28/2024 10:14:15 AM
rwxrwxrwx
📄
7b9723cc6339397505e29dbe8497b10a.spc
150 bytes
06/18/2024 08:59:05 AM
rwxrwxrwx
📄
7beeb799568e0584e407e788f7ec973d.spc
56.61 KB
01/27/2024 03:55:42 AM
rwxrwxrwx
📄
7c6fcaa553a1353d8fcc5535064f4008.spc
50.63 KB
04/20/2023 03:33:07 PM
rwxrwxrwx
📄
7d1ab5c52f2c3ab33c409e73bedecc5e.spc
3.92 KB
07/26/2024 07:37:45 AM
rwxrwxrwx
📄
7dc75885832733a5ea185d98887b82df.spc
33.47 KB
04/20/2023 03:34:27 PM
rwxrwxrwx
📄
7e7185a8ee7828937f2a05f0aa956f10.spc
162 bytes
04/20/2023 03:34:11 PM
rwxrwxrwx
📄
80d5eace46cca553f0c7e7a631ed6703.spc
123.39 KB
06/20/2024 08:52:20 AM
rwxrwxrwx
📄
828f89042b67ae6fca8657110997c302.spc
3.94 KB
07/17/2024 02:56:55 AM
rwxrwxrwx
📄
8341235cab83dcb126f0ad2b5812b63d.spc
88.67 KB
08/13/2024 02:27:37 PM
rw-r--r--
📄
8353d08af859970965abdbc71f5bf9a3.spc
37.15 KB
06/21/2022 09:28:32 AM
rwxrwxrwx
📄
83efe9d0463ea50fa82517c4a92ed589.spc
158 bytes
04/20/2023 03:33:39 PM
rwxrwxrwx
📄
8409cc881139fa5d466af5d757f19609.spc
48.09 KB
08/28/2024 10:14:28 AM
rwxrwxrwx
📄
84ed1e5a5cc7fb7930a3132f1dd7ae0a.spc
112.98 KB
03/03/2023 01:22:51 PM
rwxrwxrwx
📄
850a6a7f962502618892db457e231fe7.spc
131.61 KB
09/30/2021 05:18:11 AM
rwxrwxrwx
📄
852c8f9b4effcea04904f4e1e55da3f4.spc
459.08 KB
04/20/2023 03:33:29 PM
rwxrwxrwx
📄
874091b93fb13db66a5fdbe72fbb8d6b.spc
1.59 KB
06/19/2021 12:29:13 PM
rwxrwxrwx
📄
8b768f4e406ced9a4cba62897a7bc651.spc
97.91 KB
08/28/2024 10:14:27 AM
rwxrwxrwx
📄
8bbfe139e67e5f738b9ffcb18a7c5b86.spc
47.7 KB
10/18/2024 08:45:16 AM
rwxrwxrwx
📄
8d0823d0a4bd13241dc275b14e801667.spc
183.86 KB
08/01/2023 07:53:28 AM
rwxrwxrwx
📄
8d3db038a087fbdc54054a9282afa2c6.spc
164 bytes
04/20/2023 03:34:22 PM
rwxrwxrwx
📄
8d64115de2ca5294e771c8614663c953.spc
162 bytes
08/04/2022 02:46:49 PM
rwxrwxrwx
📄
8e24588eb23460ceefe5195686c2a6db.spc
101.38 KB
06/20/2024 08:52:31 AM
rwxrwxrwx
📄
906b5d59de170e528244744b925a8af5.spc
97.16 KB
06/20/2024 08:52:13 AM
rwxrwxrwx
📄
91e1e8b556ae254fb44c93230478d3bb.spc
1.78 MB
10/05/2023 07:56:18 AM
rwxrwxrwx
📄
925665a1ef421d5783a6690aaf7df881.spc
93.5 KB
08/13/2024 02:27:32 PM
rwxrwxrwx
📄
92c4233c5ea49b0f47ba9af6486e17f6.spc
64.88 KB
06/20/2024 08:52:13 AM
rwxrwxrwx
📄
949df90c5a085c17de656881d6a5dc97.spc
65.9 KB
04/20/2023 03:33:39 PM
rwxrwxrwx
📄
94b8ccc457e138e62b74ac96766909fe.spc
43.53 KB
04/22/2022 07:57:52 AM
rwxrwxrwx
📄
9670648a5cd87103a2bc6c99e516dbd7.spc
254.78 KB
06/20/2024 08:52:37 AM
rwxrwxrwx
📄
96c4f97f5353d399aeef3f49fcc0bd5a.spc
57.63 KB
05/02/2024 07:13:41 AM
rwxrwxrwx
📄
992f7d4247b62b8e56c4a6445f64e04b.spc
144 bytes
04/20/2023 03:34:01 PM
rwxrwxrwx
📄
995cd56c60511ced48b0bb42e95ccb29.spc
85.8 KB
06/20/2024 08:52:38 AM
rwxrwxrwx
📄
99e1eb580536f979670980ef56caa779.spc
576.91 KB
06/16/2022 03:19:25 AM
rwxrwxrwx
📄
9af8106d738badb69af8dbe24a679341.spc
4.85 KB
05/23/2024 12:21:11 PM
rwxrwxrwx
📄
9b6240eda91c41ff776a575879c7a726.spc
54.8 KB
08/01/2023 07:53:36 AM
rwxrwxrwx
📄
9c32f356173958a68d3962b6f17561eb.spc
160 bytes
04/20/2023 03:33:37 PM
rwxrwxrwx
📄
9e292139809beeb488509c95614d3e76.spc
1.56 KB
02/18/2022 06:14:45 AM
rwxrwxrwx
📄
9fe45b1c96a67767d7c125aa8c27bebc.spc
2.54 KB
05/04/2024 06:41:03 AM
rwxrwxrwx
📄
Base.php
3.35 KB
04/17/2017 07:29:31 AM
rwxrwxrwx
📄
DB.php
4.6 KB
04/17/2017 07:29:31 AM
rwxrwxrwx
📄
File.php
4.19 KB
04/17/2017 07:29:31 AM
rwxrwxrwx
📄
Memcache.php
4.81 KB
04/17/2017 07:29:31 AM
rwxrwxrwx
📄
Memcached.php
5.27 KB
04/17/2017 07:29:31 AM
rwxrwxrwx
📄
MySQL.php
12.67 KB
04/17/2017 07:29:31 AM
rwxrwxrwx
📄
Redis.php
3.77 KB
04/17/2017 07:29:31 AM
rwxrwxrwx
📄
a0dd9524b935d91f0d0e610c7b9a1f95.spc
54.13 KB
06/20/2024 08:52:26 AM
rwxrwxrwx
📄
a0e811e382668a9493c9f9bcf755902f.spc
25.24 KB
03/30/2023 03:18:32 AM
rwxrwxrwx
📄
a11bb1233ce40192adba9cdb21a3613c.spc
132 bytes
08/04/2022 02:46:41 PM
rwxrwxrwx
📄
a12b910472ebb7b3a0c246d82cdec324.spc
165.79 KB
08/13/2024 02:27:36 PM
rw-r--r--
📄
a1306c489bd935407a80c0245167bb84.spc
428.11 KB
05/07/2024 06:36:58 AM
rwxrwxrwx
📄
a1e50aef8a606be18418a7d94b3bb8d2.spc
122.33 KB
10/20/2021 08:03:48 AM
rwxrwxrwx
📄
a2535462ba909c959bb0869d70ff56e8.spc
29.87 KB
08/13/2024 02:27:34 PM
rw-r--r--
📄
a314938317436bd1ebd038a1398b974f.spc
19.1 KB
06/06/2021 03:53:15 PM
rwxrwxrwx
📄
a40a776457ebfa5dcaef5c99f859250c.spc
121.25 KB
08/13/2024 02:27:30 PM
rwxrwxrwx
📄
a4ed082fee0233bdebb15a8f4a504fa6.spc
175.47 KB
10/06/2021 01:11:59 AM
rwxrwxrwx
📄
a576de3f9423beb68b07b459f555f5d8.spc
76.09 KB
07/26/2024 07:37:44 AM
rwxrwxrwx
📄
a8125aa761f75b13ea12ad2d89fbc3a6.spc
58.37 KB
03/11/2024 08:26:59 AM
rwxrwxrwx
📄
a889c422e716ac96d46950fb9c5ba801.spc
106.51 KB
09/29/2021 06:50:32 AM
rwxrwxrwx
📄
a989cfbb4ebcd4ea5aede2f8d18f6b80.spc
214.7 KB
07/26/2024 07:37:44 AM
rwxrwxrwx
📄
abfe9571c106187db93288b1ea97357a.spc
19.09 KB
08/28/2024 10:14:21 AM
rwxrwxrwx
📄
ac085086dda45b4acb5220884d7b42fb.spc
39.58 KB
07/07/2022 07:24:36 AM
rwxrwxrwx
📄
ad31539954a7a910a7ef71c0cff11e32.spc
651.17 KB
01/30/2024 07:39:04 AM
rwxrwxrwx
📄
adb7ca764a42bad01a0ccae2df09c2fa.spc
34.44 KB
08/13/2024 02:27:34 PM
rw-r--r--
📄
af4b85b1ea956523b25a690c1c87ed85.spc
7.54 KB
08/31/2023 01:11:41 AM
rwxrwxrwx
📄
b1ef373fca862552cd559336e342ca8d.spc
60.91 KB
06/20/2024 08:52:30 AM
rwxrwxrwx
📄
b1fc76c9199e2130438d81b6297c73fa.spc
123.07 KB
06/20/2024 08:52:16 AM
rwxrwxrwx
📄
b44b9e448df189cee8d7c7774273267b.spc
67.39 KB
08/28/2024 10:14:14 AM
rwxrwxrwx
📄
b5b9fb6ba1e724416126f7788d4bd8b7.spc
19.16 KB
07/09/2024 10:38:26 AM
rwxrwxrwx
📄
b8e453c2d1e800f71ad2abe6f7862197.spc
199 bytes
07/15/2024 04:03:41 AM
rwxrwxrwx
📄
b98b28ea3fd7b9216203c2195410da13.spc
185.21 KB
08/04/2022 02:47:08 PM
rwxrwxrwx
📄
bad310e570d6910886344039e409a70b.spc
58.37 KB
03/11/2024 08:26:58 AM
rwxrwxrwx
📄
bb3a0b2406a3458f919871c9bfac24d7.spc
78.58 KB
02/26/2023 07:17:42 AM
rwxrwxrwx
📄
bbb4e4b91e967dfb9857f287804d6854.spc
78.58 KB
06/20/2024 08:52:40 AM
rwxrwxrwx
📄
bc49456c91a82629235dab13b79d530c.spc
5.71 KB
06/06/2021 03:53:15 PM
rwxrwxrwx
📄
bd3c5c1472767419fe12061049343483.spc
122.03 KB
06/20/2024 08:52:16 AM
rwxrwxrwx
📄
beb279d0ed1b28135d1331bbeb778b85.spc
68.25 KB
06/20/2024 08:52:13 AM
rwxrwxrwx
📄
befdda147f5b773407a123a1eb9e1481.spc
20.58 KB
10/06/2021 12:44:17 AM
rwxrwxrwx
📄
c0c166f9ee4c843629b5b2b20a0a2086.spc
74.38 KB
02/26/2023 07:17:39 AM
rwxrwxrwx
📄
c168527cd70d44755d5e3dc302cff303.spc
96.85 KB
09/09/2024 03:09:14 PM
rwxrwxrwx
📄
c31156c2178130a5e98ebbb8b2f61319.spc
92.65 KB
06/20/2024 08:52:13 AM
rwxrwxrwx
📄
c330aaa4bb416ffe76b92bd7fa4a582a.spc
3.16 KB
09/09/2024 03:09:17 PM
rwxrwxrwx
📄
c3466198bca97aa364f02a5602bef651.spc
50.51 KB
10/06/2021 01:12:01 AM
rwxrwxrwx
📄
c37dda73a1483bdf0e7772e1e65479f1.spc
102.33 KB
12/28/2021 11:05:13 AM
rwxrwxrwx
📄
c49105af5fef08449f157af0549bf58b.spc
64.7 KB
06/20/2024 08:52:13 AM
rwxrwxrwx
📄
c5bf94a976a06fd3da7d2939ef9b2e93.spc
480.81 KB
07/17/2024 02:57:05 AM
rwxrwxrwx
📄
c5e0e65569698bc9792cddb93cca6c68.spc
118.78 KB
07/17/2024 02:56:56 AM
rwxrwxrwx
📄
c96754afef1f81a69a0494827bfa975c.spc
87.07 KB
08/28/2024 10:14:15 AM
rwxrwxrwx
📄
ca38db44e86990dad0ffc27892af2d69.spc
423.78 KB
06/20/2024 08:52:43 AM
rwxrwxrwx
📄
cb969645802f54c40492251f3bd3818b.spc
7.06 KB
01/09/2023 12:56:03 AM
rwxrwxrwx
📄
cbd50ddc468d429034821a3a21440e73.spc
57.07 KB
06/20/2024 08:52:24 AM
rwxrwxrwx
📄
cc3a8bf1cc63f8051fe7e45b14fca9fc.spc
61.94 KB
06/20/2024 08:52:24 AM
rwxrwxrwx
📄
ce8b24d13ad5a0054d9ae1efeee95609.spc
57.6 KB
04/20/2023 03:33:59 PM
rwxrwxrwx
📄
ce9a2f38c75aba09c31a410d4b086b2f.spc
28.28 KB
08/28/2024 10:14:20 AM
rwxrwxrwx
📄
cec2dda9e5518b2ca7efedcdddb289f2.spc
1.5 MB
05/23/2024 12:21:21 PM
rwxrwxrwx
📄
ced71a24d29f4c3018999b8ea94761ab.spc
35.85 KB
05/29/2024 06:44:43 AM
rwxrwxrwx
📄
d018492df7f0a66d8411103e06d305fa.spc
2.9 MB
05/08/2023 11:27:05 AM
rwxrwxrwx
📄
d266cfac3257b22a998f2f5b1bf8ac31.spc
35.77 KB
03/30/2023 03:18:34 AM
rwxrwxrwx
📄
d59464babf88adbd572cbf3240ae91da.spc
2.55 KB
06/08/2023 07:28:16 AM
rwxrwxrwx
📄
d63686ffe3376b92d8b4ba02a520a2bd.spc
40.59 KB
05/23/2024 12:21:17 PM
rwxrwxrwx
📄
d6c6d1245a9ca93671ff33ef06329534.spc
41.3 KB
07/26/2024 06:33:58 AM
rwxrwxrwx
📄
d816bb54778bcf17ba8ed16089bfa393.spc
47.04 KB
09/18/2021 04:23:17 AM
rwxrwxrwx
📄
d8c5aac1146a5e6b3c91488029d275be.spc
18.96 KB
07/06/2024 08:23:54 AM
rwxrwxrwx
📄
d8eefb559112e58cb4dab21367a186e2.spc
341.6 KB
07/17/2024 02:57:04 AM
rwxrwxrwx
📄
d9db250644ba2877f115f509ace5a7b5.spc
19.27 KB
01/25/2022 06:00:15 AM
rwxrwxrwx
📄
da5b74a1b7ac788a6c7db30034f9f799.spc
76.51 KB
07/05/2021 11:28:23 AM
rwxrwxrwx
📄
da7dd3f84bdafec1857c9c04b9b53f49.spc
117.83 KB
09/19/2021 04:56:42 AM
rwxrwxrwx
📄
daadcfa75586a3a6698743b245181714.spc
20.01 KB
08/03/2021 02:55:44 AM
rwxrwxrwx
📄
dad664e4362c3317a36adbd6bfa95d4c.spc
58.98 KB
07/26/2024 07:37:44 AM
rwxrwxrwx
📄
db6a0a5cfed88c8c6db5be3169997c27.spc
38.74 KB
04/20/2023 03:34:11 PM
rwxrwxrwx
📄
dbc9e5458fbfe789c8bd64599935a222.spc
161 bytes
10/13/2021 06:55:31 AM
rwxrwxrwx
📄
dc3bbfb8c5e33be6aec482a3a6c003cd.spc
260.91 KB
07/11/2024 09:08:36 AM
rwxrwxrwx
📄
dc689c7a8814cebe543897aa3a044b9e.spc
136 bytes
08/12/2021 11:09:46 AM
rwxrwxrwx
📄
dc7b0425002a35c26a812e42646cc5af.spc
110.95 KB
06/20/2024 08:52:14 AM
rwxrwxrwx
📄
df45183a85d0f0324d9f35c8c667f311.spc
123.39 KB
06/20/2024 08:52:14 AM
rwxrwxrwx
📄
e1d26f40ba214b9e9d94a92389e4d5d8.spc
130.79 KB
06/20/2024 08:52:36 AM
rwxrwxrwx
📄
e1ec95a656a063e573f412b2c7488133.spc
98.16 KB
06/20/2024 08:52:31 AM
rwxrwxrwx
📄
e2fe7980a50e21a17e83fde0f82077c6.spc
159 bytes
07/09/2022 04:43:03 PM
rwxrwxrwx
📄
e33522c8d17d816500b215c32a7b5849.spc
424.31 KB
06/20/2024 08:52:52 AM
rwxrwxrwx
📄
e398f7edc1ab874296c6c9fed54e4399.spc
57.99 KB
10/06/2021 12:44:15 AM
rwxrwxrwx
📄
e6748eb4f66ad85c15d3973ba8d274b3.spc
16.19 KB
10/02/2023 12:45:25 PM
rwxrwxrwx
📄
ea703f3e5c39f76615e5a8b975f794a2.spc
18.93 KB
09/03/2024 09:10:45 AM
rwxrwxrwx
📄
ee4eec2e7e2d0266fa0e6eb5a151c7e9.spc
56.4 KB
08/13/2024 02:27:34 PM
rwxrwxrwx
📄
ee5afdacabc2bf5b99888e862c58b0cb.spc
187 bytes
03/29/2024 01:06:45 AM
rwxrwxrwx
📄
eedc719891428769b3318fba58ebe6c8.spc
91.81 KB
02/18/2022 06:14:46 AM
rwxrwxrwx
📄
f3fc3643d931e468c7037823a54cc6c2.spc
3.97 MB
03/23/2022 06:28:34 PM
rwxrwxrwx
📄
f4114707b5c9cf5d98010c3a1f8b38ec.spc
141 bytes
04/20/2023 03:33:29 PM
rwxrwxrwx
📄
f52ed8c534a9a161e74c7b34e79c9f24.spc
60.07 KB
03/11/2024 08:26:57 AM
rwxrwxrwx
📄
f6bf66d8f1b939c68d68e9ae777c9ee1.spc
99.38 KB
08/01/2023 07:53:28 AM
rwxrwxrwx
📄
f718d57993920295b2d6ec7c8028db7b.spc
69.33 KB
07/17/2024 02:57:04 AM
rwxrwxrwx
📄
f72d38fe0ddd5db20158445a4e897562.spc
127 bytes
04/20/2023 03:33:43 PM
rwxrwxrwx
📄
f74498a86970a084e5ca639447042aa3.spc
89.37 KB
11/09/2021 01:53:26 PM
rwxrwxrwx
📄
f781c182570da74dd9393a580af5d0b5.spc
110.45 KB
02/21/2022 02:59:01 PM
rwxrwxrwx
📄
f7d657440800849c7fcaeb682984c7e6.spc
87.15 KB
09/09/2024 03:09:14 PM
rwxrwxrwx
📄
f81cbff939f27fcdc536cbf121abb8ad.spc
120.51 KB
08/31/2023 01:19:41 AM
rwxrwxrwx
📄
f84cd96c8a71b247154b19e30d315391.spc
24.9 KB
03/30/2023 03:18:29 AM
rwxrwxrwx
📄
f8a0bf8a6e507649e6924b7906ba448b.spc
16.56 KB
08/17/2021 11:08:36 AM
rwxrwxrwx
📄
f9cf779dc17343f7a142ab34fefeb6eb.spc
622.21 KB
07/15/2022 02:53:38 AM
rwxrwxrwx
📄
fa736b27a4ac645b8161f4a084aa97f7.spc
58.64 KB
03/11/2024 08:26:57 AM
rwxrwxrwx
📄
faff66c685366de77bd8b616b29f384f.spc
64.5 KB
10/06/2021 01:12:00 AM
rwxrwxrwx
📄
fbbc76af945486db16d13c379b759bde.spc
1.24 MB
05/23/2024 12:21:22 PM
rwxrwxrwx
📄
fbc57cfd03bf1e4ef525660536f2fc4c.spc
19.03 KB
09/03/2024 09:10:46 AM
rw-r--r--
📄
fcde86f9229908845a8ebdc70d387d67.spc
65.27 KB
10/06/2021 01:12:00 AM
rwxrwxrwx
📄
fd653df8381ec085d867b89d482aed73.spc
66.47 KB
09/09/2024 03:09:16 PM
rwxrwxrwx
📄
fd99424fd37ab7b5b16649d14b1f1d93.spc
90.79 KB
09/09/2024 03:09:17 PM
rwxrwxrwx
📄
fec16c4cebc5c84650054735667e7319.spc
34.25 KB
08/04/2022 02:47:10 PM
rwxrwxrwx
Editing: 25948504a82cd8da1985fddd4500c1c7.spc
Close
a:4:{s:5:"child";a:1:{s:0:"";a:1:{s:3:"rss";a:1:{i:0;a:6:{s:4:"data";s:3:" ";s:7:"attribs";a:1:{s:0:"";a:1:{s:7:"version";s:3:"2.0";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:1:{s:0:"";a:1:{s:7:"channel";a:1:{i:0;a:6:{s:4:"data";s:85:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:8:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:13:"blog.dblp.org";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:21:"https://blog.dblp.org";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:51:"A blog about the dblp computer science bibliography";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:13:"lastBuildDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Fri, 11 Mar 2022 16:35:35 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"language";a:1:{i:0;a:5:{s:4:"data";s:5:"en-US";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:9:"generator";a:1:{i:0;a:5:{s:4:"data";s:30:"https://wordpress.org/?v=5.9.3";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:5:"image";a:1:{i:0;a:6:{s:4:"data";s:11:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:1:{s:0:"";a:5:{s:3:"url";a:1:{i:0;a:5:{s:4:"data";s:79:"https://blog.dblp.org/wp-content/uploads/2018/10/dblp.icon_.192x192-100x100.png";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:13:"blog.dblp.org";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:21:"https://blog.dblp.org";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:5:"width";a:1:{i:0;a:5:{s:4:"data";s:2:"32";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:6:"height";a:1:{i:0;a:5:{s:4:"data";s:2:"32";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}}s:4:"item";a:21:{i:0;a:6:{s:4:"data";s:78:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:11:"dblp in RDF";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:45:"https://blog.dblp.org/2022/03/02/dblp-in-rdf/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Wed, 02 Mar 2022 08:18:23 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:8:{i:0;a:5:{s:4:"data";s:17:"Feature Spotlight";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:4:"News";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:2;a:5:{s:4:"data";s:3:"api";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:3;a:5:{s:4:"data";s:4:"cc-0";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:4;a:5:{s:4:"data";s:7:"dataset";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:5;a:5:{s:4:"data";s:15:"knowledge graph";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:6;a:5:{s:4:"data";s:9:"open data";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:7;a:5:{s:4:"data";s:3:"rdf";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=532";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:268:"For more than 20 years, a full dump of all dblp records in our own XML format has been available as open data for download and reuse. These dump files have always been in high demand over the years (with 500+ downloads in February 2022 alone) and are used as […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:19:"Marcel R. Ackermann";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:6051:"<p>For more than 20 years, a full dump of all dblp records in our own XML format has been <a href="https://dblp.org/xml/release/">available as open data for download and reuse</a>. These dump files have always been in high demand over the years (with 500+ downloads in February 2022 alone) and are used as a research dataset in numerous publications.</p> <p>For quite some time now, we have been asked to provide a <strong>full RDF dump</strong> as well. Snapshots of the dblp XML file have been converted to RDF before by members of the community, and there are still a number of those <a href="https://lod-cloud.net/datasets?search=dblp">RDF files available on the Internet</a>. However, the problem with these snapshots is that they are usually not updated once they are created. Given its continuous curation by the dblp team which makes dblp such a “living” dataset, external files will be left severely out of sync with the curated dblp data stock, in some cases up to several years.</p> <h2>A full dblp RDF dump</h2> <p>To remedy this situation, we are happy to announce that for a few months now the entire dblp dataset has also been available as RDF data. These dump files will be updated daily and are guaranteed to always be in sync with the latest dblp XML release. Files are available as RDF/XML, N-Triples and Turtle at</p> <ul> <li><a href="https://dblp.org/rdf/">https://dblp.org/rdf/</a></li> </ul> <p>However, if you plan to use our RDF dump in your experiments and you need a persistent snapshot in order to make your results reproducible, we strongly encourage you to use a <strong>persistent monthly release</strong> instead:</p> <ul> <li><a href="https://dblp.org/rdf/release/">https://dblp.org/rdf/release/</a></li> </ul> <p>With its current schema, the dblp RDF data model forms a simple person-publication graph.</p> <div id="attachment_562" style="width: 610px" class="wp-caption aligncenter"><img aria-describedby="caption-attachment-562" src="https://blog.dblp.org/wp-content/uploads/2022/02/dblp-rdf-example.png" alt="" class="wp-image-562" width="600" height="300" srcset="https://blog.dblp.org/wp-content/uploads/2022/02/dblp-rdf-example.png 900w, https://blog.dblp.org/wp-content/uploads/2022/02/dblp-rdf-example-300x150.png 300w, https://blog.dblp.org/wp-content/uploads/2022/02/dblp-rdf-example-768x384.png 768w" sizes="(max-width: 600px) 100vw, 600px" /><p id="caption-attachment-562" class="wp-caption-text">Example excerpt from the dblp RDF dump.</p></div> <p>In total, the current release of March 2022 consists of 2,941,316 person entities, 6,010,605 publication entities, and 252,573,199 RDF triples. 12,157,035 external resource URIs are linked in the data set. Just as with any other data provided by dblp, the RDF dump is made available under <a href="https://blog.dblp.org/2019/11/24/licence-change-to-cc-0/">CC0 1.0 Public Domain Dedication</a> license.</p> <h2>RDF fragments via live API</h2> <p>Please be aware that besides the complete RDF dump, there also is the live API that serves RDF fragments in RDF/XML and N-Triples for individual entities. It can be used to query for persons or publications using their PID/key, e.g.:</p> <ul> <li><a href="https://dblp.org/rec/conf/icadl/KreutzWS19.rdf">https://dblp.org/rec/conf/icadl/KreutzWS19.rdf</a></li> <li><a href="https://dblp.org/rec/conf/icadl/KreutzWS19.nt">https://dblp.org/rec/conf/icadl/KreutzWS19.nt</a></li> </ul> <ul> <li><a href="https://dblp.org/pid/243/2849.rdf">https://dblp.org/pid/243/2849.rdf</a></li> <li><a href="https://dblp.org/pid/243/2849.nt">https://dblp.org/pid/243/2849.nt</a></li> </ul> <p>Note that there is at least some rate limiting in place to protect the live API from aggressive crawlers. That means, in case of a rather large number of queries, it is recommended to download the complete dump and do your queries locally.</p> <h2>Known limitations and future improvements</h2> <p>Numerous metadata aspects, like reference to the journal that an article is contained in or the affiliation of an author, are currently provided only as string literals. Future iterations of the schema will see these objects (i.e., publication venues and institutions/organizations) being added to the data model as true entities, together with their own metadata, persistent IDs and links to external resources. Hence, we don’t see the dblp RDF schema as final, but rather as a first step in providing the semantics of the dblp dataset in a more structured way. We also aim to provide a proper SPARQL endpoint in the near future.</p> <p>If you work with dblp RDF, we would of course be very grateful if you could share your thoughts, experiences, and criticisms with us. You can contact us as usual via email at <a href="mailto:dblp@dagstuhl.de">dblp(at)dagstuhl.de</a>, or send us your thoughts via Twitter <a href="https://twitter.com/dblp_org">@dblp_org</a>. Your kind support of dblp is very much appreciated!</p> <h2>Acknowledgments</h2> <p>We’d like to thank the dblp Advisory Board as well as numerous individuals from the semantic web community for their ideas and comments regarding the beta version of the dblp RDF. Your feedback helped us to significantly improve our schema. We’d like to particularly thank <a href="https://dblp.org/pid/48/1099.html">Silvio Peroni</a>, <a href="https://dblp.org/pid/b/HannahBast.html">Hannah Bast</a>, <a href="https://dblp.org/pid/s/RalfSchenkel.html">Ralf Schenkel</a> and <a href="https://dblp.org/pid/241/3046.html">Tobias Zeimetz</a> for their time for discussions, helpful criticisms, and concrete ideas that were crucial in developing the dblp RDF.</p> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=532" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:1;a:6:{s:4:"data";s:60:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:22:"6 million publications";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:56:"https://blog.dblp.org/2022/02/22/6-million-publications/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Tue, 22 Feb 2022 17:28:14 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:2:{i:0;a:5:{s:4:"data";s:4:"News";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:9:"milestone";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=568";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:11:"read as PDF";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:19:"Marcel R. Ackermann";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:731:"<p><img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2022/02/dblp-6M-Poster-2022-02.png" alt="" class="aligncenter size-full wp-image-569" width="595" height="2920" srcset="https://blog.dblp.org/wp-content/uploads/2022/02/dblp-6M-Poster-2022-02.png 595w, https://blog.dblp.org/wp-content/uploads/2022/02/dblp-6M-Poster-2022-02-61x300.png 61w, https://blog.dblp.org/wp-content/uploads/2022/02/dblp-6M-Poster-2022-02-313x1536.png 313w" sizes="(max-width: 595px) 100vw, 595px" /></p> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=568" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:2;a:6:{s:4:"data";s:57:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:57:"Results and learnings from the dblp User Survey 2020/2021";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:91:"https://blog.dblp.org/2021/08/25/results-and-learnings-from-the-dblp-user-survey-2020-2021/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Wed, 25 Aug 2021 16:00:18 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:1:{i:0;a:5:{s:4:"data";s:4:"Blog";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=444";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:301:"From December 2020 to January 2021, we asked you to participate in an online survey in order to help us understand how researchers are using dblp, and how dblp and its features are perceived by the public. The response exceeded our expectations: We received the amazingly high number of 1046 […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:19:"Marcel R. Ackermann";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:20989:"<p>From December 2020 to January 2021, we asked you to participate in an online survey in order to help us understand how researchers are using dblp, and how dblp and its features are perceived by the public. The response exceeded our expectations: We received the amazingly high number of 1046 responses to our survey in total, with 760 surveys fully answered and 286 surveys partially completed. This response provided us with a plethora of helpful remarks, constructive criticisms, novel ideas, and feature requests that will guide us in the development of dblp in the upcoming years. <strong>We would like to express our heartfelt gratitude for your kind support of dblp!</strong></p> <p>In this blog post, we will share with you the aggregate results of the user survey (with figures based only on the 760 completed surveys), and a summary of what we have learned from it so far.</p> <h2>So, who is using dblp?</h2> <p>We asked you about your professional background. Probably unsurprisingly, the vast majority (93.4%) of users come from an academic background. But we also have significantly large groups of users with a background in industry (14.5%) and education (20.9%).</p> <div id="attachment_449" style="width: 522px" class="wp-caption aligncenter"><img aria-describedby="caption-attachment-449" loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2021/07/survey2020-background.png" alt="Academia (93.4%), Industry (14.5%), Education (20.9%), Libraries (1.7%), Governance (2.4%), Other (0.1%)" class="wp-image-449 size-full" title="Academia (93.4%), Industry (14.5%), Education (20.9%), Libraries (1.7%), Governance (2.4%), Other (0.1%)" width="512" height="177" srcset="https://blog.dblp.org/wp-content/uploads/2021/07/survey2020-background.png 512w, https://blog.dblp.org/wp-content/uploads/2021/07/survey2020-background-300x104.png 300w" sizes="(max-width: 512px) 100vw, 512px" /><p id="caption-attachment-449" class="wp-caption-text">How would you describe your professional background? (multiple answers possible)</p></div> <p>dblp is around for more than 25 years now, and many veterans of the computer science community know about and are using it. In this regard, we were happy to learn that we still find many junior researchers among our users, as 43% of you reported that you consider yourself to still be in an early stage of your career.</p> <div id="attachment_453" style="width: 241px" class="wp-caption aligncenter"><img aria-describedby="caption-attachment-453" loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2021/07/survey2020-seniority.png" alt="junior (43.0%), senior (57.0%)" class="wp-image-453 size-full" title="junior (43.0%), senior (57%)" width="231" height="197" /><p id="caption-attachment-453" class="wp-caption-text">How would you best describe your professional seniority?</p></div> <p>And since when have you been using our services? It turns out that almost half of you (48.7%) have been using dblp for more than 10 years! That’s an amazing figure, and we are grateful and happy for your continued trust in us. At the other extreme, we learned that only less than 5% of our users just started to work with dblp during the past year.</p> <div id="attachment_454" style="width: 266px" class="wp-caption aligncenter"><img aria-describedby="caption-attachment-454" loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2021/07/survey2020-since.png" alt="more than 10 years (48.7%), 5 to 10 years (22.2%), 1 to 5 years (22.4%), less than 1 year (4.6%), I don't use dblp (2.1%)" class="wp-image-454 size-full" title="more than 10 years (48.7%), 5 to 10 years (22.2%), 1 to 5 years (22.4%), less than 1 year (4.6%), I don't use dblp (2.1%)" width="256" height="199" /><p id="caption-attachment-454" class="wp-caption-text">How long have you been using dblp?</p></div> <h2>How are people using dblp?</h2> <p>We already asked about your use cases with dblp in an earlier survey back in 2016. Based on that experience, we compiled a list of “standard” use cases and asked how often you are using dblp according to those standard use cases. The most frequent use case reported in the survey is the case of looking up a researcher’s bibliography in order to learn about their research output. More than 57% of all respondents stated that they are using this central feature of dblp at least once a week, while more than 85% stated that they are using it at least once a month.</p> <p>In total, we found almost all listed use cases in regular use by around 70% of our users. The only true outliers were our open data APIs and the dump download options, which we found in regular use by only 24% to 30% of our users. We are well aware that these specialized features are only relevant to a smaller group of “power users”, so this number is not surprising. Nevertheless, survey comments from this group of users left no doubt that they greatly rely on the easy and open access to our data for its reuse.</p> <div id="attachment_460" style="width: 851px" class="wp-caption aligncenter"><img aria-describedby="caption-attachment-460" loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2021/07/survey2020-use-cases.png" alt="to view a given researcher's research output (19.8%/38.5%/28.8%/8.7%/4.1%); to obtain BibTeX data (11.7%/22.6%/38.2%/14.3%/13.1%); to keep track of my own publications (20.4%/31.1%/26.7%/9.1%/12.7%); to get access to a full-text I am looking for (19.9%/27.1%/24.2%/9.0%/19.7%); to skim through a table of contents (4.8%/16.4%/35.5%/20.8%/22.6%); to learn about a conference's history (2.8%/11.5%/33.0%/27.8%/24.9%); to search for the latest publications (10.7%/23.1%/28.9%/11.1%/26.2%); to search for publications of a given topic (11.1%/21.6%/22.7%/14.9%/29.7%); to find experts/reviewers in a given field (4.7%/12.0%/22.6%/19.7%/41.0%); to retrieve open metadata via dblp's APIs (5.1%/7.9%/9.3%/9.4%/68.3%); to download the dblp XML data dump (1.6%/3.4%/6.5%/14.6%/73.9%)" class="wp-image-460 size-full" title="to view a given researcher's research output (19.8%/38.5%/28.8%/8.7%/4.1%); to obtain BibTeX data (11.7%/22.6%/38.2%/14.3%/13.1%); to keep track of my own publications (20.4%/31.1%/26.7%/9.1%/12.7%); to get access to a full-text I am looking for (19.9%/27.1%/24.2%/9.0%/19.7%); to skim through a table of contents (4.8%/16.4%/35.5%/20.8%/22.6%); to learn about a conference's history (2.8%/11.5%/33.0%/27.8%/24.9%); to search for the latest publications (10.7%/23.1%/28.9%/11.1%/26.2%); to search for publications of a given topic (11.1%/21.6%/22.7%/14.9%/29.7%); to find experts/reviewers in a given field (4.7%/12.0%/22.6%/19.7%/41.0%); to retrieve open metadata via dblp's APIs (5.1%/7.9%/9.3%/9.4%/68.3%); to download the dblp XML data dump (1.6%/3.4%/6.5%/14.6%/73.9%)" width="841" height="340" srcset="https://blog.dblp.org/wp-content/uploads/2021/07/survey2020-use-cases.png 841w, https://blog.dblp.org/wp-content/uploads/2021/07/survey2020-use-cases-300x121.png 300w, https://blog.dblp.org/wp-content/uploads/2021/07/survey2020-use-cases-768x310.png 768w" sizes="(max-width: 841px) 100vw, 841px" /><p id="caption-attachment-460" class="wp-caption-text">I use dblp …</p></div> <p>In addition to the standard use cases above, the survey also yielded a number of further types of uses as free text responses. The most frequently reported further uses include (in no particular order) <em>using dblp …</em></p> <ul> <li><em>as a data source for curating your own personal bibliography</em></li> <li><em>to study coauthor relationships</em></li> <li><em>to study venue-author relationships</em></li> <li><em>to find versions of a given paper (e.g., preprints, journal versions, etc.)</em></li> <li><em>as a resource in hiring decisions or career committees</em></li> <li><em>as a resource in editorial or program committee work, e.g., when looking for reviewers</em></li> <li><em>to conduct scientometric studies</em></li> <li><em>to assess the legitimacy of a conference or a journal</em></li> </ul> <h2>What are users thinking of dblp?</h2> <p>In the development of dblp and the curation of its data, we aim for a number of different goals. For instance, we seek to disambiguate homonymous authors and to cover all of the most relevant publication venues in computer science. That’s why we asked you for your assessment of whether or not we are successful at it. We were happy to learn that the vast majority of respondents fully agree or tend to agree that we are achieving these goals. We were particularly happy to learn that more than 96% of respondents agree or tend to agree that dblp meets the needs of the computer science research community. The aspect that is perceived most critically is our efforts to disambiguate homonymous authors. Here more than 12% of opinionated responses disagreed with the notion that we are successful at this.</p> <div id="attachment_465" style="width: 860px" class="wp-caption aligncenter"><img aria-describedby="caption-attachment-465" loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2021/08/survey2020-perception.png" alt="dblp meets the needs of the CS research community (59.2%/37.6%/3.0%/0.1%); dblp indexes (almost) all relevant CS publications (49.7%/42.0%/7.4%/0.8%); dblp provides clean and accurate metadata (55.5%/40.7%/3.4%/0.5%); dblp contents are selected on a neutral / unbiased basis (60.7%/35.5%/3.0%/0.8%); dblp successfully disambiguates homonymous authors (33.0%/54.9%/10.4%/1.7%); dblp's metadata is semantically rich and meaningful (49.47%/45.94%/4.06%/0.53%); Inquiries to the dblp team are resolved to my satisfaction (62.9%/30.0%/5.7%/1.4%); I can always contact the dblp team (53.3%/36.1%/7.6%/3.0%)" class="wp-image-465 size-full" title="dblp meets the needs of the CS research community (59.2%/37.6%/3.0%/0.1%); dblp indexes (almost) all relevant CS publications (49.7%/42.0%/7.4%/0.8%); dblp provides clean and accurate metadata (55.5%/40.7%/3.4%/0.5%); dblp contents are selected on a neutral / unbiased basis (60.7%/35.5%/3.0%/0.8%); dblp successfully disambiguates homonymous authors (33.0%/54.9%/10.4%/1.7%); dblp's metadata is semantically rich and meaningful (49.47%/45.94%/4.06%/0.53%); Inquiries to the dblp team are resolved to my satisfaction (62.9%/30.0%/5.7%/1.4%); I can always contact the dblp team (53.3%/36.1%/7.6%/3.0%)" width="850" height="266" srcset="https://blog.dblp.org/wp-content/uploads/2021/08/survey2020-perception.png 850w, https://blog.dblp.org/wp-content/uploads/2021/08/survey2020-perception-300x94.png 300w, https://blog.dblp.org/wp-content/uploads/2021/08/survey2020-perception-768x240.png 768w" sizes="(max-width: 850px) 100vw, 850px" /><p id="caption-attachment-465" class="wp-caption-text">Do you agree or disagree with the following statements?</p></div> <p>We also asked our users to directly compare dblp with a number of other research information services. We asked them to give a simple assessment whether dblp or the other service is considered more useful, or both services are considered equally useful. Of course, it made us quite proud to learn that dblp was assessed favorably when compared with almost all other major services.</p> <p>The one exception here is Google Scholar, with the majority of respondents considering dblp and Google Scholar to be equally useful. Many users did let us know in their comments that they don’t even consider dblp and Google Scholar to be competing services. Instead, they consider them to be different tools which have their unique advantages with respect to different tasks.</p> <div id="attachment_469" style="width: 771px" class="wp-caption aligncenter"><img aria-describedby="caption-attachment-469" loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2021/08/survey2020-competition.png" alt="Google Scholar (27.7%/50.6%/21.8%); ResearchGate (71.5%/21.0%/7.5%); CiteSeerX (84.6%/12.9%/2.5%); Scopus (65.9%/24.1%/9.9%); Semantic Scholar (76.8%/17.6%/5.6%); Web of Science (71.6%/20.2%/8.2%); Microsoft Academic (85.4%/11.5%/3.2%); Dimensions (88.4%/9.3%/2.3%)" class="wp-image-469 size-full" title="Google Scholar (27.7%/50.6%/21.8%); ResearchGate (71.5%/21.0%/7.5%); CiteSeerX (84.6%/12.9%/2.5%); Scopus (65.9%/24.1%/9.9%); Semantic Scholar (76.8%/17.6%/5.6%); Web of Science (71.6%/20.2%/8.2%); Microsoft Academic (85.4%/11.5%/3.2%); Dimensions (88.4%/9.3%/2.3%)" width="761" height="258" srcset="https://blog.dblp.org/wp-content/uploads/2021/08/survey2020-competition.png 761w, https://blog.dblp.org/wp-content/uploads/2021/08/survey2020-competition-300x102.png 300w" sizes="(max-width: 761px) 100vw, 761px" /><p id="caption-attachment-469" class="wp-caption-text">How do you rate dblp compared to these other research information tools?</p></div> <p>However, one should keep in mind that, unlike dblp, those other services above cover all science disciplines and do not focus only on computer science.</p> <h2>How satisfied are users with dblp’s features?</h2> <p>The dblp website and our open data service are the main interfaces users work with. Hence, it is important for us to know whether you are satisfied with our current implementation, and where we need to improve. It turned out that, in general, the survey participants are quite satisfied. The one noticeable outlier here are the “references & citations” detail pages, as more than 24% of respondents are rather dissatisfied or very dissatisfied with our implementation. This dissatisfaction we can fully understand, as <a href="https://blog.dblp.org/2019/11/11/open-citation-data-and-dblp/">this feature is still a work in progress</a> and the availability of open citation data is still limited.</p> <div id="attachment_467" style="width: 715px" class="wp-caption aligncenter"><img aria-describedby="caption-attachment-467" loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2021/08/survey2020-feature-satisfaction.png" alt="search interface (50.9%/41.7%/6.8%/0.6%); author bibliographies (63.1%/31.6%/4.5%/0.8%); references & citations (43.3%/32.6%/15.7%/8.4%); table of contents (55.6%/41.7%/2.3%/0.3%); directory of venues (49.1%/43.3%/7.1%/0.6%); open data APIs (38.8%/47.6%/10.2%/3.4%); XML dump download (44.3%/44.8%/9.0%/2.0%)" class="wp-image-467 size-full" title="search interface (50.9%/41.7%/6.8%/0.6%); author bibliographies (63.1%/31.6%/4.5%/0.8%); references & citations (43.3%/32.6%/15.7%/8.4%); table of contents (55.6%/41.7%/2.3%/0.3%); directory of venues (49.1%/43.3%/7.1%/0.6%); open data APIs (38.8%/47.6%/10.2%/3.4%); XML dump download (44.3%/44.8%/9.0%/2.0%)" width="705" height="228" srcset="https://blog.dblp.org/wp-content/uploads/2021/08/survey2020-feature-satisfaction.png 705w, https://blog.dblp.org/wp-content/uploads/2021/08/survey2020-feature-satisfaction-300x97.png 300w" sizes="(max-width: 705px) 100vw, 705px" /><p id="caption-attachment-467" class="wp-caption-text">Please rate your satisfaction with the current implementation of the following features in dblp</p></div> <p>Just as we had hoped, you had plenty to say when it came to suggestions for improving and expanding dblp. We compiled an internal list with literally dozens of your ideas for evaluation. Some of them have already been on our own to-do list, others were new and we are now seriously considering implementing a fair number of them. Frequent suggestions for improvements that we already had been considering or working on (some of which are actually quite close to a release by now) include:</p> <ul> <li><em>adding visualizations, like coauthor networks or topic clouds</em></li> <li><em>improved search capabilities and support for complex queries</em></li> <li><em>institutional bibliographies and search/filter by affiliation</em></li> <li><em>RSS update feeds for conferences and journals</em></li> <li><em>dblp as a knowledge graph and daily/persistent RDF dumps</em></li> <li><em>better dblp pages on mobile devices</em></li> <li><em>better interface/ticketing for dblp inquiries</em></li> </ul> <p>Suggestions for new features which we would like to consider at some point in the future include:</p> <ul> <li><em>customization of default filter settings for bibliographies</em></li> <li><em>a way to create team/lab group bibliographies</em></li> <li><em>overview of trending topics and topical RSS feeds</em></li> <li><em>help pages and tutorials for dblp’s features</em></li> </ul> <p>There have also been some frequent suggestions which we will most likely not pick up anytime soon. These include:</p> <ul> <li><em>author indices, venue rankings, or any other kind of scientometrics</em>. We actually receive a lot of requests throughout a year asking us to add all different kinds of indices, rankings, or quality labels to dblp. But we as a team are just not convinced that we could do this delicate issue justice, or that this kind of number crunching does even more good than harm in general. So, of course, you are still welcome to use all of our curated data to build any index or ranking at your heart’s content upon it. But we would rather choose not to do so ourselves.</li> <li><em>adding abstracts to dblp</em>. While we would love to do this, abstracts are creative works protected by copyright. So, in most cases we do not have the right to republish them. And even if we do, as is the case for many open access publications, it is still unclear how we can sustainably harvest abstracts in large numbers with clear and reliable license information attached to them. For instance, currently only 3.5% of all publications in dblp with a DOI provide both an abstract and license information via the Crossref API. That said, there is an <a href="https://i4oa.org/">Initiative for Open Abstracts (I4OA)</a> which dblp supports. So, maybe there is hope that this will change in the future?</li> </ul> <h2>What we’ve learned and what’s next</h2> <p>Here are some further key leanings from the user survey:</p> <ul> <li><strong>The dblp community is awesome. </strong>We asked for your opinions, criticisms, and suggestions, and you gave us plenty of those. Thanks again for that. But you did not stop there: 260 of you (that is 32.4% of all respondents) even took the time and used the free text fields to send us thanks, encouragements, and generally nice comments about our work, with some of them even being multiple paragraphs long. Thank you so much for that! Being blessed with such a concentrated stream of positive feedback did put a smile on our faces that lasted for days. And those comments will also be immensely helpful when we have to report to our public funders.</li> <li><strong>It makes perfect sense to ask the community for their ideas.</strong> Sometimes it is hard to understand why certain ideas cannot be realized in dblp unless you are familiar with the details of dblp’s implementation. Because of that, we were a bit afraid that such a user survey would yield many reasonable suggestions that we just could not possibly follow. As it turns out, this fear was completely unwarranted. Quite the opposite, the responses made us realize that there are many potential improvements which are not that far out of reach and which promise to provide a positive impact on the user experience and the value of our open data.</li> <li><strong>We need to better communicate our features.</strong> One thing that became apparent when reading your comments was that a fair number of dblp’s features, particularly those that have been added in recent years, are not generally known to our users yet. We received many comments stating: “I just learned from this survey that I can do THAT with dblp.” Such comments were made particularly often with respect to <a href="https://blog.dblp.org/2019/11/11/open-citation-data-and-dblp/">the integration of open citation data</a>. The “addition of references and citations to dblp” ended up to be the second most requested feature even though it has already been implemented since 2019. We should definitely spend more time making our features better known and on documenting and giving guidance on how to use them. Many of our F.A.Q. pages are outdated, and we need to do something about that, too.</li> <li><strong>We should do this again.</strong> We received so much valuable feedback and and so many insights to make it totally worth spending the time to create the survey and digging through the answers. While repeating a general survey will only make sense in a few years from now, it might still be worth exploring the idea of conducting a bit more regularly a number of smaller, more targeted questionnaires that address concrete topics.</li> </ul> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=444" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:3;a:6:{s:4:"data";s:57:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:14:"We are hiring!";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:47:"https://blog.dblp.org/2021/08/06/we-are-hiring/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Fri, 06 Aug 2021 10:00:38 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:1:{i:0;a:5:{s:4:"data";s:4:"News";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=487";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:337:"Interested in working on the world’s most comprehensive open indexing service in computer science? We are currently looking for three additional members to join the dblp team. This includes the opportunity to qualify yourself for a doctorate in the context of the challenges arising from managing and operating a semantic […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:19:"Marcel R. Ackermann";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:1656:"<p>Interested in working on the world’s most comprehensive open indexing service in computer science? We are currently looking for three additional members to join the dblp team. This includes the opportunity to <span role="presentation" dir="ltr">qualify yourself for a doctorate in the context of the </span><span role="presentation" dir="ltr">challenges arising from managing and operating a </span><span role="presentation" dir="ltr">semantic research </span><span role="presentation" dir="ltr">information infrastructure like dblp.</span></p> <p><img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2021/08/Job-Ad-Open-Positions-2021-10-01-1.png" alt="" class="aligncenter size-full wp-image-575" width="1549" height="1070" srcset="https://blog.dblp.org/wp-content/uploads/2021/08/Job-Ad-Open-Positions-2021-10-01-1.png 1549w, https://blog.dblp.org/wp-content/uploads/2021/08/Job-Ad-Open-Positions-2021-10-01-1-300x207.png 300w, https://blog.dblp.org/wp-content/uploads/2021/08/Job-Ad-Open-Positions-2021-10-01-1-1024x707.png 1024w, https://blog.dblp.org/wp-content/uploads/2021/08/Job-Ad-Open-Positions-2021-10-01-1-768x531.png 768w, https://blog.dblp.org/wp-content/uploads/2021/08/Job-Ad-Open-Positions-2021-10-01-1-1536x1061.png 1536w" sizes="(max-width: 1549px) 100vw, 1549px" /></p> <p>For more information, please read <a href="https://www.dagstuhl.de/job">our current job openings</a>.</p> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=487" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:4;a:6:{s:4:"data";s:69:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:119:"Schloss Dagstuhl becomes part of the National Research Data Infrastructure for Data Science and Artificial Intelligence";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:153:"https://blog.dblp.org/2021/07/02/schloss-dagstuhl-becomes-part-of-the-national-research-data-infrastructure-for-data-science-and-artificial-intelligence/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Fri, 02 Jul 2021 10:00:54 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:5:{i:0;a:5:{s:4:"data";s:13:"Press Release";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:15:"knowledge graph";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:2;a:5:{s:4:"data";s:4:"nfdi";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:3;a:5:{s:4:"data";s:9:"open data";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:4;a:5:{s:4:"data";s:13:"research data";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=461";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:373:"On July 2, 2021, the German Joint Science Conference (Gemeinsame Wissenschaftskonferenz, GWK) decided to fund the National Research Data Infrastructure (NFDI) consortium for Data Science and Artificial Intelligence (NFDI4DataScience) with an amount in the double-digit millions over a duration of five years. In this consortium, Schloss Dagstuhl has joined forces […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:13:"Michael Gerke";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:1340:"<p>On July 2, 2021, the German Joint Science Conference (Gemeinsame Wissenschaftskonferenz, GWK) decided to fund the <a href="https://www.nfdi.de/en-gb">National Research Data Infrastructure (NFDI)</a> consortium for Data Science and Artificial Intelligence (<strong>NFDI4DataScience</strong>) with an amount in the double-digit millions over a duration of five years. In this consortium, Schloss Dagstuhl has joined forces with numerous other leading research infrastructure providers in Germany.</p> <p>The NFDI is a collaborative, nationwide network to systematically index, interconnect, and make openly available the valuable stock of data from science and research. Dagstuhl’s renown research infrastructures – supporting research itself, the publication and dissemination of research results, and finding and reusing them – will be further developed, expanded, and integrated as part of NFDI. The results of this consortium will be provided and maintained as an open research data corpus and knowledge graph for the computer science community well beyond the initial funding duration.</p> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=461" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:5;a:6:{s:4:"data";s:69:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:35:"New dblp URL scheme and API updates";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:69:"https://blog.dblp.org/2020/08/18/new-dblp-url-scheme-and-api-changes/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Tue, 18 Aug 2020 13:57:03 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:5:{i:0;a:5:{s:4:"data";s:4:"Blog";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:17:"Feature Spotlight";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:2;a:5:{s:4:"data";s:3:"api";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:3;a:5:{s:4:"data";s:10:"identifier";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:4;a:5:{s:4:"data";s:7:"website";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=370";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:289:"A big change has just been made to the dblp website … and, in case we did our job right, you may even haven’t noticed yet: With the latest update, we introduced major changes to the dblp URL scheme. In particular, this applies to the URLs of all author bibliographies […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:19:"Marcel R. Ackermann";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:11750:"<p>A big change has just been made to the dblp website … and, in case we did our job right, you may even haven’t noticed yet: With the latest update, we introduced <strong>major changes to the dblp URL scheme</strong>. In particular, this applies to the URLs of all author bibliographies listed on dblp, which are now served under a new and persistent URL.</p> <p>But don’t worry, just like the first time we made such a change about eight years ago, we try to keep all previously existing URLs as a redirect for the foreseeable future.</p> <p>In this post, we talk about the reasons that made us abandon our old URL scheme and why you will most likely want to update your hyperlinks and bookmarks anyway.</p> <h1>So, what’s the problem with the old URL scheme?</h1> <p>Author bibliographies have been an integral part of dblp since its inception in 1993. Since all author name strings are unique in dblp (even if we often have to enforce uniqueness by adding a magic <a href="https://blog.dblp.org/2020/03/18/name-disambiguation-suffixes-in-dblp/">name disambiguation suffix number</a>) it was quite natural to just use an author’s name in order to locate her bibliography. For example, <a href="https://en.wikipedia.org/wiki/Jim_Gray_(computer_scientist)">Jim Gray</a> is listed in dblp under the unique name “Jim Gray 0001”. Hence, a simple rewriting rule derived the following URL for his bibliography webpage:</p> <ul> <li><a href="https://dblp.org/pers/g/Gray_0001:Jim.html">https://dblp.org/pers/g/Gray_0001:Jim.html</a></li> </ul> <p>This approach has served us well through the years. But recently, the need for persistent unique identifiers has become more and more evident. And those bibliography URLs tied to an author’s name have two major problems: They are <strong>neither unique, nor persistent</strong>.</p> <p>For instance, <a href="https://en.wikipedia.org/wiki/Donald_Knuth">Don Knuth</a> is listed in dblp as both “Donald E. Knuth” and “Donald Ervin Knuth”. Hence, we used to end up with two URLs pointing to the same bibliography webpage, namely:</p> <ul> <li><a href="https://dblp.org/pers/k/Knuth:Donald_E=.html">https://dblp.org/pers/k/Knuth:Donald_E=.html</a></li> <li><a href="https://dblp.org/pers/k/Knuth:Donald_Ervin.html">https://dblp.org/pers/k/Knuth:Donald_Ervin.html</a></li> </ul> <p>While this situation could be solved by serving HTTP redirects, the transient nature of those URLs poses a far more dire problem. As the URL is directly tied to the exact spelling of a name in dblp, any correction or edit that changed an author’s name in the metadata did also change these URLs. E.g., at one point in time, we had Don Knuth’s bibliography also listed without his middle name, that is, as:</p> <ul> <li><a href="https://dblp.org/pers/k/Knuth:Donald.html">https://dblp.org/pers/k/Knuth:Donald.html</a></li> </ul> <p>Since we corrected all of Don Knuth’s metadata records to always contain his middle name, this URL has lost its purpose and is no longer showing any bibliography at all. This leaves external hyperlinks pointing to ugly “404: Not Found” error pages and breaks meaningful open data links in the semantic web.</p> <h1>PIDs to the rescue!</h1> <p>As the need for stable links to dblp bibliographies had become evident, we already established a second set of persistent and unique identifiers some years ago: Every author has also been assigned an internal PID that is intended to never change. Attentive users may already have noticed these PIDs as part of the persistent short URLs given in the web UI.</p> <p><img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2020/07/bertino-pid.png" alt="" class="aligncenter size-full wp-image-381" width="500" height="200" srcset="https://blog.dblp.org/wp-content/uploads/2020/07/bertino-pid.png 500w, https://blog.dblp.org/wp-content/uploads/2020/07/bertino-pid-300x120.png 300w" sizes="(max-width: 500px) 100vw, 500px" /></p> <p>However, for reasons deeply rooted in dblp’s 25 years old technical layout (that are not easy to explain in a simple blog post) PID-based URLs so far have only been able to play the role of a HTTP redirect and were not the prime web address displayed in your browsers URL bar. This has changed with the recent update.</p> <p>Moving forward, the old name-based URLs will be retired and dblp bibliographies will be served exclusively based on their PIDs. We will, of course, try to keep all incoming links alive via HTTP 301 Redirects. However, <strong>we strongly encourage you to update your bookmarks and hyperlinks</strong> to the new, persistent scheme as the PID-based URLs will also become the basis of our updated data API URLs.</p> <h1>The format of a dblp PID</h1> <p>So, what does this mean in practice? Take the bibliography of <a href="https://en.wikipedia.org/wiki/Kristin_Lauter">Kristin Lauter</a> as an as an example. Her bibliography is, and will always remain, to be found using the unique dblp PID “08/1510” and the associated URL:<a href="https://en.wikipedia.org/wiki/Barbara_Liskov"><span></span></a></p> <ul> <li><a href="https://dblp.org/pid/08/1510.html">https://dblp.org/pid/08/1510.html</a></li> </ul> <p>Or, as a second example, have a look at the bibliography of <a href="https://en.wikipedia.org/wiki/Ayanna_Howard">Ayanna Howard</a>. In dblp, she is listed with PID “11/399” and, hence, under the URL</p> <ul> <li><a href="https://dblp.org/pid/11/399.html">https://dblp.org/pid/11/399.html</a></li> </ul> <p>However, please be aware that by their look, dblp PIDs come in two flavors. Starting in 2009, newly created bibliographies have been assigned automatically minted, numerical PIDs like the two PIDs given above. The vast majority (more than 99%) of all PIDs you find in dblp today follow this numerical format.</p> <p>Yet, in the early days of dblp, internal keys have been created exclusively by hand. Hence, PIDs of those earliest authors ended up being, again, modeled after their name. As an example, have a look at <a href="https://en.wikipedia.org/wiki/Barbara_Liskov">Barbara Liskov</a>, who is listed with PID “l/BarbaraLiskov” and at URL:</p> <ul> <li><a href="https://dblp.org/pid/l/BarbaraLiskov.html">https://dblp.org/pid/l/BarbaraLiskov.html</a></li> </ul> <p>The crucial difference to the name-based URLs we discussed earlier is that those name-based PIDs have never been changed once they had been minted, even if the actual name had.</p> <p>From a technical viewpoint, there is no difference between those flavors of PIDs. In general, a dblp PID should always be considered to be <strong>just an arbitrary string of case-sensitive, alphanumeric ASCII letters</strong> (plus occasional dashes and slashes) with no special meaning attached to them.</p> <h1>A streamlined API URL scheme</h1> <p>Finding and browsing scholarly bibliography HTML websites is fine. But also having that same metadata easily accessible in a machine-readable format is even better. The dblp team is committed to making all of our metadata available as open data and to facilitate reuse. Hence, the URL scheme of our data APIs has also received attention, and its format has been streamlined in order to simplify its usage. From now on, the bibliography metadata API for all data formats will follow the same general scheme:</p> <ul> <li>https://dblp.org/pid/<person-PID>.<data-format-file-extension></li> </ul> <p>Again, take the bibliography of <a href="https://en.wikipedia.org/wiki/Barbara_Liskov"><span>Barbara Liskov</span></a> as a concrete example. Her bibliography is uniquely identified in dblp with the PID “l/BarbaraLiskov” and the resource URL:</p> <ul> <li><a href="https://dblp.org/pid/l/BarbaraLiskov">https://dblp.org/pid/l/BarbaraLiskov</a></li> </ul> <p>By adding an appropriate file extension to that URL, you can then request the bibliography in your preferred data format, such as:</p> <ul> <li><a href="https://dblp.org/pid/l/BarbaraLiskov.html">https://dblp.org/pid/l/BarbaraLiskov.html</a> (text/html, i.e.: the webpage)</li> <li><a href="https://dblp.org/pid/l/BarbaraLiskov.xml">https://dblp.org/pid/l/BarbaraLiskov.xml</a> (application/xml)</li> <li><a href="https://dblp.org/pid/l/BarbaraLiskov.rss">https://dblp.org/pid/l/BarbaraLiskov.rss</a> (application/rss+xml)</li> <li><a href="https://dblp.org/pid/l/BarbaraLiskov.bib">https://dblp.org/pid/l/BarbaraLiskov.bib</a> (application/x-bibtex)</li> <li><a href="https://dblp.org/pid/l/BarbaraLiskov.ris">https://dblp.org/pid/l/BarbaraLiskov.ris</a> (application/x-research-info-systems)</li> </ul> <p>This is mirrored by our API serving metadata of a single publication. Here, given a (persistent) dblp publication key (say, “journals/tocs/CastroL02”),the publication is uniquely identified by the resource URL</p> <ul> <li><a href="https://dblp.org/rec/journals/tocs/CastroL02">https://dblp.org/rec/journals/tocs/CastroL02</a></li> </ul> <p>and its web page and metadata can be retrieved using:<a href="https://dblp.org/rec/journals/tocs/CastroL02"></a></p> <ul> <li><a href="https://dblp.org/rec/journals/tocs/CastroL02.html">https://dblp.org/rec/journals/tocs/CastroL02.html</a> (text/html, i.e.: the webpage)</li> <li><a href="https://dblp.org/rec/journals/tocs/CastroL02.xml">https://dblp.org/rec/journals/tocs/CastroL02.xml</a> (application/xml)</li> <li><a href="https://dblp.org/rec/journals/tocs/CastroL02.bib">https://dblp.org/rec/journals/tocs/CastroL02.bib</a> (application/x-bibtex)</li> <li>and so on.</li> </ul> <p>In addition to that, the API URLs (without file extension) also support content negotiation via the HTTP “Accept” header and MIME type. There is still more to tell about the dblp open data API, and we will most certainly dedicate a future blog post to that topic.</p> <h1>Linking open data</h1> <p>If you are maintaining or building a service based on data from dblp, we strongly encourage you to update your URLs linking to dblp. This is particularly true in the context of linked open data in the semantic web, which relies on persistent URLs to identify entities.</p> <p>Please note that while our PIDs are for the most part persistent, there may still be rare cases when they do change or expire. This usually only happens in scenarios where a personalized bibliography is so flawed beyond repair (e.g., a case of multiple homonymous authors mixed into one bibliography) that it is more reasonable to let the old bibliography expire and to recreate proper bibliographies from scratch, or when the bibliography has just been a disambiguation placeholder (say, a pseudo-bibliography of all unassigned publications of some “D. Wang”) that has outlived its purpose. We also have a redirection mechanism in place which lets a request to a deprecated PID respond with an HTTP status 301 Redirect in order to point to the most recent one. This is especially relevant in cases when two bibliographies have been merged.</p> <p>Fortunately, we already had the new PID URLs in mind when we started adding <a href="https://www.wikidata.org/wiki/Property:P2456">dblp PID links to WikiData</a> some time ago. Today, more than 40.000 person entity links already exist between <a href="https://www.wikidata.org">wikidata.org</a> and dblp. Given that we finally adopted persistent URLs as first-class citizens, I am confident that many more will follow.</p> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=370" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:6;a:6:{s:4:"data";s:63:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:19:"dblp and ORCID 2020";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:53:"https://blog.dblp.org/2020/07/20/dblp-and-orcid-2020/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Mon, 20 Jul 2020 09:06:59 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:3:{i:0;a:5:{s:4:"data";s:4:"Blog";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:5:"orcid";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:2;a:5:{s:4:"data";s:10:"statistics";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=351";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:294:"In the past, we often discussed how helpful ORCIDs are for our work. An ORCID (Open Researcher and Contributor ID) is a unique personal identifier that scientists can attach to their work. The ORCID ensures that this work is linked to the correct scientist an not to someone else with […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:13:"Florian Reitz";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:7668:"<p>In the past, we often discussed <a href="https://blog.dblp.org/2018/07/13/orcid-state-of-dblp/">how helpful</a> <a href="https://blog.dblp.org/2018/10/12/external-identifiers-in-dblp/">ORCIDs </a><a href="https://blog.dblp.org/2020/01/08/corrections-in-dblp-2019/">are for</a> <a href="https://blog.dblp.org/2020/03/18/name-disambiguation-suffixes-in-dblp/">our work</a>. An ORCID (Open Researcher and Contributor ID) is a unique personal identifier that scientists can attach to their work. The ORCID ensures that this work is linked to the correct scientist an not to someone else with the same or similar name. We at dblp use ORCIDs to create clean bibliographies. A bibliography should list the work of a single researcher and of course a unique identifier is very helpful here. In this post I will give a short overview on how we handle ORCID and how prevalent it is in DBLP just now. If you do not have an ORCID, consider getting one (for free) at <a href="https://orcid.org/">orcid.org</a>. Please make sure that it is attached to your publications whenever possible.</p> <p>We started experimenting with ORCID in 2016. A more complex integration began in 2017 when we also started to show ORCIDs in bibliographies and individual publications. At the same time we made ORCIDs available with our data releases. We obtain most ORCIDs directly from the publishers together with other publication meta data such as title and author names. ORCID was established in 2012 and many publishers started to attach ORCIDs to their publications only recently (or do not do that at all). But authors can claim such works on their own. This information is provided by ORCID via their annual data dump which we also map to our data set. This means that ORCID has become a common type of data in our collection. Below you see the fraction of signatures in dblp for which an ORCID is known. A signature is a pair of author name and paper. So a paper with five authors has five signatures.</p> <div id="attachment_353" style="width: 610px" class="wp-caption aligncenter"><img aria-describedby="caption-attachment-353" loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2020/07/orcidSignatures-1-300x169.png" alt="" class="wp-image-353" width="600" height="338" srcset="https://blog.dblp.org/wp-content/uploads/2020/07/orcidSignatures-1-300x169.png 300w, https://blog.dblp.org/wp-content/uploads/2020/07/orcidSignatures-1-1024x577.png 1024w, https://blog.dblp.org/wp-content/uploads/2020/07/orcidSignatures-1-768x433.png 768w, https://blog.dblp.org/wp-content/uploads/2020/07/orcidSignatures-1.png 1196w" sizes="(max-width: 600px) 100vw, 600px" /><p id="caption-attachment-353" class="wp-caption-text">Fraction of signatures with ORCID</p></div> <p>An ORCID is now available for 12% of all our signatures and that number is going up. At the moment, we add ORCIDs to dblp in batches. This means that a publication can appear in dblp without any ORCIDs. A few days later they are added. We are working to streamline this process for a faster integration.</p> <p><span id="more-351"></span>Of course signatures from recent publications have a better chance to have an ORCID. However, via the claim mechanism authors can attach ORCIDs to older publications as well. Below you can see the fraction of signatures with an ORCID by the year in which the paper was published:</p> <div id="attachment_355" style="width: 1021px" class="wp-caption aligncenter"><img aria-describedby="caption-attachment-355" loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2020/07/orcidsPerYear.png" alt="" class="wp-image-355 size-full" width="1011" height="412" srcset="https://blog.dblp.org/wp-content/uploads/2020/07/orcidsPerYear.png 1011w, https://blog.dblp.org/wp-content/uploads/2020/07/orcidsPerYear-300x122.png 300w, https://blog.dblp.org/wp-content/uploads/2020/07/orcidsPerYear-768x313.png 768w" sizes="(max-width: 1011px) 100vw, 1011px" /><p id="caption-attachment-355" class="wp-caption-text">Fraction of signatures with ORCID by publication year</p></div> <p>For 2020 we observe a coverage of above 18%. However, even before the year 2000, coverage is above 2% ! The oldest publication in dblp with an ORCID is from 1961. This means that ORCIDs can help with cleaning up bibliographies from a time where other meta data were often problematic (e.g., many abbreviated first names).</p> <p>The primary reason we use ORCIDs is to create bibliographies. This happens in two ways:</p> <ul> <li>We find defective assignments in dblp. E.g. a bibliography is associated with two ORCIDs. This probably means that this bibliography actually represents two persons. ORCID plays a major role in the increased number of corrections we discussed <a href="https://blog.dblp.org/2020/01/08/corrections-in-dblp-2019/">here</a>.</li> <li>When adding a new publication (we do this manually with support from algorithms) a known ORICID can help to identify bibliographies. E.g., we immediately see that a paper by ‘John Doe’ should by assigned to the bibliography ‘John Doe 0042’. This reduces assignment errors and speeds up the integration process.</li> </ul> <p>As part of this process, we also confirm ORCIDs for bibliographies. You can identify these pages by the green ORCID displayed next to the name (instead of a gray one). We assume that bibliographies with a confirmed ORCID are clean. At the moment there are 69,620 bibliographies with confirmed ORCID. Below you can see how the number of bibliographies with confirmed ORCID developed:</p> <div id="attachment_358" style="width: 610px" class="wp-caption aligncenter"><img aria-describedby="caption-attachment-358" loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2020/07/orcidConfirmed-300x169.png" alt="" class="wp-image-358" width="600" height="337" srcset="https://blog.dblp.org/wp-content/uploads/2020/07/orcidConfirmed-300x169.png 300w, https://blog.dblp.org/wp-content/uploads/2020/07/orcidConfirmed-768x432.png 768w, https://blog.dblp.org/wp-content/uploads/2020/07/orcidConfirmed.png 918w" sizes="(max-width: 600px) 100vw, 600px" /><p id="caption-attachment-358" class="wp-caption-text">Number of bibliographies with confirmed ORCID</p></div> <p>This means that about 2.4% of all our bibliographies have a confirmed ORCID.</p> <p>ORCIDs are not only used to clean up bibliographies. We also use it to link dblp to other projects. E.g., if there a dblp bibliography with a confirmed ORCID and a Wikidata entity with the same ORCID we link the two entities. At the moment there are 41,121 links to Wikidata in dblp. Many of those are created by matching ORCIDs.</p> <p>Some random facts</p> <ul> <li>The International Conference of Applied Computing to Support Industry: Innovation and Technology 2019 (<a href="https://dblp.org/db/conf/acrit/acrit2019.html">https://dblp.org/db/conf/acrit/acrit2019.html</a>) has an ORCID available for 114 of its 123 signatures. This makes it the best covered proceedings in dblp.</li> <li>The<a href="https://dblp.org/db/journals/csysl/index.html"> IEEE Control Systems Letters</a> is the journal with the highest ORCID coverage (1226 of 1633 signatures or 75%).</li> <li>At the moment of this writing <a href="https://dblp.org/pid/64/6304">Mohamed-Slim Alouini</a> from KAUS has 1203 publications with an ORCID attached to it. No other dblp bibliography has more publications with ORICDs.</li> </ul> <p> </p> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=351" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:7;a:6:{s:4:"data";s:60:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:62:"Dr. Michael Ley to receive the ACM Distinguished Service Award";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:95:"https://blog.dblp.org/2020/05/13/dr-michael-ley-to-receive-the-acm-distinguished-service-award/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Wed, 13 May 2020 18:00:59 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:2:{i:0;a:5:{s:4:"data";s:13:"Press Release";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:5:"award";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=343";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:380:"The world’s largest computing society, the Association for Computer Machinery (ACM), has bestowed its prestigious ACM Distinguished Service Award 2019 on computer scientist Dr. Michael Ley of Schloss Dagstuhl Leibniz-Center for Informatics and of Trier University. ACM thus recognizes Dr. Ley’s achievement in the creation and unceasing editorial curation of […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:13:"Michael Gerke";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:4053:"<p><strong>The world’s largest computing society, the <a href="https://www.acm.org/">Association for Computer Machinery (ACM)</a>, has bestowed its prestigious <a href="https://awards.acm.org/award_winners/ley_2903227">ACM Distinguished Service Award 2019</a> on computer scientist <a href="https://dblp.org/db/about/ml/">Dr. Michael Ley</a> of Schloss Dagstuhl Leibniz-Center for Informatics and of Trier University. ACM thus recognizes Dr. Ley’s achievement in the creation and unceasing editorial curation of the <a href="https://dblp.org">dblp computer science bibliography</a>.</strong></p> <p>Dr. Ley has developed dblp from a small and initially highly specialized collection of metadata about scholarly publications in the fields of “data bases (db) and logic programming (lp)” into the most comprehensive, open bibliographic information service for all disciplines of computer science. The database was created by Dr. Ley at the University of Trier in 1993. Today, it is operated by Dr. Ley and his dblp team at Schloss Dagstuhl Leibniz-Center for Informatics and it indexes more than 5 million scholarly articles, monographs, and collections from the field of computer science.</p> <p>The dblp service at <a href="https://dblp.org" class="">https://dblp.org</a> is highly popular with computer scientists all over the world: About every 1.5 seconds someone starts a new session with dblp. During peak times dblp’s servers answer more than 100 requests per second. The service is particularly appreciated for its accuracy and its ability to distinguish between authors with the same name.</p> <p>Dr. Michael Ley grew up in a small bookstore. After a diploma in computer science from RWTH Aachen, he went on to receive his doctorate from the University of Trier. For 27 years now, Dr. Michael Ley has been shaping the development of dblp. Dr. Ley’s contributions through dblp have already been honored in previous years, for example with the ACM Special Interest Group on Management of Data (SIGMOD) Contributions Award in 2003.</p> <p><strong>Press contact:</strong><br /> Michael Gerke<br /> Schloss Dagstuhl – Leibniz Center for Informatics<br /> Oktavieallee<br /> 66687 Wadern, Germany<br /> phone: +49 – 681 – 302 43 92<br /> email: michael.gerke@dagstuhl.de</p> <p>The <strong>dblp computer science bibliography</strong> (<a href="https://dblp.org">https://dblp.org</a>) is the premier online open bibliograhpic data base and search engine on computer science publications. dblp supports computer scientists all over the world by providing open access to high-quality bibliographic metadata and hyperlinks to the electronic editions of publications. The database has received funding from various sources over the years, such as the German Federal Ministry of Research and Education, the Deutsche Forschungsgemeinschaft (German Research Foundation, DFG), Microsoft Research, the Max Planck Institute for Informatics, and the Klaus Tschira Foundation. Schloss Dagstuhl <span style="color: #000000;">– </span>Leibniz-Center for Informatics has been providing the lion share of the resources to dblp since 2011. In November 2018 it took over complete responsibility for dblp, thus ensuring stable permanent operation.</p> <p><strong>Schloss Dagstuhl – Leibniz-Center for Informatics </strong> (<a href="https://www.dagstuhl.de/en/">https://www.dagstuhl.de/en/</a>) is part of the Leibniz Association, which represents about 100 leading German non-university research institutes and scientific infrastructures. Because of their national importance, the federal government and the state governments jointly fund the institutes of the Leibniz Association.</p> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=343" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:8;a:6:{s:4:"data";s:60:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:22:"5 million publications";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:56:"https://blog.dblp.org/2020/03/26/5-million-publications/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Thu, 26 Mar 2020 09:05:15 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:2:{i:0;a:5:{s:4:"data";s:4:"News";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:9:"milestone";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=337";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:11:"read as PDF";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:19:"Marcel R. Ackermann";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:731:"<p><img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2020/03/dblp-5M-Poster-2020-03.png" alt="" class="aligncenter size-full wp-image-338" width="595" height="2693" srcset="https://blog.dblp.org/wp-content/uploads/2020/03/dblp-5M-Poster-2020-03.png 595w, https://blog.dblp.org/wp-content/uploads/2020/03/dblp-5M-Poster-2020-03-66x300.png 66w, https://blog.dblp.org/wp-content/uploads/2020/03/dblp-5M-Poster-2020-03-226x1024.png 226w" sizes="(max-width: 595px) 100vw, 595px" /></p> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=337" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:9;a:6:{s:4:"data";s:60:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:67:"dblp computer science bibliography surpasses 5 million publications";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:101:"https://blog.dblp.org/2020/03/24/dblp-computer-science-bibliography-surpasses-5-million-publications/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Tue, 24 Mar 2020 11:12:42 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:2:{i:0;a:5:{s:4:"data";s:13:"Press Release";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:9:"milestone";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=328";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:339:"On March 23rd, 2020, the dblp computer science bibliography indexed its 5 millionth publication. By doing so, the world’s largest openly accessible metadata collection of computer science publications doubled in size during the course of just six years. Thus, dblp consolidates its role as an export hit from Germany, which […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:19:"Marcel R. Ackermann";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:5311:"<p><strong>On March 23rd, 2020, the dblp computer science bibliography indexed its 5 millionth publication. By doing so, the world’s largest openly accessible metadata collection of computer science publications doubled in size during the course of just six years. Thus, dblp consolidates its role as an export hit from Germany, which is of world renown among the international computer science community.</strong></p> <p>Modern research requires the immediate and comprehensive access to current publications to meet the needs of an ever faster evolving and ever more complex research landscape. However, high-quality metadata and information about recent publications are often quite difficult to obtain. Search engines like Google allow a broad insight into the Internet but have neither guarantees of data quality, nor completeness, nor any semantic organization of search results. Commercial scholarly databases sell metadata as an expensive service, but in many disciplines (such as in computer science), their coverage is insufficient and the data quality is quite poor.</p> <p>For over 25 years now, the dblp computer science bibliography has substantially contributed to solving this dilemma in the field of computer science by providing open, quality-checked, and curated bibliographic metadata. Via its website <a href="https://dblp.org">https://dblp.org</a>, dblp provides an insight into the complex interrelationships and networks of international computer science research. In recent years, the service has grown to be a powerful tool that supports computer scientists worldwide in their search for articles, ideas and experts. The dblp team places particular emphasis on the reliability and quality of the metadata entries by employing a rigorous, manual data curation process. Also, all data is made openly available for reuse as a common good under the “CC0 1.0 <span class="st">Public Domain Dedication</span>” license.</p> <p>Today, dblp indexes more than 5 million scholarly articles, monographs, and collections, written by more than 2.4 million authors, thus being the world’s most comprehensive, openly accessible bibliographic database in computer science. Every year, the collection grows by more than 400,000 new entries; this corresponds to more than 1,600 new, curated entries per working day. Every day the dblp servers answer over one million queries, each month half a million users from all over the world visit dblp’s website. The database has already been honored with several prizes such as the ACM SIGMOD Contributions Award.</p> <p>The dblp computer science bibliography was founded in 1993 by Dr. Michael Ley at the University of Trier. In creating dblp, Ley reacted to the special publication culture in computer science, where often difficult to obtain conference contributions play a more important role than publications in scholarly journals. From 2010 to 2018, the database was operated jointly with Schloss Dagstuhl – Leibniz Center for Informatics. Since the end of 2018, Schloss Dagstuhl has taken over the operation of dblp completely with its newly constituted dblp team in Trier, Germany, to ensure the long-term sustainability of the infrastructure.</p> <p><strong>Press contact:</strong><br /> Michael Gerke<br /> Schloss Dagstuhl – Leibniz Center for Informatics<br /> Oktavieallee<br /> 66687 Wadern, Germany<br /> phone: +49 – 681 – 302 43 92<br /> email: michael.gerke@dagstuhl.de</p> <p><strong>Schloss Dagstuhl – Leibniz Center for Informatics</strong> (<a href="https://dagstuhl.de">https://dagstuhl.de</a>) pursues its mission of furthering world class research in computer science by facilitating communication and interaction between researchers. The objective of Schloss Dagstuhl is to promote basic and application-oriented research, to support advanced, scientific training in the field of informatics, and to promote the transfer of knowledge between academia and industry.</p> <p>Schloss Dagstuhl operates a meeting center for informatics in Wadern in the south west of Germany, specifically designed to encourage and facilitate communication and interaction. More than 3,500 researchers from all over the world come there every year to participate in events of Schloss Dagstuhl’s scientific program. Including and thus promoting young talents is seen as an important part of the efforts. In addition to its seminar programme, Schloss Dagstuhl further supports the computer science research community through the renowned dblp computer science bibliography and as a widely used open access publisher.</p> <p>Since 2005, Schloss Dagstuhl is a member of the Leibniz Association, a union of 96 German non-university research institutes and scientific infrastructure facilities from various branches of study. Due to their national importance, the institutes of the Leibniz Association are jointly funded by the Federal Government and the Federal States (Bundesländer) of Germany.</p> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=328" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:10;a:6:{s:4:"data";s:79:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:5:{s:0:"";a:7:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:36:"Name disambiguation suffixes in dblp";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:70:"https://blog.dblp.org/2020/03/18/name-disambiguation-suffixes-in-dblp/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"comments";a:1:{i:0;a:5:{s:4:"data";s:79:"https://blog.dblp.org/2020/03/18/name-disambiguation-suffixes-in-dblp/#comments";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Wed, 18 Mar 2020 12:29:19 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:3:{i:0;a:5:{s:4:"data";s:4:"Blog";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:12:"data quality";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:2;a:5:{s:4:"data";s:14:"disambiguation";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=318";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:324:"At the end of March 2020 dblp provides bibliographies for almost 2.5 million scientists. With this number, it is not surprising that we have namesakes – scientists with the exact same name. For historical reasons, all persons in dblp must have different names. We circumvent this problem by assigning numeric […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:13:"Florian Reitz";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:3093:"<p>At the end of March 2020 dblp provides bibliographies for almost 2.5 million scientists. With this number, it is not surprising that we have namesakes – scientists with the exact same name. For historical reasons, all persons in dblp must have different names. We circumvent this problem by assigning numeric suffixes to names that are not unique. E.g., there are multiple Thomas Müller in dblp. So we name them <em>Thomas Müller 0001</em>, <em>Thomas Müller 0002</em> and so on. See our <a href="https://dblp.org/faq/1474704.html">FAQ here</a> for more details.</p> <p>Identifying authors with the same name is a very important task. For example, the bibliography of Thomas Müller 0001 should not list papers by another Thomas Müller. This is a very common problem. I recently <a href="https://www.wikidata.org/w/index.php?title=Q43666&type=revision&diff=1122979035&oldid=1115522288">removed</a> a wrongly assigned dblp person identifier from the Wikidata record of Bayern Munich soccer player Thomas Müller. We invest a lot of resources into handling scientists with identical names. In March 2020, the total number of bibliographies with a numeric suffix (e.g., 0001) is 38,822. Disambiguation suffixes were used for 9664 different base names such as <em>Thomas Müller</em>. The base name with the most different numeric suffixes (i.e., identified authors) is Wei Wang. You can see the 223 identified authors for this base name <a href="https://dblp.org/pers/hd/w/Wang:Wei">here</a> (you might need to extend the ‘<span>Other persons with a similar name’ tab). Below, you can see how the number of bibliographies with a suffix and the number of base names developed. The strong increase caused by increased funding of our infrastructure and most of all because of data provided via ORCID.</span></p> <p><img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2020/03/numSuffix-3.png" alt="" width="605" height="340" class="wp-image-324 size-full aligncenter" srcset="https://blog.dblp.org/wp-content/uploads/2020/03/numSuffix-3.png 605w, https://blog.dblp.org/wp-content/uploads/2020/03/numSuffix-3-300x169.png 300w" sizes="(max-width: 605px) 100vw, 605px" /></p> <p><span> </span></p> <p>In March 2020 there are 450,859 publications in dblp where at least one author has a disambiguation suffix (that is 9% of all publications in dblp). The publication with the most authors with numeric suffix is <a href="https://dblp.org/rec/conf/eccv/KristanLMFPZVBL18.html">this</a> (13 authors have a numeric suffix)</p> <p><strong>If you have a common name</strong> or you know that there is another researcher with the same name and we have mixed the publications up: <a href="https://dblp.org/faq/1474666.html">contact us</a> with a list of your publications so we can create a clean bibliography for you.</p> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=318" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:36:"http://wellformedweb.org/CommentAPI/";a:1:{s:10:"commentRss";a:1:{i:0;a:5:{s:4:"data";s:75:"https://blog.dblp.org/2020/03/18/name-disambiguation-suffixes-in-dblp/feed/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:38:"http://purl.org/rss/1.0/modules/slash/";a:1:{s:8:"comments";a:1:{i:0;a:5:{s:4:"data";s:1:"1";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:11;a:6:{s:4:"data";s:79:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:5:{s:0:"";a:7:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:19:"Corrections in dblp";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:58:"https://blog.dblp.org/2020/01/08/corrections-in-dblp-2019/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"comments";a:1:{i:0;a:5:{s:4:"data";s:67:"https://blog.dblp.org/2020/01/08/corrections-in-dblp-2019/#comments";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Wed, 08 Jan 2020 10:20:32 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:3:{i:0;a:5:{s:4:"data";s:4:"Blog";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:11:"corrections";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:2;a:5:{s:4:"data";s:12:"data quality";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=292";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:298:"Our primary goal is to ensure that bibliographies (list of publications) of authors in dblp are correct. This means that all publications of a person should be listed in the same list and that a list should contain only publications from one specific person. It can be difficult to ensure […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:13:"Florian Reitz";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:3191:"<p>Our primary goal is to ensure that bibliographies (list of publications) of authors in dblp are correct. This means that all publications of a person should be listed in the same list and that a list should contain only publications from one specific person. It can be difficult to ensure this and despite our best efforts, we assign publications to the wrong publication list. Because of this, we frequently check our data set and correct mistakes. The following figure shows the number of corrections we made in the last twenty years.</p> <p><img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2020/01/correctionsDblp2019-1-1024x640.png" alt="correction in dblp by year 1999-2019" class="aligncenter wp-image-298 size-large" width="750" height="469" srcset="https://blog.dblp.org/wp-content/uploads/2020/01/correctionsDblp2019-1-1024x640.png 1024w, https://blog.dblp.org/wp-content/uploads/2020/01/correctionsDblp2019-1-300x188.png 300w, https://blog.dblp.org/wp-content/uploads/2020/01/correctionsDblp2019-1-768x480.png 768w, https://blog.dblp.org/wp-content/uploads/2020/01/correctionsDblp2019-1.png 1283w" sizes="(max-width: 750px) 100vw, 750px" /></p> <p>In a <strong>merge </strong>correction, two (or more) publication lists are merged. E.g., we discover that <em>A. Jones</em> and <em>Adam Jones </em>are the same person. A <strong>split</strong> fixes a defect where multiple authors listed on the same publication list. E.g., <em>Adam Jones</em> is split into <em>Adam Jones 0001</em> and <em>Adam Jones 0002</em> (see our <a href="https://dblp.org/faq/1474704.html">FAQ</a> for more details). A <strong>distribute</strong> is a correction where we move publications from one publication list to another. A single correction can affect a large number of publications. I.e., merging two large bibliographies counts as one correction. Each correction is hand checked.</p> <p>As you can see, the number of corrections has increased in recent years with a peak in 2019. There are multiple reasons for this:</p> <ul> <li>Our data set becomes larger. That means: more room for mistakes, but also more data to detect problematic cases automatically.</li> <li>Because of our extended federal and state funding, we have more resources to look at potential defects.</li> <li><strong>ORCID! </strong>We now use <a href="https://orcid.org">ORCID</a> data provided with publications as a central tool in tracing potential errors. An ORCID uniquely identifies an author and makes person disambiguation much easier. If you do not have one <strong>please register with ORCID (for free) </strong>and make sure your ORCID is associated with your publications (many publishers make this possible now).</li> </ul> <p>We still have large lists of potential errors, so 2020 should be another productive year :-). If you encounter any error in dblp, please let us know (see our <a href="https://dblp.org/faq/1474623.html">FAQ</a> for details).</p> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=292" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:36:"http://wellformedweb.org/CommentAPI/";a:1:{s:10:"commentRss";a:1:{i:0;a:5:{s:4:"data";s:63:"https://blog.dblp.org/2020/01/08/corrections-in-dblp-2019/feed/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:38:"http://purl.org/rss/1.0/modules/slash/";a:1:{s:8:"comments";a:1:{i:0;a:5:{s:4:"data";s:1:"1";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:12;a:6:{s:4:"data";s:69:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:25:"Unpaywalled article links";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:59:"https://blog.dblp.org/2019/12/13/unpaywalled-article-links/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Fri, 13 Dec 2019 15:00:56 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:5:{i:0;a:5:{s:4:"data";s:4:"Blog";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:17:"Feature Spotlight";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:2;a:5:{s:4:"data";s:7:"feature";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:3;a:5:{s:4:"data";s:11:"open access";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:4;a:5:{s:4:"data";s:9:"unpaywall";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=233";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:354:"The dblp computer science bibliography provides more than 5 million hyperlinks for research publications. Most of those links point to article landing pages within a publisher’s digital library. A growing number of publishers have adopted the open access model of publishing, thereby allowing the dissemination of research results free of […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:19:"Marcel R. Ackermann";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:4878:"<p>The dblp computer science bibliography provides more than 5 million hyperlinks for research publications. Most of those links point to article landing pages within a publisher’s digital library. A growing number of publishers have adopted the <a href="https://en.wikipedia.org/wiki/Open_access">open access model of publishing</a>, thereby allowing the dissemination of research results free of cost and without any access barrier. You may have noticed that we have recently begun to mark such hyperlinks in dblp with a special orange badge signalling their availability. (Please also note that this badge is still work in progress, and that there are still plenty of openly accessible articles in dblp that go unrecognized.)</p> <p><img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2019/12/oa-badge.png" alt="" class="aligncenter size-full wp-image-246" width="600" height="100" srcset="https://blog.dblp.org/wp-content/uploads/2019/12/oa-badge.png 600w, https://blog.dblp.org/wp-content/uploads/2019/12/oa-badge-300x50.png 300w" sizes="(max-width: 600px) 100vw, 600px" /></p> <p>However, most publishers in computer science do still demand an active subscription or a fee for access to research articles. Due to the way dblp collects its metadata, these paywalled document locations are usually the only ones that are listed in dblp. But thanks to the API of <a href="https://unpaywall.org">Unpaywall</a>, in many cases, we are now able to provide an open alternative.</p> <h1>Integration of Unpaywall data</h1> <p>Unpaywall was launched in 2017 by <a href="https://our-research.org/team">Heather Piwowar and Jason Priem</a> as a free <a href="https://unpaywall.org/products/extension">browser extension</a> that allows researchers to legally bypass the publishers’ paywall by retrieving openly accessible versions of scholarly publications. This includes independently archived author copies (e.g., hosted on an institute’s web server), preprints in open repositories, or open full versions of paywalled extended abstracts. In this relatively short time, Unpaywall has received considerable attention and has already been referenced in <a href="https://www.semanticscholar.org/search?q=unpaywall">dozens (if not hundreds) of publications</a>. Currently, the database lists about 25 million openly accessible documents across all scholarly disciplines, with a fair number of them being computer science publications. Besides providing a <a href="https://unpaywall.org/products/api">REST API</a>, Unpaywall data is also available as <a href="https://unpaywall.org/products/snapshot">complete database snapshots</a>.</p> <p>Since the integration of Unpaywall at dblp relies on external API calls from your browser (which might be a privacy consideration for you), you will need to opt-in once before any data can be retrieved. You can find the option to enable “unpaywalled article links” in the user settings menu in the top-right corner. While we do not have any reason to believe that your connection data will be misused, we do not have any control over the remote servers either. So please proceed with care and consider checking the <a href="https://unpaywall.org/legal/privacy">Unpaywall privacy policy</a>.</p> <p><img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2019/12/unpaywall-privacy-note.png" alt="" class="aligncenter size-full wp-image-241" width="435" height="425" srcset="https://blog.dblp.org/wp-content/uploads/2019/12/unpaywall-privacy-note.png 435w, https://blog.dblp.org/wp-content/uploads/2019/12/unpaywall-privacy-note-300x293.png 300w" sizes="(max-width: 435px) 100vw, 435px" /></p> <p>Once enabled, the dblp website will automatically look for openly accessible versions of paywalled articles while you are browsing dblp. The links to those unpaywalled versions will be dynamically added to a publication’s usual list of external links, together with a small green marker.</p> <p><img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2019/12/unpaywall-badge.png" alt="" class="aligncenter size-full wp-image-248" width="600" height="200" srcset="https://blog.dblp.org/wp-content/uploads/2019/12/unpaywall-badge.png 600w, https://blog.dblp.org/wp-content/uploads/2019/12/unpaywall-badge-300x100.png 300w" sizes="(max-width: 600px) 100vw, 600px" /></p> <p>Since there is a slight delay when contacting the live API, please don’t be surprised if you see such green badges suddenly pop up while you are browsing. We hope that this new integration will make it even easier for you to access publications via dblp.</p> <p> </p> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=233" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:13;a:6:{s:4:"data";s:82:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:5:{s:0:"";a:7:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:21:"License change to CC0";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:56:"https://blog.dblp.org/2019/11/24/licence-change-to-cc-0/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"comments";a:1:{i:0;a:5:{s:4:"data";s:65:"https://blog.dblp.org/2019/11/24/licence-change-to-cc-0/#comments";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Sat, 23 Nov 2019 23:00:22 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:4:{i:0;a:5:{s:4:"data";s:4:"News";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:3:"cc0";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:2;a:5:{s:4:"data";s:7:"dataset";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:3;a:5:{s:4:"data";s:7:"license";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=174";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:305:"Starting today, all of dblp’s data will be released under the CC0 1.0 Creative Commons Public Domain License. This affects all metadata releases, in particular the daily and monthly data dumps and data retrieved from the web APIs. This change will make it easier for you to reuse our data. […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:13:"Florian Reitz";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:2506:"<p>Starting today, all of dblp’s data will be released under the <a href="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 Creative Commons Public Domain License</a>. This affects all metadata releases, in particular the <a href="https://dblp.org/faq/1474679.html">daily and monthly data dumps</a> and data retrieved from <a href="https://dblp.org/faq/13501473.html">the web APIs</a>. <strong>This change will make it easier for you to reuse our data.</strong> In a nutshell, you can use our data without asking permission, for any purpose (including commercial purposes), and even without attributing it to us. However, we will very much appreciate if you mention dblp as the source of the data set and/or if you provide a hyperlink to <a href="https://dblp.org">https://dblp.org</a>.</p> <p><img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2019/11/500px-CC0_button.svg_.png" alt="" class="aligncenter size-full wp-image-182" width="500" height="176" srcset="https://blog.dblp.org/wp-content/uploads/2019/11/500px-CC0_button.svg_.png 500w, https://blog.dblp.org/wp-content/uploads/2019/11/500px-CC0_button.svg_-300x106.png 300w" sizes="(max-width: 500px) 100vw, 500px" /></p> <p>Our previous license, the <a href="https://opendatacommons.org/licenses/by/1.0/">ODC-BY 1.0 Open Data Commons Attribution License</a>, was selected as a fitting license back in 2011, when Creative Commons licenses were not yet a best choice for handling data publications. But since then, it has become somewhat superseded by CC 4.0 licenses. Furthermore, it is still not clear how compatible ODC-BY actually is with modern Creative Commons licenses. And, probably most important, the attribution requirement makes reuse and data integration more difficult in linked open data scenarios like <a href="https://www.wikidata.org/">WikiData</a>.</p> <p>To ensure compatibility with all existing integrations of our data, we will <strong>continue to use ODC-BY as a secondary license</strong> for the foreseeable future. If you are currently using data from dblp, please check if CC0 meets your requirements as well.</p> <p>For further information, please <a href="https://dblp.org/faq/1474677.html">see our FAQ</a>.</p> <p> </p> <p> </p> <p> </p> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=174" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:36:"http://wellformedweb.org/CommentAPI/";a:1:{s:10:"commentRss";a:1:{i:0;a:5:{s:4:"data";s:61:"https://blog.dblp.org/2019/11/24/licence-change-to-cc-0/feed/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:38:"http://purl.org/rss/1.0/modules/slash/";a:1:{s:8:"comments";a:1:{i:0;a:5:{s:4:"data";s:1:"1";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:14;a:6:{s:4:"data";s:69:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:27:"Open citation data and dblp";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:61:"https://blog.dblp.org/2019/11/11/open-citation-data-and-dblp/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Mon, 11 Nov 2019 17:12:06 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:5:{i:0;a:5:{s:4:"data";s:4:"Blog";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:17:"Feature Spotlight";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:2;a:5:{s:4:"data";s:9:"citations";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:3;a:5:{s:4:"data";s:7:"feature";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:4;a:5:{s:4:"data";s:9:"open data";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=148";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:283:"You may not always notice this, but the dblp team is constantly working on the dblp website and its APIs in order to improve the quality of the services and the value for our users. Often these are just small details and fixes, but sometimes we introduce new features. Yet, […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:19:"Marcel R. Ackermann";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:11743:"<p>You may not always notice this, but the dblp team is constantly working on the dblp website and its APIs in order to improve the quality of the services and the value for our users. Often these are just small details and fixes, but sometimes we introduce new features. Yet, in the past, we often rolled out those features silently with no major announcements. This has led to a number of improvements that many users of dblp may not be aware of. In order to make these features more widely known, we are starting this new “feature spotlight” series of blog posts. And the start will be a big one.</p> <h1>Open citation data in computer science</h1> <p>Most of the time, we add new features because the community asks us to do so. And without any doubt, one of the most frequently requested features in the past years has been the addition of citations and references for the publications in dblp. While we fully understand the desire for this kind of data, our answer has always been: “Sorry, but this kind of data is unavailable to us, and there is no way that a small team like ours could collect all this data ourselves.”</p> <p>The good news: This has changed during the course of the past few years. While our team is still too small to tackle such a task by ourselves, a huge chunk of the existing bibliographic citation data has been opened up to the public for reuse. And this is mainly true thanks to three actors out there. First, there is <a href="https://www.crossref.org">Crossref</a>, one of the major infrastructure providers behind the DOI system. For some years now, Crossref has been providing public access to publisher-deposited reference and citation data through their APIs. Second, there is <a href="https://opencitations.net/">OpenCitations</a>, an awesome infrastructure run by David Shotton (University of Oxford) and Silvio Peroni (University of Bologna). OpenCitations collects citation metadata from openly available sources (like Crossref) and provides access to the data via APIs and as OpenCitations Corpus (OCC). And finally, there is the <a href="https://i4oc.org">Initiative for Open Citations (I4OC)</a>. I4OC is a joint initiative of researchers, infrastructure provides, and further stakeholders (including Crossref and OpenCitations) to promote the unrestricted availability of scholarly citation data. I4OC has already had a remarkable impact by convincing more than 1200 bigger and smaller scholarly publishers, societies, and universities to deposit and open up their citation data with Crossref. As of September 2019, this corresponds to 59% of all Crossref-deposited articles with references.</p> <div id="attachment_213" style="width: 610px" class="wp-caption aligncenter"><a href="https://i4oc.org/#publishers"><img aria-describedby="caption-attachment-213" loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2019/11/icoc-progress.png" alt="How many citations are open today?" class="wp-image-213 size-full" width="600" height="80" srcset="https://blog.dblp.org/wp-content/uploads/2019/11/icoc-progress.png 600w, https://blog.dblp.org/wp-content/uploads/2019/11/icoc-progress-300x40.png 300w" sizes="(max-width: 600px) 100vw, 600px" /></a><p id="caption-attachment-213" class="wp-caption-text">Thanks to the I4OC, the fraction of publications with open references has grown from 1% to 59% out of 47.6 million articles with references deposited with Crossref (as of September 2019).</p></div> <p>Mid 2019, we conducted some experiments evaluating the coverage of citation data for computer science publications in the Crossref and OpenCitations data. To our surprise, the coverage was already quite significant. Out of 200,000 randomly sampled DOIs in dblp, we found that:</p> <ul> <li>28.5% of the papers had references available at Crossref. On average, each of those papers listed 25.1 references (including many unstructured and non-DOI references).</li> <li>52.2% of the papers had references listed at OpenCitations. On average, each of those papers listed 13.9 references (listing only DOI references).</li> <li>59.6% of the papers had incoming citations listed at OpenCitations. On average, each of those papers listed 11.5 citing papers (listing only DOI sources).</li> </ul> <h1>References and citations at dblp</h1> <p>Using the openly available reference and citation data of Crossref and OpenCitations, we were able to build a new “references & citations” details page for each publication in dblp that is assigned with a DOI. To find this details page, just click on the link in a paper’s drop-down menu:</p> <p><img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2019/11/refs-n-cites.png" alt="" class="aligncenter size-full wp-image-198" width="600" height="183" srcset="https://blog.dblp.org/wp-content/uploads/2019/11/refs-n-cites.png 600w, https://blog.dblp.org/wp-content/uploads/2019/11/refs-n-cites-300x92.png 300w" sizes="(max-width: 600px) 100vw, 600px" /></p> <p>As with all features that rely on external API calls from your browser (which might be a privacy consideration for you), you will need to opt-in once before any data can be retrieved. While we do not have any reason to believe that your connection data will be misused, we do not have any control over the remote servers either. So please proceed with care.</p> <p><img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2019/11/privacy-note.png" alt="" class="aligncenter size-full wp-image-201" width="600" height="240" srcset="https://blog.dblp.org/wp-content/uploads/2019/11/privacy-note.png 600w, https://blog.dblp.org/wp-content/uploads/2019/11/privacy-note-300x120.png 300w" sizes="(max-width: 600px) 100vw, 600px" /></p> <p>Once the citation data has been retrieved from Crossref and OpenCitations, it will be matched against the curated metadata records listed in dblp. The result will be displayed in one of the following ways:</p> <ul> <li>If the reference target is listed in dblp and successfully matches via its DOI, you will see a “pretty” list entry that states the full and curated metadata in the same way as usually seen in dblp bibliographies, together with its external links, export options, and so on.<br /> <img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2019/11/PeroniS12.png" alt="" class="size-full wp-image-193 aligncenter" width="600" height="60" srcset="https://blog.dblp.org/wp-content/uploads/2019/11/PeroniS12.png 600w, https://blog.dblp.org/wp-content/uploads/2019/11/PeroniS12-300x30.png 300w" sizes="(max-width: 600px) 100vw, 600px" /></li> <li>If the reference target itself is not available in dblp (maybe because it is out of the scope of dblp, its addition to dblp is still pending, or the matching with its dblp record failed for some reason) you will see a textual bibliographic reference string describing the reference. We unfortunately cannot give curated metadata for items that are not indexed by dblp, so we use a plain description as given by the sources.<br /> <img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2019/11/MacRobertsM89.png" alt="" class="aligncenter size-full wp-image-192" width="600" height="60" srcset="https://blog.dblp.org/wp-content/uploads/2019/11/MacRobertsM89.png 600w, https://blog.dblp.org/wp-content/uploads/2019/11/MacRobertsM89-300x30.png 300w" sizes="(max-width: 600px) 100vw, 600px" /></li> <li>In some rare cases, you might notice a list item labeled with “(missing metadata)”. This means that this is the first time that we have encountered that DOI in dblp, and we do not even have a textual reference string ready yet. In this case, a background process will make sure that a textual reference will be available soon, usually within minutes.<br /> <img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2019/11/missing-metadata.png" alt="" class="aligncenter size-full wp-image-194" width="460" height="37" srcset="https://blog.dblp.org/wp-content/uploads/2019/11/missing-metadata.png 460w, https://blog.dblp.org/wp-content/uploads/2019/11/missing-metadata-300x24.png 300w" sizes="(max-width: 460px) 100vw, 460px" /></li> <li>Of course, you might be unlucky and find that there is no open reference or citation data available for a publication. In that case, we unfortunately cannot list anything.<br /> <img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2019/11/no-open-data.png" alt="" class="aligncenter size-full wp-image-195" width="400" height="120" srcset="https://blog.dblp.org/wp-content/uploads/2019/11/no-open-data.png 400w, https://blog.dblp.org/wp-content/uploads/2019/11/no-open-data-300x90.png 300w" sizes="(max-width: 400px) 100vw, 400px" /></li> </ul> <p>Current statistics (as of November 2019) show that you can find at least a partial reference list for 51.6% of all publications in dblp, and that 45.7% of all publications list at least one citing paper. Please note that using open data sources, it is currently not possible to retrieve citation data for publications without a DOI. So, in many ways, the reference and citation details are still a work in progress at dblp.</p> <h1>The missing part</h1> <p>When using the reference and citation listings from dblp, you should always keep in mind that a number of important publishers in computer science (such as IEEE and Elsevier) are still not supporting open citation data. Hence, there is a systemic bias in the availability of such data. In particular, we would certainly not encourage anyone to conduct citation based studies based on such incomplete data. If you find that there is no open citation data available, this does not necessarily mean that an article has not been cited before.</p> <p>It is our understanding that the reference lists given in scholarly publications are an integral part of a publication’s metadata and need to be openly available to the public. <strong>If you find that citation data of your publications are not openly available yet, then please consider asking your publisher to release your reference lists to the public.</strong> It is after all you, the researcher, who has been spending a lot of time and effort in order to compile those reference lists.</p> <p>Alternatively, OpenCitations recently startet crowdsourcing the collection of open citations with their new CROCI index. If you happen to have DOI-to-DOI citation information ready that you collected as part of your research, then you might consider donating your data to that CC0 corpus:</p> <ul> <li><a href="https://opencitations.wordpress.com/2019/02/07/crowdsourcing-open-citations-with-croci/">https://opencitations.wordpress.com/2019/02/07/crowdsourcing-open-citations-with-croci/</a></li> <li><a href="https://github.com/opencitations/croci">https://github.com/opencitations/croci</a></li> </ul> <p>Another promising community initiative is <a href="https://meta.wikimedia.org/wiki/WikiCite">WikiCite</a>. WikiCite is a project of the Wikimedia movement aiming at the creation of a comprehensive knowledge base with rich information about every scholarly reference in Wikipedia. This metadata can be curated openly by anyone within the Wikidata framework:</p> <ul> <li><a href="https://meta.wikimedia.org/wiki/WikiCite">https://meta.wikimedia.org/wiki/WikiCite</a></li> <li><a href="https://www.wikidata.org/wiki/Wikidata:WikiProject_Source_MetaData">https://www.wikidata.org/wiki/Wikidata:WikiProject_Source_MetaData</a></li> </ul> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=148" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:15;a:6:{s:4:"data";s:69:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:63:"Bibliographic database “dblp” celebrates silver anniversary";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:91:"https://blog.dblp.org/2018/11/16/bibliographic-database-dblp-celebrates-silver-anniversary/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Fri, 16 Nov 2018 14:00:49 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:5:{i:0;a:5:{s:4:"data";s:13:"Press Release";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:11:"anniversary";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:2;a:5:{s:4:"data";s:10:"colloquium";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:3;a:5:{s:4:"data";s:3:"lzi";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:4;a:5:{s:4:"data";s:9:"uni-trier";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=130";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:328:"For more than 25 years now, the dblp computer science bibliography has been indexing and supporting international computer science research. Since today, the future of the database has also been secured at the Leibniz Center for Computer Science in Schloss Dagstuhl. On this occasion, a festive colloquium will be held […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:19:"Marcel R. Ackermann";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:5802:" <p><strong>For more than 25 years now, the dblp computer science bibliography has been indexing and supporting international computer science research. Since today, the future of the database has also been secured at the Leibniz Center for Computer Science in Schloss Dagstuhl.</strong></p> <p>On this occasion, a <a href="https://dblp.org/25y">festive colloquium</a> will be held at the University of Trier on Friday, November 23rd, 2018. Under the motto “25 years of dblp – 2^22 entries” the database celebrates the milestone of more than 4 million indexed computer science publications. As first keynote speaker, Prof. Dr. Gerhard Weikum (Research Director of the Max Planck Institute for Computer Science in Saarbrücken and former member of the German Council of Science and Humanities) will give an insight into the opportunities and challenges of machine knowledge. In the second keynote, Prof. Dr. Claude Kirchner (INRIA France, Chairman of the INRIA Operational Committee for the Assessment of Ethical and Legal Risks) will talk about strategic tool that allow researchers to maintain sovereignty over their work and to guarantee the benefit for the common good in a drastically changing scientific landscape.</p> <p>The transfer of the database from the University of Trier to the Leibniz Center for Informatics in Schloss Dagstuhl takes place just in time for the anniversary. A corresponding agreement was passed by the committees of both institutions and will be signed at the festive colloquium. With the decision of the Joint Science Conference (GWK) on November 16th, 2018, a new Schloss Dagstuhl branch office for the dblp team has been established on Campus II of the University of Trier. The database will continue to be operated and researched in close cooperation with the University, the Department of Computer Sciences, and the Trier Center for Informatics Research and Technology (CIRT).</p> <p>The dblp computer science bibliography was founded in 1993 by Dr. Michael Ley at the University of Trier. In creating dblp, Ley reacted to the special publication culture in computer science, where conference contributions – which are often quite difficult to research – play a more important role than publications in scholarly journals. Since 2010, the database has been operated and further developed together with Schloss Dagstuhl in order to improve the thematic coverage and to ensure the long-term sustainability of the infrastructure. Today, dblp indexes more than 4.3 million scholarly articles, monographs, and collections (as of November 2018), being the world’s most comprehensive, openly accessible bibliographic database in computer science. Every year, the collection grows by more than 400,000 new entries; this corresponds to more than 1,600 new entries per working day.</p> <p>In recent years, the database has grown to be a powerful tool that supports computer scientists worldwide in their search for articles, ideas and experts. The dblp team places particular emphasis on the reliability and quality of the metadata entries. Via its website <a href="https://dblp.org">https://dblp.org</a>, dblp provides an insight into the complex interrelationships and networks of international computer science research. All data is also made available for reuse to the general public via so-called “Linked Open Data” interfaces. Every month, the dblp servers record more than 30 million page impressions by over half a million users from all over the world. The database has already been awarded with several prizes such as the ACM SIGMOD Contributions Award.</p> <p><strong>Press contact:</strong><br />Michael Gerke<br />Schloss Dagstuhl – Leibniz Center for Informatics<br />Oktavieallee<br />66687 Wadern, Germany<br />phone: +49 – 681 – 302 43 92<br />email: michael.gerke@dagstuhl.de</p> <p><strong>Schloss Dagstuhl – Leibniz Center for Informatics</strong> (<a href="https://dagstuhl.de">https://dagstuhl.de</a>) pursues its mission of furthering world class research in computer science by facilitating communication and interaction between researchers. The objective of Schloss Dagstuhl is to promote basic and application-oriented research, to support advanced, scientific training in the field of informatics, and to promote the transfer of knowledge between academia and industry.</p> <p>Schloss Dagstuhl operates a meeting center for informatics in Wadern in the south west of Germany, specifically designed to encourage and facilitate communication and interaction. More than 3,500 researchers from all over the world come there every year to participate in events of Schloss Dagstuhl’s scientific program. Including and thus promoting young talents is seen as an important part of the efforts. In addition to its seminar programmme, Schloss Dagstuhl further supports the computer science research community through the renowned dblp computer science bibliography and as a widely used open access publisher.</p> <p>Since 2005, Schloss Dagstuhl is a member of the Leibniz Association, a union of 93 German non-university research institutes and scientific infrastructure facilities from various branches of study. Due to their national importance, the institutes of the Leibniz Association are jointly funded by the Federal Government and the Federal States (Bundesländer) of Germany.</p> <div class="dkpdf-button-container" style=" text-align:left "> <a class="dkpdf-button" href="/feed/?pdf=130" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a> </div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:16;a:6:{s:4:"data";s:75:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:28:"External identifiers in dblp";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:62:"https://blog.dblp.org/2018/10/12/external-identifiers-in-dblp/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Fri, 12 Oct 2018 14:03:28 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:7:{i:0;a:5:{s:4:"data";s:4:"Blog";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:17:"Feature Spotlight";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:2;a:5:{s:4:"data";s:7:"feature";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:3;a:5:{s:4:"data";s:10:"identifier";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:4;a:5:{s:4:"data";s:5:"orcid";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:5;a:5:{s:4:"data";s:10:"statistics";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:6;a:5:{s:4:"data";s:8:"wikidata";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:27:"https://blog.dblp.org/?p=82";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:302:"There are now more than 60,000 manually confirmed external IDs linked with dblp author bibliographies. This is quite an improvement. Below you can see the number of external identifiers at the end of each year compared to the numbers in October 2018 As you can see, our definition of external […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:13:"Florian Reitz";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:5604:"<p>There are now more than 60,000 manually confirmed external IDs linked with dblp author bibliographies. This is quite an improvement. Below you can see the number of external identifiers at the end of each year compared to the numbers in October 2018</p> <p><img loading="lazy" class="aligncenter wp-image-86 size-full" src="https://blog.dblp.org/wp-content/uploads/2018/10/dblpIdentifiers.png" alt="" width="605" height="340" srcset="https://blog.dblp.org/wp-content/uploads/2018/10/dblpIdentifiers.png 605w, https://blog.dblp.org/wp-content/uploads/2018/10/dblpIdentifiers-300x169.png 300w" sizes="(max-width: 605px) 100vw, 605px" /></p> <p>As you can see, our definition of external identifier is a bit wider than usual. E.g., we include Twitter profiles here. ORCID, Google Scholar, Wikipedia and Twitter should be known to the readers. Wikidata is a LOD data store build on top of Wikpedia that provides query-able data. The others are</p> <ul> <li>GND: identifier from the German national Library <a href="http://www.dnb.de/EN/Standardisierung/GND/gnd_node.html">see here</a></li> <li>ISNI: global authority file <a href="http://www.isni.org/">see here</a></li> <li>zbMath: biographies of Mathematicians <a href="https://zbmath.org/">see here</a></li> <li>Math Genealogy: the Mathematics Genealogy Project. Stores relations between researchers and the thesis advisers <a href="http://www.genealogy.ams.org/index.php">see here</a></li> <li>ResearcherID is a commercial authority service <a href="http://www.researcherid.com">see here</a></li> <li>ACM DL is an entry in the ACM digital library <a href="https://dl.acm.org/">see here</a></li> </ul> <p>There a more types of external links. To see them hover the mouse over the small figure next to the name in the author bibliographies. E.g..</p> <p><img loading="lazy" class="alignnone size-full wp-image-84" src="https://blog.dblp.org/wp-content/uploads/2018/10/nameHeader.png" alt="" width="210" height="57" /></p> <h1>Why are these identifiers important?</h1> <p>There are a number of reasons why we search for external identifiers. The most important ones are:</p> <ul> <li>External IDs provide valuable <strong>information for curating bibliographies</strong>. The bibliographic metadata dblp processes is very sparse, that is, we usually only know a publication title, author names, venue names, and a few extra information like pagination. This is often insufficient to properly disambiguate authors (i.e., to make sure that all of an author’s publications are listed on a single bibliography, and that the bibliography does not contain publications from other persons with the same name). Linked external data sources might provide author-curated publication lists, affiliation information, or details on an author’s area of research which helps our editors. In particular, external identifiers are an important indicator when automatically scanning for bibliographies that need curation.</li> <li>Links to external resources allow our users to get more complete <strong>information about an author</strong>. An important role of a dblp bibliography is to provide an overview of an author’s scholarly work. Maybe a user is studying a paper and is looking for more interesting work from its authors. External resources provide more information on the researchers. E.g., external databases may list works from outside of computer science, or a scientist’s twitter channel gives more insight into her work.</li> <li>External resources give us <strong>information about stuff that is missing</strong>. Locating publications can be difficult. In particular smaller, community-run workshops can be well hidden. An linked external resources might provide a publication list that we can scan for such hidden venues.</li> </ul> <h1>Why did the number of identifiers increase so fast?</h1> <p>Essentially, we spent a lot more of our time working on this topic.</p> <p>But this is of course not the whole story. In particular, one important factor is that we were able to build upon existing open data collections. An important role in this process is played by Wikidata, which acts as a kind of open data hub for identifiers. Hence, a typical workflow is as follows:</p> <ol> <li>We add a Wikidata identifier to a dblp bibliography.</li> <li>We periodically harvest linked Wikidata entities for further identifiers, such as ORCIDs.</li> </ol> <p>We still check all IDs we collect manually. But having a data hub like Wikidata ready makes our task much easier.</p> <p>We also have become more effective at monitoring the quality of our bibliographies in dblp. Especially thanks to <a href="https://blog.dblp.org/2018/07/13/orcid-state-of-dblp/">the integration of ORCID data</a>, we are now able to identify bibliographies that do either align with or show conflicts with linked ORCID profiles. These cases are easy to check and fix by our editors, and in the process we collect and link further ORCIDs with the curated bibliographies in dblp.</p> <p>ORCIDs can themselves then be used to identify matching Wikidata entities, and vice versa. In doing so, we are able to aggregate and expand upon a network of linked identifiers for each bibliography. Of course, our findings are not only made available through dblp. We also periodically feed back the results of our work to Wikidata.</p> <div class="dkpdf-button-container" style=" text-align:left "> <p> <a class="dkpdf-button" href="/feed/?pdf=82" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a></p></div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:17;a:6:{s:4:"data";s:85:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:5:{s:0:"";a:7:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:19:"ORCID state of dblp";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:53:"https://blog.dblp.org/2018/07/13/orcid-state-of-dblp/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"comments";a:1:{i:0;a:5:{s:4:"data";s:62:"https://blog.dblp.org/2018/07/13/orcid-state-of-dblp/#comments";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Fri, 13 Jul 2018 11:34:41 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:5:{i:0;a:5:{s:4:"data";s:4:"Blog";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:8:"homonyms";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:2;a:5:{s:4:"data";s:5:"orcid";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:3;a:5:{s:4:"data";s:10:"statistics";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:4;a:5:{s:4:"data";s:8:"synonyms";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:41:"https://portal.dagstuhl.de/dblpblog/?p=30";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:308:"Since more than a year now, dblp has intensified its efforts to link dblp bibliographies to ORCIDs used by that author. ORCID information are now added regularly to the dblp data set. The primary sources for ORCIDs are: first, the annual ORCID open data dump and, second, metadata directly provided […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:13:"Florian Reitz";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:2257:"<p>Since more than a year now, dblp has intensified its efforts to link dblp bibliographies to ORCIDs used by that author. ORCID information are now added regularly to the dblp data set. The primary sources for ORCIDs are: first, the annual ORCID open data dump and, second, metadata directly provided by publishers who have started to increasingly label author signatures with ORCID information. Neither of those data sources are free of errors and data hick-ups, so we are still manually cleaning the ORCID data prior to adding them to the corpus. But overall, ORCIDs have helped us to correct numerous cases of homonymous and synonymous bibliographies in dblp, so it is absolutely worth our time.</p> <p>Since the past big ORCID update from last week (as of July 11, 2018), you can now find in dblp:</p> <ul> <li>806,744 ORCID author signatures (i.e., author-publication pairs), that is 6.5% of all author signatures in the dataset</li> <li>165,752 bibliographies that are linked to ORCIDs (either manually or implicit)</li> <li>24,357 bibliographies with ORCIDs manually verified by the dblp team</li> </ul> <p>If you look at computer science publications in dblp that have been published in the recent years, you will find that the fraction of author signatures with ORCID in dblp has climbed to now about 10.9% off all signatures in 2018. Of course, year 2018 is not done yet, and we are continuously working on improving the coverage further among all publications, regardless of the year of publication. The number of signatures and coverage for publication in recent years is:</p> <ul> <li>2014: 892,240 signatures (8.2% coverage)</li> <li>2015: 930,746 signatures (7.7% coverage)</li> <li>2016: 984,559 signatures (6.7% coverage)</li> <li>2017: 1,042,103 signatures (5.6% coverage)</li> <li>2018: 439,350 signatures (10.9% coverage)</li> </ul> <p>The oldest publication with an ORCID is from 1961. Because of the small number of publications in dblp from that time, the ORCID coverage for 1961 is a remarkable 0.12%</p> <div class="dkpdf-button-container" style=" text-align:left "> <p> <a class="dkpdf-button" href="/feed/?pdf=30" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a></p></div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:36:"http://wellformedweb.org/CommentAPI/";a:1:{s:10:"commentRss";a:1:{i:0;a:5:{s:4:"data";s:58:"https://blog.dblp.org/2018/07/13/orcid-state-of-dblp/feed/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:38:"http://purl.org/rss/1.0/modules/slash/";a:1:{s:8:"comments";a:1:{i:0;a:5:{s:4:"data";s:1:"1";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:18;a:6:{s:4:"data";s:69:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:37:"Historical dblp file is now available";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:71:"https://blog.dblp.org/2018/07/11/historical-dblp-file-is-now-available/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Wed, 11 Jul 2018 09:49:59 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:5:{i:0;a:5:{s:4:"data";s:4:"News";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:8:"curation";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:2;a:5:{s:4:"data";s:7:"dataset";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:3;a:5:{s:4:"data";s:5:"hdblp";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:4;a:5:{s:4:"data";s:9:"open data";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=154";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:314:"A historical version of the dblp.xml (called hdblp.xml) is now available at zenodo. hdblp contains historical revisions of all metadata records in dblp. The file can be used to reconstruct the state of dblp for each day between June 1999 and March 2018. The dblp computer science bibliography was founded […]";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:13:"Florian Reitz";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:1893:"<div id="main-content" class="wiki-content"> <div class="wiki-content"> <p><span>A historical version of the dblp.xml </span><span>(called hdblp.xml) is now </span><a href="https://zenodo.org/record/1213051" class="external-link" rel="nofollow">available at zenodo</a><span>. hdblp contains historical revisions of all metadata records in dblp. The file can be used to reconstruct the state of dblp for each day between June 1999 and March 2018.</span></p> </div> <p>The dblp computer science bibliography was founded in 1993. Since then, dblp has gathered (as of March 2018) data on more than 4 million publications written by about 2 million different authors. For each publication and each author, the collection maintains a simple metadata record which contains all descriptive information. The set of all records is available as daily snapshot as well as <a href="https://dblp.org/xml/release/">stable monthly releases</a>. The records are modified frequently to add additional information or to correct defects. In this document, we describe the hdblp collection which contains the historical content of each metadata record. For every time that a record is modified, hdblp contains a revision of the record’s content. Within certain limits, hdblp can be used to reconstruct the state of dblp for each day between July 1999 and March 2018. This data can be used to study the development of the collection over a period of almost 19 years. Like the dblp snapshots themselves, hdblp is published under the open ODC-BY 1.0 license.</p> <p><a href="https://zenodo.org/record/1213051">Please see zenodo</a> for a short documentation of the hdblp.xml.</p> </div> <div class="dkpdf-button-container" style=" text-align:left "> <p> <a class="dkpdf-button" href="/feed/?pdf=154" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a></p></div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:19;a:6:{s:4:"data";s:63:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:14:"dblp via HTTPS";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:48:"https://blog.dblp.org/2018/02/27/dblp-via-https/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Tue, 27 Feb 2018 11:02:52 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:3:{i:0;a:5:{s:4:"data";s:4:"News";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:5:"https";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:2;a:5:{s:4:"data";s:7:"website";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=157";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:172:"Finally, all dblp servers now support HTTPS. We will gradually move towards exclusively using HTTPS in the future, so please feel free to update your bookmarks. read as PDF";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:19:"Marcel R. Ackermann";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:482:"<div id="main-content" class="wiki-content"> <div class="wiki-content"> <p>Finally, all dblp servers now support HTTPS. We will gradually move towards exclusively using HTTPS in the future, so please feel free to update your bookmarks.</p> </div> </div> <div class="dkpdf-button-container" style=" text-align:left "> <p> <a class="dkpdf-button" href="/feed/?pdf=157" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a></p></div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}i:20;a:6:{s:4:"data";s:60:" ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";s:5:"child";a:3:{s:0:"";a:6:{s:5:"title";a:1:{i:0;a:5:{s:4:"data";s:22:"4 million publications";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:56:"https://blog.dblp.org/2017/12/22/4-million-publications/";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:7:"pubDate";a:1:{i:0;a:5:{s:4:"data";s:31:"Fri, 22 Dec 2017 11:05:11 +0000";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:8:"category";a:2:{i:0;a:5:{s:4:"data";s:4:"News";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}i:1;a:5:{s:4:"data";s:9:"milestone";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:4:"guid";a:1:{i:0;a:5:{s:4:"data";s:28:"https://blog.dblp.org/?p=159";s:7:"attribs";a:1:{s:0:"";a:1:{s:11:"isPermaLink";s:5:"false";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:11:"description";a:1:{i:0;a:5:{s:4:"data";s:11:"read as PDF";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:32:"http://purl.org/dc/elements/1.1/";a:1:{s:7:"creator";a:1:{i:0;a:5:{s:4:"data";s:19:"Marcel R. Ackermann";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:40:"http://purl.org/rss/1.0/modules/content/";a:1:{s:7:"encoded";a:1:{i:0;a:5:{s:4:"data";s:814:"<p><img loading="lazy" src="https://blog.dblp.org/wp-content/uploads/2019/10/dblp-4M-Poster-2017-12.png" alt="" class="alignnone wp-image-160 size-full" width="888" height="4763" srcset="https://blog.dblp.org/wp-content/uploads/2019/10/dblp-4M-Poster-2017-12.png 888w, https://blog.dblp.org/wp-content/uploads/2019/10/dblp-4M-Poster-2017-12-56x300.png 56w, https://blog.dblp.org/wp-content/uploads/2019/10/dblp-4M-Poster-2017-12-768x4119.png 768w, https://blog.dblp.org/wp-content/uploads/2019/10/dblp-4M-Poster-2017-12-191x1024.png 191w" sizes="(max-width: 888px) 100vw, 888px" /></p> <div class="dkpdf-button-container" style=" text-align:left "> <p> <a class="dkpdf-button" href="/feed/?pdf=159" target="_blank"><span class="dkpdf-button-icon"><i class="fa fa-file-pdf-o"></i></span> read as PDF</a></p></div> ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}}}s:27:"http://www.w3.org/2005/Atom";a:1:{s:4:"link";a:1:{i:0;a:5:{s:4:"data";s:0:"";s:7:"attribs";a:1:{s:0:"";a:3:{s:4:"href";s:27:"https://blog.dblp.org/feed/";s:3:"rel";s:4:"self";s:4:"type";s:19:"application/rss+xml";}}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}s:44:"http://purl.org/rss/1.0/modules/syndication/";a:2:{s:12:"updatePeriod";a:1:{i:0;a:5:{s:4:"data";s:9:" hourly ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}s:15:"updateFrequency";a:1:{i:0;a:5:{s:4:"data";s:4:" 1 ";s:7:"attribs";a:0:{}s:8:"xml_base";s:0:"";s:17:"xml_base_explicit";b:0;s:8:"xml_lang";s:0:"";}}}}}}}}}}}}s:4:"type";i:128;s:7:"headers";a:9:{s:4:"date";s:29:"Wed, 27 Apr 2022 03:38:55 GMT";s:6:"server";s:22:"Apache/2.4.41 (Ubuntu)";s:13:"last-modified";s:29:"Fri, 11 Mar 2022 16:35:35 GMT";s:4:"etag";s:39:""59ce018470759ec71923cdac34481b58-gzip"";s:4:"link";s:56:"<https://blog.dblp.org/wp-json/>; rel=https://api.w.org/";s:4:"vary";s:15:"Accept-Encoding";s:16:"content-encoding";s:4:"gzip";s:14:"content-length";s:5:"33325";s:12:"content-type";s:34:"application/rss+xml; charset=UTF-8";}s:5:"build";s:14:"20170417072931";}