{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NM3L3VKH7D6ILX5M3HM2V4RF3T","short_pith_number":"pith:NM3L3VKH","canonical_record":{"source":{"id":"1401.0758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-04T00:16:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"260bb05f0b7672dab48a0a9b855095bbd51e00cafaa2ad36a8bf80c110288334","abstract_canon_sha256":"61a85998cc66cb93f928d2a0e3f75fd7f6800e93e55a66f91eea94f4706bf484"},"schema_version":"1.0"},"canonical_sha256":"6b36bdd547f8fc85dfacd9d9aaf225dcf5918976f545f888da09787206c5c281","source":{"kind":"arxiv","id":"1401.0758","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0758","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0758v1","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0758","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"pith_short_12","alias_value":"NM3L3VKH7D6I","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NM3L3VKH7D6ILX5M","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NM3L3VKH","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NM3L3VKH7D6ILX5M3HM2V4RF3T","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-04T00:16:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"260bb05f0b7672dab48a0a9b855095bbd51e00cafaa2ad36a8bf80c110288334","abstract_canon_sha256":"61a85998cc66cb93f928d2a0e3f75fd7f6800e93e55a66f91eea94f4706bf484"},"schema_version":"1.0"},"canonical_sha256":"6b36bdd547f8fc85dfacd9d9aaf225dcf5918976f545f888da09787206c5c281","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:06.721597Z","signature_b64":"aWbNHGtkXphWJEzzbo1s8lPRpZrHMlHGYGnWvFxe5OzbNA+cFZBZHImOqAqhVGsrFQm1uIvjF+TvUWye7oR7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b36bdd547f8fc85dfacd9d9aaf225dcf5918976f545f888da09787206c5c281","last_reissued_at":"2026-05-18T01:01:06.720940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:06.720940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0758","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:01:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ciEanWxK11ynIJS0YzYsi76zL2WbuSiBC1JkZuk2dQ5A8zvvZ5eT12jCgvqGSr0rEAiockEczH/3+ZiTNRa9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:14:43.488279Z"},"content_sha256":"56f8a0e683bbb683521c5399a966babc7753e57530dec66bee4d50e661eb30dd","schema_version":"1.0","event_id":"sha256:56f8a0e683bbb683521c5399a966babc7753e57530dec66bee4d50e661eb30dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NM3L3VKH7D6ILX5M3HM2V4RF3T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Isomorphism and the Lasserre Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Aaron Snook, Grant Schoenebeck, Paolo Codenotti","submitted_at":"2014-01-04T00:16:48Z","abstract_excerpt":"In this paper we show lower bounds for a certain large class of algorithms solving the Graph Isomorphism problem, even on expander graph instances. Spielman [25] shows an algorithm for isomorphism of strongly regular expander graphs that runs in time exp(O(n^(1/3)) (this bound was recently improved to expf O(n^(1/5) [5]). It has since been an open question to remove the requirement that the graph be strongly regular. Recent algorithmic results show that for many problems the Lasserre hierarchy works surprisingly well when the underlying graph has expansion properties. Moreover, recent work of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0758","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:01:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AuClWB1AsbTlTWw3QNw+s5b+aqbqUci1Y3lTu7e3vtKTfTih0ImOque3oJpg9sfZjxugI/xzu+DX52R8R75rAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:14:43.488994Z"},"content_sha256":"ceef84ca3b15e418e3f3220d11a567f3a690ceb10b667f995325bb285ffbb464","schema_version":"1.0","event_id":"sha256:ceef84ca3b15e418e3f3220d11a567f3a690ceb10b667f995325bb285ffbb464"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NM3L3VKH7D6ILX5M3HM2V4RF3T/bundle.json","state_url":"https://pith.science/pith/NM3L3VKH7D6ILX5M3HM2V4RF3T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NM3L3VKH7D6ILX5M3HM2V4RF3T/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-05T20:14:43Z","links":{"resolver":"https://pith.science/pith/NM3L3VKH7D6ILX5M3HM2V4RF3T","bundle":"https://pith.science/pith/NM3L3VKH7D6ILX5M3HM2V4RF3T/bundle.json","state":"https://pith.science/pith/NM3L3VKH7D6ILX5M3HM2V4RF3T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NM3L3VKH7D6ILX5M3HM2V4RF3T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NM3L3VKH7D6ILX5M3HM2V4RF3T","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":"61a85998cc66cb93f928d2a0e3f75fd7f6800e93e55a66f91eea94f4706bf484","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-04T00:16:48Z","title_canon_sha256":"260bb05f0b7672dab48a0a9b855095bbd51e00cafaa2ad36a8bf80c110288334"},"schema_version":"1.0","source":{"id":"1401.0758","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0758","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0758v1","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0758","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"pith_short_12","alias_value":"NM3L3VKH7D6I","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NM3L3VKH7D6ILX5M","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NM3L3VKH","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:ceef84ca3b15e418e3f3220d11a567f3a690ceb10b667f995325bb285ffbb464","target":"graph","created_at":"2026-05-18T01:01:06Z","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":"In this paper we show lower bounds for a certain large class of algorithms solving the Graph Isomorphism problem, even on expander graph instances. Spielman [25] shows an algorithm for isomorphism of strongly regular expander graphs that runs in time exp(O(n^(1/3)) (this bound was recently improved to expf O(n^(1/5) [5]). It has since been an open question to remove the requirement that the graph be strongly regular. Recent algorithmic results show that for many problems the Lasserre hierarchy works surprisingly well when the underlying graph has expansion properties. Moreover, recent work of ","authors_text":"Aaron Snook, Grant Schoenebeck, Paolo Codenotti","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-04T00:16:48Z","title":"Graph Isomorphism and the Lasserre Hierarchy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0758","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:56f8a0e683bbb683521c5399a966babc7753e57530dec66bee4d50e661eb30dd","target":"record","created_at":"2026-05-18T01:01:06Z","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":"61a85998cc66cb93f928d2a0e3f75fd7f6800e93e55a66f91eea94f4706bf484","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-04T00:16:48Z","title_canon_sha256":"260bb05f0b7672dab48a0a9b855095bbd51e00cafaa2ad36a8bf80c110288334"},"schema_version":"1.0","source":{"id":"1401.0758","kind":"arxiv","version":1}},"canonical_sha256":"6b36bdd547f8fc85dfacd9d9aaf225dcf5918976f545f888da09787206c5c281","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b36bdd547f8fc85dfacd9d9aaf225dcf5918976f545f888da09787206c5c281","first_computed_at":"2026-05-18T01:01:06.720940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:06.720940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aWbNHGtkXphWJEzzbo1s8lPRpZrHMlHGYGnWvFxe5OzbNA+cFZBZHImOqAqhVGsrFQm1uIvjF+TvUWye7oR7Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:06.721597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0758","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56f8a0e683bbb683521c5399a966babc7753e57530dec66bee4d50e661eb30dd","sha256:ceef84ca3b15e418e3f3220d11a567f3a690ceb10b667f995325bb285ffbb464"],"state_sha256":"d929b7c96ce2281301fc5d4dbc325545f816fc87f6da4d112ba740727acb58a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bs31ZNiIT2xKhtiylykwuc3ebFagNAqK1Zuq6kaO0LLz/GOazAm9Z9iUrUu/qyduhy1izELSR3eqA952QXspDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:14:43.492813Z","bundle_sha256":"961e63df815230f3b83681e07c40a5bb587640038d76ca7eb6e0cab2708c1737"}}