{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IHALNHMUJWHEEE5KBWPRXCV6JA","short_pith_number":"pith:IHALNHMU","schema_version":"1.0","canonical_sha256":"41c0b69d944d8e4213aa0d9f1b8abe482683cf89ba5be6af4047f3bf7ae7ad14","source":{"kind":"arxiv","id":"1809.03553","version":2},"attestation_state":"computed","paper":{"title":"Partial Recovery of Erd\\H{o}s-R\\'enyi Graph Alignment via $k$-Core Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Cullina, H. Vincent Poor, Negar Kiyavash, Prateek Mittal","submitted_at":"2018-09-10T19:12:23Z","abstract_excerpt":"We determine information theoretic conditions under which it is possible to partially recover the alignment used to generate a pair of sparse, correlated Erd\\H{o}s-R\\'enyi graphs. To prove our achievability result, we introduce the $k$-core alignment estimator. This estimator searches for an alignment in which the intersection of the correlated graphs using this alignment has a minimum degree of $k$. We prove a matching converse bound. As the number of vertices grows, recovery of the alignment for a fraction of the vertices tending to one is possible when the average degree of the intersection"},"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":"1809.03553","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-10T19:12:23Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"b49b177406fd8395d35bd6984fe068251c50f239f571ce41e1c7a178009dfe53","abstract_canon_sha256":"70b7ec30b636212943553eb42cd296279429186c49060f1366db9b5a7b63e1a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:37.759209Z","signature_b64":"/m1dnjmcjRbu1jMHsOdS+PT2gt3CfpwTBc3+rlcjDhN2fgKH2dg8nD0OcxvSNB93+t+iQGkBlfT+pKAiF4x5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41c0b69d944d8e4213aa0d9f1b8abe482683cf89ba5be6af4047f3bf7ae7ad14","last_reissued_at":"2026-05-18T00:01:37.758664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:37.758664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial Recovery of Erd\\H{o}s-R\\'enyi Graph Alignment via $k$-Core Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Cullina, H. Vincent Poor, Negar Kiyavash, Prateek Mittal","submitted_at":"2018-09-10T19:12:23Z","abstract_excerpt":"We determine information theoretic conditions under which it is possible to partially recover the alignment used to generate a pair of sparse, correlated Erd\\H{o}s-R\\'enyi graphs. To prove our achievability result, we introduce the $k$-core alignment estimator. This estimator searches for an alignment in which the intersection of the correlated graphs using this alignment has a minimum degree of $k$. We prove a matching converse bound. As the number of vertices grows, recovery of the alignment for a fraction of the vertices tending to one is possible when the average degree of the intersection"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03553","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":"1809.03553","created_at":"2026-05-18T00:01:37.758746+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.03553v2","created_at":"2026-05-18T00:01:37.758746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03553","created_at":"2026-05-18T00:01:37.758746+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHALNHMUJWHE","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHALNHMUJWHEEE5K","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHALNHMU","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08880","citing_title":"Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IHALNHMUJWHEEE5KBWPRXCV6JA","json":"https://pith.science/pith/IHALNHMUJWHEEE5KBWPRXCV6JA.json","graph_json":"https://pith.science/api/pith-number/IHALNHMUJWHEEE5KBWPRXCV6JA/graph.json","events_json":"https://pith.science/api/pith-number/IHALNHMUJWHEEE5KBWPRXCV6JA/events.json","paper":"https://pith.science/paper/IHALNHMU"},"agent_actions":{"view_html":"https://pith.science/pith/IHALNHMUJWHEEE5KBWPRXCV6JA","download_json":"https://pith.science/pith/IHALNHMUJWHEEE5KBWPRXCV6JA.json","view_paper":"https://pith.science/paper/IHALNHMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.03553&json=true","fetch_graph":"https://pith.science/api/pith-number/IHALNHMUJWHEEE5KBWPRXCV6JA/graph.json","fetch_events":"https://pith.science/api/pith-number/IHALNHMUJWHEEE5KBWPRXCV6JA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHALNHMUJWHEEE5KBWPRXCV6JA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHALNHMUJWHEEE5KBWPRXCV6JA/action/storage_attestation","attest_author":"https://pith.science/pith/IHALNHMUJWHEEE5KBWPRXCV6JA/action/author_attestation","sign_citation":"https://pith.science/pith/IHALNHMUJWHEEE5KBWPRXCV6JA/action/citation_signature","submit_replication":"https://pith.science/pith/IHALNHMUJWHEEE5KBWPRXCV6JA/action/replication_record"}},"created_at":"2026-05-18T00:01:37.758746+00:00","updated_at":"2026-05-18T00:01:37.758746+00:00"}