{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:637SM5FH4B7NDVRIH75PD2LEHJ","short_pith_number":"pith:637SM5FH","canonical_record":{"source":{"id":"1807.10262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-26T17:44:00Z","cross_cats_sorted":["cs.DM","cs.DS","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"ab08ad7e8f2c106bfbaae7b43dd5e1564a54c46047e2ab64637097ee01276a43","abstract_canon_sha256":"671bce36f6a56fc071840465cc708ec243140efce90ac5c592843eedef4166ef"},"schema_version":"1.0"},"canonical_sha256":"f6ff2674a7e07ed1d6283ffaf1e9643a60ce0ff1ed23c5957f503f312ac8cc4e","source":{"kind":"arxiv","id":"1807.10262","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10262","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10262v1","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10262","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"pith_short_12","alias_value":"637SM5FH4B7N","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"637SM5FH4B7NDVRI","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"637SM5FH","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:637SM5FH4B7NDVRIH75PD2LEHJ","target":"record","payload":{"canonical_record":{"source":{"id":"1807.10262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-26T17:44:00Z","cross_cats_sorted":["cs.DM","cs.DS","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"ab08ad7e8f2c106bfbaae7b43dd5e1564a54c46047e2ab64637097ee01276a43","abstract_canon_sha256":"671bce36f6a56fc071840465cc708ec243140efce90ac5c592843eedef4166ef"},"schema_version":"1.0"},"canonical_sha256":"f6ff2674a7e07ed1d6283ffaf1e9643a60ce0ff1ed23c5957f503f312ac8cc4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:42.730788Z","signature_b64":"D3yJ4hjvFQMGjxaEeZax+Wvtp7SpfN0jyBE8P1N0x8AqNH60Yy4OJXaSwTpfvj7oA81XspQd3v81a+gx6Y4dDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6ff2674a7e07ed1d6283ffaf1e9643a60ce0ff1ed23c5957f503f312ac8cc4e","last_reissued_at":"2026-05-18T00:09:42.729999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:42.729999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.10262","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-18T00:09:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tntnm1QvCxuWWGV7Il4KUrglQF4MbHkcBpOWdHzOg46E2cb7YYy1xDyyDo464zoaGWeFBcItu30FHMBMezMsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:12:54.260111Z"},"content_sha256":"af9d6a538b0ffe0ac1dadfa25b4ed40364763ced47849a1740f8f5c67d719d06","schema_version":"1.0","event_id":"sha256:af9d6a538b0ffe0ac1dadfa25b4ed40364763ced47849a1740f8f5c67d719d06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:637SM5FH4B7NDVRIH75PD2LEHJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Seeded Graph Matching via Large Neighborhood Statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Elchanan Mossel, Jiaming Xu","submitted_at":"2018-07-26T17:44:00Z","abstract_excerpt":"We study a well known noisy model of the graph isomorphism problem. In this model, the goal is to perfectly recover the vertex correspondence between two edge-correlated Erd\\H{o}s-R\\'{e}nyi random graphs, with an initial seed set of correctly matched vertex pairs revealed as side information. For seeded problems, our result provides a significant improvement over previously known results. We show that it is possible to achieve the information-theoretic limit of graph sparsity in time polynomial in the number of vertices $n$. Moreover, we show the number of seeds needed for exact recovery in po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10262","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-18T00:09:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PT/cFj0776Qq3LXd9u/kLOEqzJWC3aZnuX4N08IBU4+VH+qMbt/j1KSnsbz0Q4lXnYtnXgKr3ypQN5GBaANpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:12:54.260791Z"},"content_sha256":"14447fb69cfc9fbdddd4bbcbe66ab54d554b7ec3870663a7d5d96ae3166de55b","schema_version":"1.0","event_id":"sha256:14447fb69cfc9fbdddd4bbcbe66ab54d554b7ec3870663a7d5d96ae3166de55b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/637SM5FH4B7NDVRIH75PD2LEHJ/bundle.json","state_url":"https://pith.science/pith/637SM5FH4B7NDVRIH75PD2LEHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/637SM5FH4B7NDVRIH75PD2LEHJ/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-31T07:12:54Z","links":{"resolver":"https://pith.science/pith/637SM5FH4B7NDVRIH75PD2LEHJ","bundle":"https://pith.science/pith/637SM5FH4B7NDVRIH75PD2LEHJ/bundle.json","state":"https://pith.science/pith/637SM5FH4B7NDVRIH75PD2LEHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/637SM5FH4B7NDVRIH75PD2LEHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:637SM5FH4B7NDVRIH75PD2LEHJ","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":"671bce36f6a56fc071840465cc708ec243140efce90ac5c592843eedef4166ef","cross_cats_sorted":["cs.DM","cs.DS","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-26T17:44:00Z","title_canon_sha256":"ab08ad7e8f2c106bfbaae7b43dd5e1564a54c46047e2ab64637097ee01276a43"},"schema_version":"1.0","source":{"id":"1807.10262","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10262","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10262v1","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10262","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"pith_short_12","alias_value":"637SM5FH4B7N","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"637SM5FH4B7NDVRI","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"637SM5FH","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:14447fb69cfc9fbdddd4bbcbe66ab54d554b7ec3870663a7d5d96ae3166de55b","target":"graph","created_at":"2026-05-18T00:09: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"},"paper":{"abstract_excerpt":"We study a well known noisy model of the graph isomorphism problem. In this model, the goal is to perfectly recover the vertex correspondence between two edge-correlated Erd\\H{o}s-R\\'{e}nyi random graphs, with an initial seed set of correctly matched vertex pairs revealed as side information. For seeded problems, our result provides a significant improvement over previously known results. We show that it is possible to achieve the information-theoretic limit of graph sparsity in time polynomial in the number of vertices $n$. Moreover, we show the number of seeds needed for exact recovery in po","authors_text":"Elchanan Mossel, Jiaming Xu","cross_cats":["cs.DM","cs.DS","cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-26T17:44:00Z","title":"Seeded Graph Matching via Large Neighborhood Statistics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10262","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:af9d6a538b0ffe0ac1dadfa25b4ed40364763ced47849a1740f8f5c67d719d06","target":"record","created_at":"2026-05-18T00:09: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":"671bce36f6a56fc071840465cc708ec243140efce90ac5c592843eedef4166ef","cross_cats_sorted":["cs.DM","cs.DS","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-26T17:44:00Z","title_canon_sha256":"ab08ad7e8f2c106bfbaae7b43dd5e1564a54c46047e2ab64637097ee01276a43"},"schema_version":"1.0","source":{"id":"1807.10262","kind":"arxiv","version":1}},"canonical_sha256":"f6ff2674a7e07ed1d6283ffaf1e9643a60ce0ff1ed23c5957f503f312ac8cc4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6ff2674a7e07ed1d6283ffaf1e9643a60ce0ff1ed23c5957f503f312ac8cc4e","first_computed_at":"2026-05-18T00:09:42.729999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:42.729999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D3yJ4hjvFQMGjxaEeZax+Wvtp7SpfN0jyBE8P1N0x8AqNH60Yy4OJXaSwTpfvj7oA81XspQd3v81a+gx6Y4dDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:42.730788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.10262","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af9d6a538b0ffe0ac1dadfa25b4ed40364763ced47849a1740f8f5c67d719d06","sha256:14447fb69cfc9fbdddd4bbcbe66ab54d554b7ec3870663a7d5d96ae3166de55b"],"state_sha256":"cc9e97d02fbf99eb601aea5504402a6723cf8f83f9880f4b3bff05209dc7f472"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xUer5b+5LC7arHeMggt6rzrzCdbUykgJhWq012kq09n1QKgO+LLR67xWkrAujRaRP31PsPQESfSTqEy7E644Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:12:54.265696Z","bundle_sha256":"5d825d99a88f46547196c81bc7c250c3a8ea17c8c6b50f156df4aeb08b6cf7b0"}}