{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:JJOICK67OR7JMNRDOJTHRJHVQF","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":"b864dfdbe47d04b0a1bf987b511ff64af98b47c3699b0465ec33f5da9c781465","cross_cats_sorted":["cs.DS","cs.LG","cs.SI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-07-01T14:57:53Z","title_canon_sha256":"f17b2ae95db42e1c5ee3ffcd00da4d90627ae39c18eb36cf6158b1000510dcdf"},"schema_version":"1.0","source":{"id":"2007.00533","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.00533","created_at":"2026-07-05T03:48:04Z"},{"alias_kind":"arxiv_version","alias_value":"2007.00533v5","created_at":"2026-07-05T03:48:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00533","created_at":"2026-07-05T03:48:04Z"},{"alias_kind":"pith_short_12","alias_value":"JJOICK67OR7J","created_at":"2026-07-05T03:48:04Z"},{"alias_kind":"pith_short_16","alias_value":"JJOICK67OR7JMNRD","created_at":"2026-07-05T03:48:04Z"},{"alias_kind":"pith_short_8","alias_value":"JJOICK67","created_at":"2026-07-05T03:48:04Z"}],"graph_snapshots":[{"event_id":"sha256:e86c33050f7d6d2d63a49f798ea2ef69ec0e3afa4b250347bde4c3c102280bcc","target":"graph","created_at":"2026-07-05T03:48:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.00533/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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{","authors_text":"Georgina Hall, Laurent Massouli\\'e","cross_cats":["cs.DS","cs.LG","cs.SI","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-07-01T14:57:53Z","title":"Partial Recovery in the Graph Alignment Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00533","kind":"arxiv","version":5},"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:986d50f16eb0ef8fb4a4dcdab60cd2039d09876e5d2a1738b0db0d4c392c7a07","target":"record","created_at":"2026-07-05T03:48:04Z","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":"b864dfdbe47d04b0a1bf987b511ff64af98b47c3699b0465ec33f5da9c781465","cross_cats_sorted":["cs.DS","cs.LG","cs.SI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-07-01T14:57:53Z","title_canon_sha256":"f17b2ae95db42e1c5ee3ffcd00da4d90627ae39c18eb36cf6158b1000510dcdf"},"schema_version":"1.0","source":{"id":"2007.00533","kind":"arxiv","version":5}},"canonical_sha256":"4a5c812bdf747e963623726678a4f581779a3c16afbd9c1b8af6202cd9740778","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a5c812bdf747e963623726678a4f581779a3c16afbd9c1b8af6202cd9740778","first_computed_at":"2026-07-05T03:48:04.037850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:48:04.037850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UK4DyAKGqZwxD0PMzOC6mT5+yH+92HiMRGG4qgIzSsGHtk4QikmNixjEgcACXFKDpAX0pLyz00vjY1PcanL0Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:48:04.038280Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.00533","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:986d50f16eb0ef8fb4a4dcdab60cd2039d09876e5d2a1738b0db0d4c392c7a07","sha256:e86c33050f7d6d2d63a49f798ea2ef69ec0e3afa4b250347bde4c3c102280bcc"],"state_sha256":"18df6de022a64c868b70200fd6c354c259ae371b1184d8e9dde47706a3062652"}