{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OVUHSQL542YQFSUWNSGVHOVQEU","short_pith_number":"pith:OVUHSQL5","canonical_record":{"source":{"id":"1401.2436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-10T19:50:15Z","cross_cats_sorted":[],"title_canon_sha256":"fd5d259e0045a1e42c3a476d8f10202e6e26ac83a0b3d409265e8634d7132e6b","abstract_canon_sha256":"a32d63d230d40deebda4b280b5cf2fa50ef48c4e2db3e279cb2f8fcb3033d88d"},"schema_version":"1.0"},"canonical_sha256":"756879417de6b102ca966c8d53bab02506b9110470f6d854c44dd8c91fe0457e","source":{"kind":"arxiv","id":"1401.2436","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2436","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2436v1","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2436","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"OVUHSQL542YQ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OVUHSQL542YQFSUW","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OVUHSQL5","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OVUHSQL542YQFSUWNSGVHOVQEU","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-10T19:50:15Z","cross_cats_sorted":[],"title_canon_sha256":"fd5d259e0045a1e42c3a476d8f10202e6e26ac83a0b3d409265e8634d7132e6b","abstract_canon_sha256":"a32d63d230d40deebda4b280b5cf2fa50ef48c4e2db3e279cb2f8fcb3033d88d"},"schema_version":"1.0"},"canonical_sha256":"756879417de6b102ca966c8d53bab02506b9110470f6d854c44dd8c91fe0457e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:45.279171Z","signature_b64":"PpePyrFXVT80glpa1BEfnH95atS0+eY62JVx0rSYlKJHX+Yol+QcbBOkOXQKH30RJtbjD9jMLNYMzyIX+2VDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"756879417de6b102ca966c8d53bab02506b9110470f6d854c44dd8c91fe0457e","last_reissued_at":"2026-05-18T03:02:45.278468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:45.278468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2436","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-18T03:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UUzwO2hVTaLRHG0JRr7a0HMDbksMwZ31T71nyj/ddb5uoHwCHoR2HFmWejK2NHi923KMtX7WJ9UEe3pgNAmkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:44:08.280228Z"},"content_sha256":"1c84fedd07226c13a0e03446a6b02a54723dc57ac7699f70d966d34c32df5d74","schema_version":"1.0","event_id":"sha256:1c84fedd07226c13a0e03446a6b02a54723dc57ac7699f70d966d34c32df5d74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OVUHSQL542YQFSUWNSGVHOVQEU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness of robust graph isomorphism, Lasserre gaps, and asymmetry of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Chenggang Wu, John Wright, Ryan O'Donnell, Yuan Zhou","submitted_at":"2014-01-10T19:50:15Z","abstract_excerpt":"Building on work of Cai, F\\\"urer, and Immerman \\cite{CFI92}, we show two hardness results for the Graph Isomorphism problem. First, we show that there are pairs of nonisomorphic $n$-vertex graphs $G$ and $H$ such that any sum-of-squares (SOS) proof of nonisomorphism requires degree $\\Omega(n)$. In other words, we show an $\\Omega(n)$-round integrality gap for the Lasserre SDP relaxation. In fact, we show this for pairs $G$ and $H$ which are not even $(1-10^{-14})$-isomorphic. (Here we say that two $n$-vertex, $m$-edge graphs $G$ and $H$ are $\\alpha$-isomorphic if there is a bijection between th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2436","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-18T03:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CGK4PsFkYh9eaz+PgcAvKYpoJiAY2o8sLUhTz8Ceiw9ctIbvUS3pBDsludfpfBiv7t8+d9FwoTLe0DwXAp/cBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:44:08.280834Z"},"content_sha256":"fdc5d7514c1e267c36824d3ee62e69e1e7652e288f9f1f3ffa7794d66c0d3f94","schema_version":"1.0","event_id":"sha256:fdc5d7514c1e267c36824d3ee62e69e1e7652e288f9f1f3ffa7794d66c0d3f94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVUHSQL542YQFSUWNSGVHOVQEU/bundle.json","state_url":"https://pith.science/pith/OVUHSQL542YQFSUWNSGVHOVQEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVUHSQL542YQFSUWNSGVHOVQEU/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-06-04T20:44:08Z","links":{"resolver":"https://pith.science/pith/OVUHSQL542YQFSUWNSGVHOVQEU","bundle":"https://pith.science/pith/OVUHSQL542YQFSUWNSGVHOVQEU/bundle.json","state":"https://pith.science/pith/OVUHSQL542YQFSUWNSGVHOVQEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVUHSQL542YQFSUWNSGVHOVQEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OVUHSQL542YQFSUWNSGVHOVQEU","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":"a32d63d230d40deebda4b280b5cf2fa50ef48c4e2db3e279cb2f8fcb3033d88d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-10T19:50:15Z","title_canon_sha256":"fd5d259e0045a1e42c3a476d8f10202e6e26ac83a0b3d409265e8634d7132e6b"},"schema_version":"1.0","source":{"id":"1401.2436","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2436","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2436v1","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2436","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"OVUHSQL542YQ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OVUHSQL542YQFSUW","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OVUHSQL5","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:fdc5d7514c1e267c36824d3ee62e69e1e7652e288f9f1f3ffa7794d66c0d3f94","target":"graph","created_at":"2026-05-18T03:02:45Z","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":"Building on work of Cai, F\\\"urer, and Immerman \\cite{CFI92}, we show two hardness results for the Graph Isomorphism problem. First, we show that there are pairs of nonisomorphic $n$-vertex graphs $G$ and $H$ such that any sum-of-squares (SOS) proof of nonisomorphism requires degree $\\Omega(n)$. In other words, we show an $\\Omega(n)$-round integrality gap for the Lasserre SDP relaxation. In fact, we show this for pairs $G$ and $H$ which are not even $(1-10^{-14})$-isomorphic. (Here we say that two $n$-vertex, $m$-edge graphs $G$ and $H$ are $\\alpha$-isomorphic if there is a bijection between th","authors_text":"Chenggang Wu, John Wright, Ryan O'Donnell, Yuan Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-10T19:50:15Z","title":"Hardness of robust graph isomorphism, Lasserre gaps, and asymmetry of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2436","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:1c84fedd07226c13a0e03446a6b02a54723dc57ac7699f70d966d34c32df5d74","target":"record","created_at":"2026-05-18T03:02:45Z","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":"a32d63d230d40deebda4b280b5cf2fa50ef48c4e2db3e279cb2f8fcb3033d88d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-10T19:50:15Z","title_canon_sha256":"fd5d259e0045a1e42c3a476d8f10202e6e26ac83a0b3d409265e8634d7132e6b"},"schema_version":"1.0","source":{"id":"1401.2436","kind":"arxiv","version":1}},"canonical_sha256":"756879417de6b102ca966c8d53bab02506b9110470f6d854c44dd8c91fe0457e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"756879417de6b102ca966c8d53bab02506b9110470f6d854c44dd8c91fe0457e","first_computed_at":"2026-05-18T03:02:45.278468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:45.278468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PpePyrFXVT80glpa1BEfnH95atS0+eY62JVx0rSYlKJHX+Yol+QcbBOkOXQKH30RJtbjD9jMLNYMzyIX+2VDBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:45.279171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2436","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c84fedd07226c13a0e03446a6b02a54723dc57ac7699f70d966d34c32df5d74","sha256:fdc5d7514c1e267c36824d3ee62e69e1e7652e288f9f1f3ffa7794d66c0d3f94"],"state_sha256":"b865ec5a0aecb49d9413db6d5d235e2289a06cac9a49695797fc5773ed9771b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j8wvFHal+ywqDhldRkrdTQfToEgj4yrUF9UIYa0PDXZIR7tu8Ed9Nh+FWXXOEISgLAYiI/g3efFQAnavHkK5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:44:08.284177Z","bundle_sha256":"1fb3f914e7ff44765bd2061523d4264c23fe6975ca6fc5fe5c0fcfcd08c7a9a6"}}