{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HZ4TZZTC6D5WVWCDQBBRQJXMZH","short_pith_number":"pith:HZ4TZZTC","canonical_record":{"source":{"id":"1602.01042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-02T18:54:04Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"00ebf902455c28b5282891a19eea3049f5101ced9a3704f2b44c7b7e3ae72f6f","abstract_canon_sha256":"fdb5a711bfbba48c860a0b42ea324f6c014c82b1cf93c3c3e6946087f1365bb8"},"schema_version":"1.0"},"canonical_sha256":"3e793ce662f0fb6ad84380431826ecc9e8bc3ebe1f801fcda8f8c83b829652a0","source":{"kind":"arxiv","id":"1602.01042","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01042","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01042v1","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01042","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"HZ4TZZTC6D5W","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HZ4TZZTC6D5WVWCD","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HZ4TZZTC","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HZ4TZZTC6D5WVWCDQBBRQJXMZH","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-02T18:54:04Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"00ebf902455c28b5282891a19eea3049f5101ced9a3704f2b44c7b7e3ae72f6f","abstract_canon_sha256":"fdb5a711bfbba48c860a0b42ea324f6c014c82b1cf93c3c3e6946087f1365bb8"},"schema_version":"1.0"},"canonical_sha256":"3e793ce662f0fb6ad84380431826ecc9e8bc3ebe1f801fcda8f8c83b829652a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:23.909887Z","signature_b64":"+tqA7XPbglOY1ti3KpTiBKzDoM6gMUJ9OayyM02gmvIl5tEwawe/xWjHwVrl9fVfrnajFUQTVwM7roEXfMJfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e793ce662f0fb6ad84380431826ecc9e8bc3ebe1f801fcda8f8c83b829652a0","last_reissued_at":"2026-05-18T01:21:23.909114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:23.909114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01042","source_version":1,"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-18T01:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kGzV+6MAfcY6VYVDyM0d1tH0tDYIUnESEFhDabGbRIBQnIESbdGDNCNVlRqf/iQuJWandAMDWtWv3ZJh3NpGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:28:17.759623Z"},"content_sha256":"9554e983007d76f3c6bb9f5e070d62a0a93cd11a9fdd5c72075a283ae034713d","schema_version":"1.0","event_id":"sha256:9554e983007d76f3c6bb9f5e070d62a0a93cd11a9fdd5c72075a283ae034713d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HZ4TZZTC6D5WVWCDQBBRQJXMZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Achievability and Converse Bounds for Erd\\H{o}s-R\\'enyi Graph Matching","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":"2016-02-02T18:54:04Z","abstract_excerpt":"We consider the problem of perfectly recovering the vertex correspondence between two correlated Erd\\H{o}s-R\\'enyi (ER) graphs. For a pair of correlated 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. In some cases, the structural information in the graphs allow this correspondence to be recovered. We investigate the information-theoretic threshold for exact recovery, i.e. the conditions under which the entire vertex correspondence can be correctly recovered given unbounded computational resour"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01042","kind":"arxiv","version":1},"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-18T01:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G1320mDWAoX5fA/is1tToTlh9Jk7lnhl92bcF2lpOn//qdIyuoq9UpRAoS29ebZr53w+oXSecNhHHdryVlHDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:28:17.760383Z"},"content_sha256":"ca9d74a51efb17a60329053f7690f626d6b1a1a30d4063f1aff39ab2af9a0821","schema_version":"1.0","event_id":"sha256:ca9d74a51efb17a60329053f7690f626d6b1a1a30d4063f1aff39ab2af9a0821"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZ4TZZTC6D5WVWCDQBBRQJXMZH/bundle.json","state_url":"https://pith.science/pith/HZ4TZZTC6D5WVWCDQBBRQJXMZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZ4TZZTC6D5WVWCDQBBRQJXMZH/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-31T20:28:17Z","links":{"resolver":"https://pith.science/pith/HZ4TZZTC6D5WVWCDQBBRQJXMZH","bundle":"https://pith.science/pith/HZ4TZZTC6D5WVWCDQBBRQJXMZH/bundle.json","state":"https://pith.science/pith/HZ4TZZTC6D5WVWCDQBBRQJXMZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZ4TZZTC6D5WVWCDQBBRQJXMZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HZ4TZZTC6D5WVWCDQBBRQJXMZH","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":"fdb5a711bfbba48c860a0b42ea324f6c014c82b1cf93c3c3e6946087f1365bb8","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-02T18:54:04Z","title_canon_sha256":"00ebf902455c28b5282891a19eea3049f5101ced9a3704f2b44c7b7e3ae72f6f"},"schema_version":"1.0","source":{"id":"1602.01042","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01042","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01042v1","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01042","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"HZ4TZZTC6D5W","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HZ4TZZTC6D5WVWCD","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HZ4TZZTC","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:ca9d74a51efb17a60329053f7690f626d6b1a1a30d4063f1aff39ab2af9a0821","target":"graph","created_at":"2026-05-18T01:21:23Z","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 consider the problem of perfectly recovering the vertex correspondence between two correlated Erd\\H{o}s-R\\'enyi (ER) graphs. For a pair of correlated 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. In some cases, the structural information in the graphs allow this correspondence to be recovered. We investigate the information-theoretic threshold for exact recovery, i.e. the conditions under which the entire vertex correspondence can be correctly recovered given unbounded computational resour","authors_text":"Daniel Cullina, Negar Kiyavash","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-02T18:54:04Z","title":"Improved Achievability and Converse Bounds for Erd\\H{o}s-R\\'enyi Graph Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01042","kind":"arxiv","version":1},"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:9554e983007d76f3c6bb9f5e070d62a0a93cd11a9fdd5c72075a283ae034713d","target":"record","created_at":"2026-05-18T01:21:23Z","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":"fdb5a711bfbba48c860a0b42ea324f6c014c82b1cf93c3c3e6946087f1365bb8","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-02T18:54:04Z","title_canon_sha256":"00ebf902455c28b5282891a19eea3049f5101ced9a3704f2b44c7b7e3ae72f6f"},"schema_version":"1.0","source":{"id":"1602.01042","kind":"arxiv","version":1}},"canonical_sha256":"3e793ce662f0fb6ad84380431826ecc9e8bc3ebe1f801fcda8f8c83b829652a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e793ce662f0fb6ad84380431826ecc9e8bc3ebe1f801fcda8f8c83b829652a0","first_computed_at":"2026-05-18T01:21:23.909114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:23.909114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+tqA7XPbglOY1ti3KpTiBKzDoM6gMUJ9OayyM02gmvIl5tEwawe/xWjHwVrl9fVfrnajFUQTVwM7roEXfMJfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:23.909887Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01042","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9554e983007d76f3c6bb9f5e070d62a0a93cd11a9fdd5c72075a283ae034713d","sha256:ca9d74a51efb17a60329053f7690f626d6b1a1a30d4063f1aff39ab2af9a0821"],"state_sha256":"0aaa205bb6a7e2d4c4976bdd3bf3a2c1fd5cc39f658be72be3ec08824f82d49d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EtIyEqbSW834Sxl8nTVbukDOqI6SYQpcCMT05YimmdrJ7+eEB90aaTAmK+WM6aeLE9N9fPH30sjy1g6xm+wQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:28:17.764274Z","bundle_sha256":"993a17ba0ca56418883dc8c0e889561e323e1575eb2694413f0712f145a36a75"}}