{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X7NNMFXEXZQMRMEDARRTBJAEUF","short_pith_number":"pith:X7NNMFXE","schema_version":"1.0","canonical_sha256":"bfdad616e4be60c8b083046330a404a16c5635bd52106e6a8cd5916686e40519","source":{"kind":"arxiv","id":"1901.08977","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.08977","created_at":"2026-05-17T23:55:31.040708+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.08977v1","created_at":"2026-05-17T23:55:31.040708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08977","created_at":"2026-05-17T23:55:31.040708+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7NNMFXEXZQM","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7NNMFXEXZQMRMED","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7NNMFXE","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X7NNMFXEXZQMRMEDARRTBJAEUF","json":"https://pith.science/pith/X7NNMFXEXZQMRMEDARRTBJAEUF.json","graph_json":"https://pith.science/api/pith-number/X7NNMFXEXZQMRMEDARRTBJAEUF/graph.json","events_json":"https://pith.science/api/pith-number/X7NNMFXEXZQMRMEDARRTBJAEUF/events.json","paper":"https://pith.science/paper/X7NNMFXE"},"agent_actions":{"view_html":"https://pith.science/pith/X7NNMFXEXZQMRMEDARRTBJAEUF","download_json":"https://pith.science/pith/X7NNMFXEXZQMRMEDARRTBJAEUF.json","view_paper":"https://pith.science/paper/X7NNMFXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.08977&json=true","fetch_graph":"https://pith.science/api/pith-number/X7NNMFXEXZQMRMEDARRTBJAEUF/graph.json","fetch_events":"https://pith.science/api/pith-number/X7NNMFXEXZQMRMEDARRTBJAEUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7NNMFXEXZQMRMEDARRTBJAEUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7NNMFXEXZQMRMEDARRTBJAEUF/action/storage_attestation","attest_author":"https://pith.science/pith/X7NNMFXEXZQMRMEDARRTBJAEUF/action/author_attestation","sign_citation":"https://pith.science/pith/X7NNMFXEXZQMRMEDARRTBJAEUF/action/citation_signature","submit_replication":"https://pith.science/pith/X7NNMFXEXZQMRMEDARRTBJAEUF/action/replication_record"}},"created_at":"2026-05-17T23:55:31.040708+00:00","updated_at":"2026-05-17T23:55:31.040708+00:00"}