{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LHCNMOOXYOZKLJK6J2UPRKA2PQ","short_pith_number":"pith:LHCNMOOX","schema_version":"1.0","canonical_sha256":"59c4d639d7c3b2a5a55e4ea8f8a81a7c2772af7a9b4dec8c90db2543fe8b7d43","source":{"kind":"arxiv","id":"1711.06783","version":2},"attestation_state":"computed","paper":{"title":"Exact alignment recovery for correlated Erd\\H{o}s-R\\'enyi graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Cullina, Negar Kiyavash","submitted_at":"2017-11-18T00:57:18Z","abstract_excerpt":"We consider the problem of perfectly recovering the vertex correspondence between two correlated Erd\\H{o}s-R\\'enyi (ER) graphs on the same vertex set. The correspondence between the vertices can be obscured by randomly permuting the vertex labels of one of the graphs. We determine the information-theoretic threshold for exact recovery, i.e. the conditions under which the entire vertex correspondence can be correctly recovered given unbounded computational resources."},"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":"1711.06783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-18T00:57:18Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"b532cddf557c6eede38b82bc379267c2b27bdf1ef98dd36e60870f1043dccdd7","abstract_canon_sha256":"fc8c91d107913ad5cc796cbc726268def855c040f556a861997b2fc6eeba1886"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:08.324343Z","signature_b64":"lX1PoBwCWT3ObA2/43uVRrC9Pxrvh56qNv99g7ECzjpGfeMP5ATBZGdhf/nOvsi3TNFXPvjmxHphdi3pbharCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59c4d639d7c3b2a5a55e4ea8f8a81a7c2772af7a9b4dec8c90db2543fe8b7d43","last_reissued_at":"2026-05-18T00:16:08.323788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:08.323788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact alignment recovery for correlated Erd\\H{o}s-R\\'enyi graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Cullina, Negar Kiyavash","submitted_at":"2017-11-18T00:57:18Z","abstract_excerpt":"We consider the problem of perfectly recovering the vertex correspondence between two correlated Erd\\H{o}s-R\\'enyi (ER) graphs on the same vertex set. The correspondence between the vertices can be obscured by randomly permuting the vertex labels of one of the graphs. We determine the information-theoretic threshold for exact recovery, i.e. the conditions under which the entire vertex correspondence can be correctly recovered given unbounded computational resources."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06783","kind":"arxiv","version":2},"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":"1711.06783","created_at":"2026-05-18T00:16:08.323855+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.06783v2","created_at":"2026-05-18T00:16:08.323855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06783","created_at":"2026-05-18T00:16:08.323855+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHCNMOOXYOZK","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHCNMOOXYOZKLJK6","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHCNMOOX","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2502.17142","citing_title":"The feasibility of multi-graph alignment: a Bayesian approach","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"1907.08880","citing_title":"Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2402.15095","citing_title":"The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2502.17142","citing_title":"The feasibility of multi-graph alignment: a Bayesian approach","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2604.04365","citing_title":"Attributed Network Alignment: Statistical Limits and Efficient Algorithm","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LHCNMOOXYOZKLJK6J2UPRKA2PQ","json":"https://pith.science/pith/LHCNMOOXYOZKLJK6J2UPRKA2PQ.json","graph_json":"https://pith.science/api/pith-number/LHCNMOOXYOZKLJK6J2UPRKA2PQ/graph.json","events_json":"https://pith.science/api/pith-number/LHCNMOOXYOZKLJK6J2UPRKA2PQ/events.json","paper":"https://pith.science/paper/LHCNMOOX"},"agent_actions":{"view_html":"https://pith.science/pith/LHCNMOOXYOZKLJK6J2UPRKA2PQ","download_json":"https://pith.science/pith/LHCNMOOXYOZKLJK6J2UPRKA2PQ.json","view_paper":"https://pith.science/paper/LHCNMOOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.06783&json=true","fetch_graph":"https://pith.science/api/pith-number/LHCNMOOXYOZKLJK6J2UPRKA2PQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LHCNMOOXYOZKLJK6J2UPRKA2PQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHCNMOOXYOZKLJK6J2UPRKA2PQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHCNMOOXYOZKLJK6J2UPRKA2PQ/action/storage_attestation","attest_author":"https://pith.science/pith/LHCNMOOXYOZKLJK6J2UPRKA2PQ/action/author_attestation","sign_citation":"https://pith.science/pith/LHCNMOOXYOZKLJK6J2UPRKA2PQ/action/citation_signature","submit_replication":"https://pith.science/pith/LHCNMOOXYOZKLJK6J2UPRKA2PQ/action/replication_record"}},"created_at":"2026-05-18T00:16:08.323855+00:00","updated_at":"2026-05-18T00:16:08.323855+00:00"}