{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JJOICK67OR7JMNRDOJTHRJHVQF","short_pith_number":"pith:JJOICK67","schema_version":"1.0","canonical_sha256":"4a5c812bdf747e963623726678a4f581779a3c16afbd9c1b8af6202cd9740778","source":{"kind":"arxiv","id":"2007.00533","version":5},"attestation_state":"computed","paper":{"title":"Partial Recovery in the Graph Alignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","cs.SI","math.PR"],"primary_cat":"stat.ML","authors_text":"Georgina Hall, Laurent Massouli\\'e","submitted_at":"2020-07-01T14:57:53Z","abstract_excerpt":"In this paper, we consider the graph alignment problem, which is the problem of recovering, given two graphs, a one-to-one mapping between nodes that maximizes edge overlap. This problem can be viewed as a noisy version of the well-known graph isomorphism problem and appears in many applications, including social network deanonymization and cellular biology. Our focus here is on partial recovery, i.e., we look for a one-to-one mapping which is correct on a fraction of the nodes of the graph rather than on all of them, and we assume that the two input graphs to the problem are correlated Erd\\H{"},"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":"2007.00533","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-07-01T14:57:53Z","cross_cats_sorted":["cs.DS","cs.LG","cs.SI","math.PR"],"title_canon_sha256":"f17b2ae95db42e1c5ee3ffcd00da4d90627ae39c18eb36cf6158b1000510dcdf","abstract_canon_sha256":"b864dfdbe47d04b0a1bf987b511ff64af98b47c3699b0465ec33f5da9c781465"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:04.038280Z","signature_b64":"UK4DyAKGqZwxD0PMzOC6mT5+yH+92HiMRGG4qgIzSsGHtk4QikmNixjEgcACXFKDpAX0pLyz00vjY1PcanL0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a5c812bdf747e963623726678a4f581779a3c16afbd9c1b8af6202cd9740778","last_reissued_at":"2026-07-05T03:48:04.037850Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:04.037850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial Recovery in the Graph Alignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","cs.SI","math.PR"],"primary_cat":"stat.ML","authors_text":"Georgina Hall, Laurent Massouli\\'e","submitted_at":"2020-07-01T14:57:53Z","abstract_excerpt":"In this paper, we consider the graph alignment problem, which is the problem of recovering, given two graphs, a one-to-one mapping between nodes that maximizes edge overlap. This problem can be viewed as a noisy version of the well-known graph isomorphism problem and appears in many applications, including social network deanonymization and cellular biology. Our focus here is on partial recovery, i.e., we look for a one-to-one mapping which is correct on a fraction of the nodes of the graph rather than on all of them, and we assume that the two input graphs to the problem are correlated Erd\\H{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00533","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.00533/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.00533","created_at":"2026-07-05T03:48:04.037912+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.00533v5","created_at":"2026-07-05T03:48:04.037912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00533","created_at":"2026-07-05T03:48:04.037912+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJOICK67OR7J","created_at":"2026-07-05T03:48:04.037912+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJOICK67OR7JMNRD","created_at":"2026-07-05T03:48:04.037912+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJOICK67","created_at":"2026-07-05T03:48:04.037912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08538","citing_title":"High-Dimensional Procrustes Matching via Tree Counts","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJOICK67OR7JMNRDOJTHRJHVQF","json":"https://pith.science/pith/JJOICK67OR7JMNRDOJTHRJHVQF.json","graph_json":"https://pith.science/api/pith-number/JJOICK67OR7JMNRDOJTHRJHVQF/graph.json","events_json":"https://pith.science/api/pith-number/JJOICK67OR7JMNRDOJTHRJHVQF/events.json","paper":"https://pith.science/paper/JJOICK67"},"agent_actions":{"view_html":"https://pith.science/pith/JJOICK67OR7JMNRDOJTHRJHVQF","download_json":"https://pith.science/pith/JJOICK67OR7JMNRDOJTHRJHVQF.json","view_paper":"https://pith.science/paper/JJOICK67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.00533&json=true","fetch_graph":"https://pith.science/api/pith-number/JJOICK67OR7JMNRDOJTHRJHVQF/graph.json","fetch_events":"https://pith.science/api/pith-number/JJOICK67OR7JMNRDOJTHRJHVQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJOICK67OR7JMNRDOJTHRJHVQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJOICK67OR7JMNRDOJTHRJHVQF/action/storage_attestation","attest_author":"https://pith.science/pith/JJOICK67OR7JMNRDOJTHRJHVQF/action/author_attestation","sign_citation":"https://pith.science/pith/JJOICK67OR7JMNRDOJTHRJHVQF/action/citation_signature","submit_replication":"https://pith.science/pith/JJOICK67OR7JMNRDOJTHRJHVQF/action/replication_record"}},"created_at":"2026-07-05T03:48:04.037912+00:00","updated_at":"2026-07-05T03:48:04.037912+00:00"}