{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:2ZEK44KU67BP3IIZSZBOZL6O4P","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":"16dbdd9130897ceecb57e94393ae8a3e3d32bfa9efddcea60fc04209df832abe","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-02-04T12:36:21Z","title_canon_sha256":"e3ee4bcda3e655f45f9ae97f6d129ff405b58bd132b6f878fcb4a57ad7a63407"},"schema_version":"1.0","source":{"id":"2002.01258","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.01258","created_at":"2026-07-05T01:47:42Z"},{"alias_kind":"arxiv_version","alias_value":"2002.01258v2","created_at":"2026-07-05T01:47:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.01258","created_at":"2026-07-05T01:47:42Z"},{"alias_kind":"pith_short_12","alias_value":"2ZEK44KU67BP","created_at":"2026-07-05T01:47:42Z"},{"alias_kind":"pith_short_16","alias_value":"2ZEK44KU67BP3IIZ","created_at":"2026-07-05T01:47:42Z"},{"alias_kind":"pith_short_8","alias_value":"2ZEK44KU","created_at":"2026-07-05T01:47:42Z"}],"graph_snapshots":[{"event_id":"sha256:f69bf2847a4b00626c8c3c41b983068cfb38d685c6a109d52f851e80b70b27c8","target":"graph","created_at":"2026-07-05T01:47:42Z","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/2002.01258/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we consider alignment of sparse graphs, for which we introduce the Neighborhood Tree Matching Algorithm (NTMA). For correlated Erd\\H{o}s-R\\'{e}nyi random graphs, we prove that the algorithm returns -- in polynomial time -- a positive fraction of correctly matched vertices, and a vanishing fraction of mismatches. This result holds with average degree of the graphs in $O(1)$ and correlation parameter $s$ that can be bounded away from 1, conditions under which random graph alignment is particularly challenging. As a byproduct of the analysis we introduce a matching metric between tr","authors_text":"Laurent Massouli\\'e, Luca Ganassali","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-02-04T12:36:21Z","title":"From tree matching to sparse graph alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.01258","kind":"arxiv","version":2},"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:0f2d53c3d0654a08806ab18ba9b1e2d662be896c89dd44ea5c63b321d52c935e","target":"record","created_at":"2026-07-05T01:47:42Z","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":"16dbdd9130897ceecb57e94393ae8a3e3d32bfa9efddcea60fc04209df832abe","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-02-04T12:36:21Z","title_canon_sha256":"e3ee4bcda3e655f45f9ae97f6d129ff405b58bd132b6f878fcb4a57ad7a63407"},"schema_version":"1.0","source":{"id":"2002.01258","kind":"arxiv","version":2}},"canonical_sha256":"d648ae7154f7c2fda1199642ecafcee3de6086b9a1c0626b4ab9df6a45ab43ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d648ae7154f7c2fda1199642ecafcee3de6086b9a1c0626b4ab9df6a45ab43ac","first_computed_at":"2026-07-05T01:47:42.875621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:47:42.875621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P5yHEIDTwoM3Yj6e1cuqsUK1loievho1HZwKd4ERNRs1Vd8DWYgj9GmBEoL7Mqe43TNrXZzwlxLHKnRiiZ2LAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:47:42.876065Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.01258","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f2d53c3d0654a08806ab18ba9b1e2d662be896c89dd44ea5c63b321d52c935e","sha256:f69bf2847a4b00626c8c3c41b983068cfb38d685c6a109d52f851e80b70b27c8"],"state_sha256":"43f588fa73bdead17ddcc66ea09cdf395bacdfc8470e5220ed620b43d059f827"}