{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:X7NNMFXEXZQMRMEDARRTBJAEUF","short_pith_number":"pith:X7NNMFXE","canonical_record":{"source":{"id":"1901.08977","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2019-01-25T16:49:53Z","cross_cats_sorted":["cs.DL","cs.SI"],"title_canon_sha256":"1a55f59b0855d916d3bc2de7d42fc6d454e6c3363987b12fbdd0abcf2803a73e","abstract_canon_sha256":"246cf3d97ffdb49ababbae4c50ddb49ba0059a60de916098938f6b8515208f71"},"schema_version":"1.0"},"canonical_sha256":"bfdad616e4be60c8b083046330a404a16c5635bd52106e6a8cd5916686e40519","source":{"kind":"arxiv","id":"1901.08977","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08977","created_at":"2026-05-17T23:55:31Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08977v1","created_at":"2026-05-17T23:55:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08977","created_at":"2026-05-17T23:55:31Z"},{"alias_kind":"pith_short_12","alias_value":"X7NNMFXEXZQM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"X7NNMFXEXZQMRMED","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"X7NNMFXE","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:X7NNMFXEXZQMRMEDARRTBJAEUF","target":"record","payload":{"canonical_record":{"source":{"id":"1901.08977","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2019-01-25T16:49:53Z","cross_cats_sorted":["cs.DL","cs.SI"],"title_canon_sha256":"1a55f59b0855d916d3bc2de7d42fc6d454e6c3363987b12fbdd0abcf2803a73e","abstract_canon_sha256":"246cf3d97ffdb49ababbae4c50ddb49ba0059a60de916098938f6b8515208f71"},"schema_version":"1.0"},"canonical_sha256":"bfdad616e4be60c8b083046330a404a16c5635bd52106e6a8cd5916686e40519","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:31.041069Z","signature_b64":"Z7MQhnGoNB4QdUGCMHD57WJIsJZkBF319j9CvnbDQCTgv0LWF2VJwbJ8RJg0PBwLdR+NS5OmDzJ2MT7kG53sBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfdad616e4be60c8b083046330a404a16c5635bd52106e6a8cd5916686e40519","last_reissued_at":"2026-05-17T23:55:31.040641Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:31.040641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.08977","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gJXoj10r0ULzo2NI8AnPACezbf5qLE70yVhnSkOw7W4KTXOpTJsrSG+ex28EH3RQgCc5twyPcO0e9Qn2a8KWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:41:57.905090Z"},"content_sha256":"f6a1f7e1d5b577fa99aaa71420f72cd0a543e1dcdaa5f74f904f28c93b85690e","schema_version":"1.0","event_id":"sha256:f6a1f7e1d5b577fa99aaa71420f72cd0a543e1dcdaa5f74f904f28c93b85690e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:X7NNMFXEXZQMRMEDARRTBJAEUF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topological and Semantic Graph-based Author Disambiguation on DBLP Data in Neo4j","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DL","cs.SI"],"primary_cat":"cs.IR","authors_text":"Alfredo Milani, Michele Lepri, Valentina Franzoni","submitted_at":"2019-01-25T16:49:53Z","abstract_excerpt":"In this work, we introduce a novel method for entity resolution author disambiguation in bibliographic networks. Such a method is based on a 2-steps network traversal using topological similarity measures for rating candidate nodes. Topological similarity is widely used in the Link Prediction application domain to assess the likelihood of an unknown link. A similarity function can be a good approximation for equality, therefore can be used to disambiguate, basing on the hypothesis that authors with many common co-authors are similar. Our method has experimented on a graph-based representation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08977","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HhgOtrA+2x+t7ruOmEpswx0Q/kMeO2m+02JbEJQWDRbMLzih11ZPquCWAos7QcU+srmE3nRtInNM/LBs+9GCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:41:57.905472Z"},"content_sha256":"94e945993b00a97aed895c3163c307615d87c9d4f87d1f2f2c8d332f9e328dbe","schema_version":"1.0","event_id":"sha256:94e945993b00a97aed895c3163c307615d87c9d4f87d1f2f2c8d332f9e328dbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X7NNMFXEXZQMRMEDARRTBJAEUF/bundle.json","state_url":"https://pith.science/pith/X7NNMFXEXZQMRMEDARRTBJAEUF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X7NNMFXEXZQMRMEDARRTBJAEUF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T20:41:57Z","links":{"resolver":"https://pith.science/pith/X7NNMFXEXZQMRMEDARRTBJAEUF","bundle":"https://pith.science/pith/X7NNMFXEXZQMRMEDARRTBJAEUF/bundle.json","state":"https://pith.science/pith/X7NNMFXEXZQMRMEDARRTBJAEUF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X7NNMFXEXZQMRMEDARRTBJAEUF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:X7NNMFXEXZQMRMEDARRTBJAEUF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"246cf3d97ffdb49ababbae4c50ddb49ba0059a60de916098938f6b8515208f71","cross_cats_sorted":["cs.DL","cs.SI"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2019-01-25T16:49:53Z","title_canon_sha256":"1a55f59b0855d916d3bc2de7d42fc6d454e6c3363987b12fbdd0abcf2803a73e"},"schema_version":"1.0","source":{"id":"1901.08977","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08977","created_at":"2026-05-17T23:55:31Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08977v1","created_at":"2026-05-17T23:55:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08977","created_at":"2026-05-17T23:55:31Z"},{"alias_kind":"pith_short_12","alias_value":"X7NNMFXEXZQM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"X7NNMFXEXZQMRMED","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"X7NNMFXE","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:94e945993b00a97aed895c3163c307615d87c9d4f87d1f2f2c8d332f9e328dbe","target":"graph","created_at":"2026-05-17T23:55:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this work, we introduce a novel method for entity resolution author disambiguation in bibliographic networks. Such a method is based on a 2-steps network traversal using topological similarity measures for rating candidate nodes. Topological similarity is widely used in the Link Prediction application domain to assess the likelihood of an unknown link. A similarity function can be a good approximation for equality, therefore can be used to disambiguate, basing on the hypothesis that authors with many common co-authors are similar. Our method has experimented on a graph-based representation ","authors_text":"Alfredo Milani, Michele Lepri, Valentina Franzoni","cross_cats":["cs.DL","cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2019-01-25T16:49:53Z","title":"Topological and Semantic Graph-based Author Disambiguation on DBLP Data in Neo4j"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08977","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f6a1f7e1d5b577fa99aaa71420f72cd0a543e1dcdaa5f74f904f28c93b85690e","target":"record","created_at":"2026-05-17T23:55:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"246cf3d97ffdb49ababbae4c50ddb49ba0059a60de916098938f6b8515208f71","cross_cats_sorted":["cs.DL","cs.SI"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2019-01-25T16:49:53Z","title_canon_sha256":"1a55f59b0855d916d3bc2de7d42fc6d454e6c3363987b12fbdd0abcf2803a73e"},"schema_version":"1.0","source":{"id":"1901.08977","kind":"arxiv","version":1}},"canonical_sha256":"bfdad616e4be60c8b083046330a404a16c5635bd52106e6a8cd5916686e40519","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfdad616e4be60c8b083046330a404a16c5635bd52106e6a8cd5916686e40519","first_computed_at":"2026-05-17T23:55:31.040641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:31.040641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z7MQhnGoNB4QdUGCMHD57WJIsJZkBF319j9CvnbDQCTgv0LWF2VJwbJ8RJg0PBwLdR+NS5OmDzJ2MT7kG53sBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:31.041069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.08977","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6a1f7e1d5b577fa99aaa71420f72cd0a543e1dcdaa5f74f904f28c93b85690e","sha256:94e945993b00a97aed895c3163c307615d87c9d4f87d1f2f2c8d332f9e328dbe"],"state_sha256":"f07b518d486f535996049175f8bd76947c72b9cd289f76de070c55fa6fa21e0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gSitwKeZPevtmLLTgYkAy29EiATd30Pi3bTUSpqYDnco4OizWL7wWl2I3p8edf1Mpl9I4Ztufoeg+aLzc23yAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T20:41:57.908006Z","bundle_sha256":"ad8cc7b19827ab25ba6dbd2bc6fe1a92b6e1e955f0189cd69a2682e2debfd820"}}