{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JMVSURT6QNQ77Z3XUDHNSE43DK","short_pith_number":"pith:JMVSURT6","canonical_record":{"source":{"id":"1805.02349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-07T05:38:41Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"b559c9dab58fb64a59bd1a0b9be7666a47898c0a92a2cbd5f9bd6555764e09c4","abstract_canon_sha256":"691710620cea2c130ec521e030d9056a7fd84c20c3a21820d9f0c83469aad369"},"schema_version":"1.0"},"canonical_sha256":"4b2b2a467e8361ffe777a0ced9139b1ab24d7100c469fbe5fde48a0598f08002","source":{"kind":"arxiv","id":"1805.02349","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02349","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02349v2","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02349","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"JMVSURT6QNQ7","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JMVSURT6QNQ77Z3X","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JMVSURT6","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JMVSURT6QNQ77Z3XUDHNSE43DK","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-07T05:38:41Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"b559c9dab58fb64a59bd1a0b9be7666a47898c0a92a2cbd5f9bd6555764e09c4","abstract_canon_sha256":"691710620cea2c130ec521e030d9056a7fd84c20c3a21820d9f0c83469aad369"},"schema_version":"1.0"},"canonical_sha256":"4b2b2a467e8361ffe777a0ced9139b1ab24d7100c469fbe5fde48a0598f08002","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:03.518603Z","signature_b64":"MwWR4VFhaBq5pky1TVl/AvdBEaU1R1emYkFItsK+ra0GRTCD2lN0iHbgDuKC7VjSCiPZriHFXwWKkjwebhUYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b2b2a467e8361ffe777a0ced9139b1ab24d7100c469fbe5fde48a0598f08002","last_reissued_at":"2026-05-17T23:55:03.518054Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:03.518054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02349","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-17T23:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQretDY9iCloTIfn903KZJ0Ripj1brrgn5KGJ0w0wdmKlyZgBPDlWB60Dwi2E0AjQm/qmymzlL0k3YLT2acCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:31:50.951380Z"},"content_sha256":"d6ee3bcc9bc3a35491d6b0275a5e0549943557b6be716978929a78bf51262447","schema_version":"1.0","event_id":"sha256:d6ee3bcc9bc3a35491d6b0275a5e0549943557b6be716978929a78bf51262447"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JMVSURT6QNQ77Z3XUDHNSE43DK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.DS","authors_text":"Boaz Barak, Chi-Ning Chou, Tselil Schramm, Yueqi Sheng, Zhixian Lei","submitted_at":"2018-05-07T05:38:41Z","abstract_excerpt":"We give a quasipolynomial time algorithm for the graph matching problem (also known as noisy or robust graph isomorphism) on correlated random graphs. Specifically, for every $\\gamma>0$, we give a $n^{O(\\log n)}$ time algorithm that given a pair of $\\gamma$-correlated $G(n,p)$ graphs $G_0,G_1$ with average degree between $n^{\\varepsilon}$ and $n^{1/153}$ for $\\varepsilon = o(1)$, recovers the \"ground truth\" permutation $\\pi\\in S_n$ that matches the vertices of $G_0$ to the vertices of $G_n$ in the way that minimizes the number of mismatched edges. We also give a recovery algorithm for a denser"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02349","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-17T23:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NBccM/FiH6DGdOTLoooR1D8wAoJXpGKiWCo123AYqLxGmg+JBjA/yxhpmmBjsz5wxgjaaBm+gFEGPvcxiCuCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:31:50.952060Z"},"content_sha256":"49c1488dae01ecadca052fa884c1a19ef0cdbe6fde87e8d452fc4d67bc13a435","schema_version":"1.0","event_id":"sha256:49c1488dae01ecadca052fa884c1a19ef0cdbe6fde87e8d452fc4d67bc13a435"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JMVSURT6QNQ77Z3XUDHNSE43DK/bundle.json","state_url":"https://pith.science/pith/JMVSURT6QNQ77Z3XUDHNSE43DK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JMVSURT6QNQ77Z3XUDHNSE43DK/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:31:50Z","links":{"resolver":"https://pith.science/pith/JMVSURT6QNQ77Z3XUDHNSE43DK","bundle":"https://pith.science/pith/JMVSURT6QNQ77Z3XUDHNSE43DK/bundle.json","state":"https://pith.science/pith/JMVSURT6QNQ77Z3XUDHNSE43DK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JMVSURT6QNQ77Z3XUDHNSE43DK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JMVSURT6QNQ77Z3XUDHNSE43DK","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":"691710620cea2c130ec521e030d9056a7fd84c20c3a21820d9f0c83469aad369","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-07T05:38:41Z","title_canon_sha256":"b559c9dab58fb64a59bd1a0b9be7666a47898c0a92a2cbd5f9bd6555764e09c4"},"schema_version":"1.0","source":{"id":"1805.02349","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02349","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02349v2","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02349","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"JMVSURT6QNQ7","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JMVSURT6QNQ77Z3X","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JMVSURT6","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:49c1488dae01ecadca052fa884c1a19ef0cdbe6fde87e8d452fc4d67bc13a435","target":"graph","created_at":"2026-05-17T23:55:03Z","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 give a quasipolynomial time algorithm for the graph matching problem (also known as noisy or robust graph isomorphism) on correlated random graphs. Specifically, for every $\\gamma>0$, we give a $n^{O(\\log n)}$ time algorithm that given a pair of $\\gamma$-correlated $G(n,p)$ graphs $G_0,G_1$ with average degree between $n^{\\varepsilon}$ and $n^{1/153}$ for $\\varepsilon = o(1)$, recovers the \"ground truth\" permutation $\\pi\\in S_n$ that matches the vertices of $G_0$ to the vertices of $G_n$ in the way that minimizes the number of mismatched edges. We also give a recovery algorithm for a denser","authors_text":"Boaz Barak, Chi-Ning Chou, Tselil Schramm, Yueqi Sheng, Zhixian Lei","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-07T05:38:41Z","title":"(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02349","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:d6ee3bcc9bc3a35491d6b0275a5e0549943557b6be716978929a78bf51262447","target":"record","created_at":"2026-05-17T23:55:03Z","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":"691710620cea2c130ec521e030d9056a7fd84c20c3a21820d9f0c83469aad369","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-07T05:38:41Z","title_canon_sha256":"b559c9dab58fb64a59bd1a0b9be7666a47898c0a92a2cbd5f9bd6555764e09c4"},"schema_version":"1.0","source":{"id":"1805.02349","kind":"arxiv","version":2}},"canonical_sha256":"4b2b2a467e8361ffe777a0ced9139b1ab24d7100c469fbe5fde48a0598f08002","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b2b2a467e8361ffe777a0ced9139b1ab24d7100c469fbe5fde48a0598f08002","first_computed_at":"2026-05-17T23:55:03.518054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:03.518054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MwWR4VFhaBq5pky1TVl/AvdBEaU1R1emYkFItsK+ra0GRTCD2lN0iHbgDuKC7VjSCiPZriHFXwWKkjwebhUYBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:03.518603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02349","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6ee3bcc9bc3a35491d6b0275a5e0549943557b6be716978929a78bf51262447","sha256:49c1488dae01ecadca052fa884c1a19ef0cdbe6fde87e8d452fc4d67bc13a435"],"state_sha256":"0b221759e4e3dd446080b4fb38c8f28909b915770e35b7b547c049568a1a6af3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZ4PJbTZstblf3LtC6dviNde1Jmwj9bpLefJbnndRm9vdeaELRGjUrM3q4fmqtyRvo61OXInilGiiInhdZlYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:31:50.956207Z","bundle_sha256":"ff9519cd6d1eb44c51df898d70c7e4a75f30fa3f2d57f10f970d6bfe7ccc3927"}}