{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IHALNHMUJWHEEE5KBWPRXCV6JA","short_pith_number":"pith:IHALNHMU","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"},"canonical_sha256":"41c0b69d944d8e4213aa0d9f1b8abe482683cf89ba5be6af4047f3bf7ae7ad14","source":{"kind":"arxiv","id":"1809.03553","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03553","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03553v2","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03553","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"IHALNHMUJWHE","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IHALNHMUJWHEEE5K","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IHALNHMU","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IHALNHMUJWHEEE5KBWPRXCV6JA","target":"record","payload":{"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"},"canonical_sha256":"41c0b69d944d8e4213aa0d9f1b8abe482683cf89ba5be6af4047f3bf7ae7ad14","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"},"source_kind":"arxiv","source_id":"1809.03553","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U7Dg42BQAHi5iPpze8f0pm2lFH1SZ8w/wRJyIE740463BvDd+li5x+jjw579eIgNFXBWBOaoiKCaqGBM/Zg3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:58:14.513338Z"},"content_sha256":"d7eceb4ddb29c768989c775842a57034906815b2a2ec1fe11abb8b4bc945a040","schema_version":"1.0","event_id":"sha256:d7eceb4ddb29c768989c775842a57034906815b2a2ec1fe11abb8b4bc945a040"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IHALNHMUJWHEEE5KBWPRXCV6JA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Q7gkQRJQ83arbm3/IWl1/9+svjE5RGHrjSs7tGkUAq2ouolzSUGFBVpu6zE5wCWx8mPgexiMcR7BydIC9AnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:58:14.514052Z"},"content_sha256":"11b21384e2cfc60fbdcbdc70c29ffc257811da96ebca32b94d23499bebae06f7","schema_version":"1.0","event_id":"sha256:11b21384e2cfc60fbdcbdc70c29ffc257811da96ebca32b94d23499bebae06f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHALNHMUJWHEEE5KBWPRXCV6JA/bundle.json","state_url":"https://pith.science/pith/IHALNHMUJWHEEE5KBWPRXCV6JA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHALNHMUJWHEEE5KBWPRXCV6JA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T12:58:14Z","links":{"resolver":"https://pith.science/pith/IHALNHMUJWHEEE5KBWPRXCV6JA","bundle":"https://pith.science/pith/IHALNHMUJWHEEE5KBWPRXCV6JA/bundle.json","state":"https://pith.science/pith/IHALNHMUJWHEEE5KBWPRXCV6JA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHALNHMUJWHEEE5KBWPRXCV6JA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IHALNHMUJWHEEE5KBWPRXCV6JA","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":"70b7ec30b636212943553eb42cd296279429186c49060f1366db9b5a7b63e1a3","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-10T19:12:23Z","title_canon_sha256":"b49b177406fd8395d35bd6984fe068251c50f239f571ce41e1c7a178009dfe53"},"schema_version":"1.0","source":{"id":"1809.03553","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03553","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03553v2","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03553","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"IHALNHMUJWHE","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IHALNHMUJWHEEE5K","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IHALNHMU","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:11b21384e2cfc60fbdcbdc70c29ffc257811da96ebca32b94d23499bebae06f7","target":"graph","created_at":"2026-05-18T00:01:37Z","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"},"paper":{"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","authors_text":"Daniel Cullina, H. Vincent Poor, Negar Kiyavash, Prateek Mittal","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-10T19:12:23Z","title":"Partial Recovery of Erd\\H{o}s-R\\'enyi Graph Alignment via $k$-Core Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03553","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:d7eceb4ddb29c768989c775842a57034906815b2a2ec1fe11abb8b4bc945a040","target":"record","created_at":"2026-05-18T00:01:37Z","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":"70b7ec30b636212943553eb42cd296279429186c49060f1366db9b5a7b63e1a3","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-10T19:12:23Z","title_canon_sha256":"b49b177406fd8395d35bd6984fe068251c50f239f571ce41e1c7a178009dfe53"},"schema_version":"1.0","source":{"id":"1809.03553","kind":"arxiv","version":2}},"canonical_sha256":"41c0b69d944d8e4213aa0d9f1b8abe482683cf89ba5be6af4047f3bf7ae7ad14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41c0b69d944d8e4213aa0d9f1b8abe482683cf89ba5be6af4047f3bf7ae7ad14","first_computed_at":"2026-05-18T00:01:37.758664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:37.758664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/m1dnjmcjRbu1jMHsOdS+PT2gt3CfpwTBc3+rlcjDhN2fgKH2dg8nD0OcxvSNB93+t+iQGkBlfT+pKAiF4x5DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:37.759209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03553","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7eceb4ddb29c768989c775842a57034906815b2a2ec1fe11abb8b4bc945a040","sha256:11b21384e2cfc60fbdcbdc70c29ffc257811da96ebca32b94d23499bebae06f7"],"state_sha256":"c32f133b7fc81bddc69146285df0def64ce4166056ab0e5e43a150496ed4e3dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SN50RN00yDtyBETw7U6VdONagE9dlK4n3nzW5whtZXzj0Xo11vC8nZiZkBBogTA4Jndj1AtDUqZBIYrt6608DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:58:14.518198Z","bundle_sha256":"46fde406f63dd29c930228dab0d6b76ff928dcc7daffec973925dad28694d809"}}