{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FDCARDFETHHVUG56W5SK3YAX6G","short_pith_number":"pith:FDCARDFE","canonical_record":{"source":{"id":"1208.3757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-18T15:59:12Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"c3ffb0e5e71b7e27f22d77aa26102dc5e79264fcbf8716c3a9b180f61083f32c","abstract_canon_sha256":"669f50031235bbfa61a26c28ca0b472960b8dacc34f4132f00c5229248a11f4b"},"schema_version":"1.0"},"canonical_sha256":"28c4088ca499cf5a1bbeb764ade017f1a58704d40bbe41191d7327f6d9547746","source":{"kind":"arxiv","id":"1208.3757","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3757","created_at":"2026-05-18T03:39:28Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3757v2","created_at":"2026-05-18T03:39:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3757","created_at":"2026-05-18T03:39:28Z"},{"alias_kind":"pith_short_12","alias_value":"FDCARDFETHHV","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FDCARDFETHHVUG56","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FDCARDFE","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FDCARDFETHHVUG56W5SK3YAX6G","target":"record","payload":{"canonical_record":{"source":{"id":"1208.3757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-18T15:59:12Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"c3ffb0e5e71b7e27f22d77aa26102dc5e79264fcbf8716c3a9b180f61083f32c","abstract_canon_sha256":"669f50031235bbfa61a26c28ca0b472960b8dacc34f4132f00c5229248a11f4b"},"schema_version":"1.0"},"canonical_sha256":"28c4088ca499cf5a1bbeb764ade017f1a58704d40bbe41191d7327f6d9547746","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:28.186846Z","signature_b64":"SYuAgWkXFs9RB3qqt3WZrOxQ9+dGmRxW66ids8Mg7QF0e0nHoc9PLrWVLqFnYcQHcRSbKL+iju3X8bQd2uynDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28c4088ca499cf5a1bbeb764ade017f1a58704d40bbe41191d7327f6d9547746","last_reissued_at":"2026-05-18T03:39:28.186062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:28.186062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.3757","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-18T03:39:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QE5A/72dZ8zm7HEOs3KKr/K0XiZrJEC9UnipWKQX52w+Xsv/1T10rnUAeWvQ3LEoR9f4OIUGTkAytECAPxudAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:35:46.675930Z"},"content_sha256":"27553d5ef6ed33e1980da38ecb91d2e5d435685cf3c45dd245b4a319aad080d8","schema_version":"1.0","event_id":"sha256:27553d5ef6ed33e1980da38ecb91d2e5d435685cf3c45dd245b4a319aad080d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FDCARDFETHHVUG56W5SK3YAX6G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"A. P. Young, A. W. Sandvik, David Gosset, Edward Farhi, Francesco Zamponi, Itay Hen, Peter Shor","submitted_at":"2012-08-18T15:59:12Z","abstract_excerpt":"In this paper we study the performance of the quantum adiabatic algorithm on random instances of two combinatorial optimization problems, 3-regular 3-XORSAT and 3-regular Max-Cut. The cost functions associated with these two clause-based optimization problems are similar as they are both defined on 3-regular hypergraphs. For 3-regular 3-XORSAT the clauses contain three variables and for 3-regular Max-Cut the clauses contain two variables. The quantum adiabatic algorithms we study for these two problems use interpolating Hamiltonians which are stoquastic and therefore amenable to sign-problem f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3757","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-18T03:39:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uY5iZwHP/IUy44Vsime1b469wNNVQdwTC2r3R+CmV2b6mcXWQfJhvrl7A6MpfbGULP2cCpYiQkrMOtW9iLToCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:35:46.676288Z"},"content_sha256":"06e980b6b6ed5d8c8707326571f098ec734d1fbad30605ca10921234718f6828","schema_version":"1.0","event_id":"sha256:06e980b6b6ed5d8c8707326571f098ec734d1fbad30605ca10921234718f6828"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FDCARDFETHHVUG56W5SK3YAX6G/bundle.json","state_url":"https://pith.science/pith/FDCARDFETHHVUG56W5SK3YAX6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FDCARDFETHHVUG56W5SK3YAX6G/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-02T20:35:46Z","links":{"resolver":"https://pith.science/pith/FDCARDFETHHVUG56W5SK3YAX6G","bundle":"https://pith.science/pith/FDCARDFETHHVUG56W5SK3YAX6G/bundle.json","state":"https://pith.science/pith/FDCARDFETHHVUG56W5SK3YAX6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FDCARDFETHHVUG56W5SK3YAX6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FDCARDFETHHVUG56W5SK3YAX6G","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":"669f50031235bbfa61a26c28ca0b472960b8dacc34f4132f00c5229248a11f4b","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-18T15:59:12Z","title_canon_sha256":"c3ffb0e5e71b7e27f22d77aa26102dc5e79264fcbf8716c3a9b180f61083f32c"},"schema_version":"1.0","source":{"id":"1208.3757","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3757","created_at":"2026-05-18T03:39:28Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3757v2","created_at":"2026-05-18T03:39:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3757","created_at":"2026-05-18T03:39:28Z"},{"alias_kind":"pith_short_12","alias_value":"FDCARDFETHHV","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FDCARDFETHHVUG56","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FDCARDFE","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:06e980b6b6ed5d8c8707326571f098ec734d1fbad30605ca10921234718f6828","target":"graph","created_at":"2026-05-18T03:39:28Z","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 study the performance of the quantum adiabatic algorithm on random instances of two combinatorial optimization problems, 3-regular 3-XORSAT and 3-regular Max-Cut. The cost functions associated with these two clause-based optimization problems are similar as they are both defined on 3-regular hypergraphs. For 3-regular 3-XORSAT the clauses contain three variables and for 3-regular Max-Cut the clauses contain two variables. The quantum adiabatic algorithms we study for these two problems use interpolating Hamiltonians which are stoquastic and therefore amenable to sign-problem f","authors_text":"A. P. Young, A. W. Sandvik, David Gosset, Edward Farhi, Francesco Zamponi, Itay Hen, Peter Shor","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-18T15:59:12Z","title":"The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3757","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:27553d5ef6ed33e1980da38ecb91d2e5d435685cf3c45dd245b4a319aad080d8","target":"record","created_at":"2026-05-18T03:39:28Z","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":"669f50031235bbfa61a26c28ca0b472960b8dacc34f4132f00c5229248a11f4b","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-18T15:59:12Z","title_canon_sha256":"c3ffb0e5e71b7e27f22d77aa26102dc5e79264fcbf8716c3a9b180f61083f32c"},"schema_version":"1.0","source":{"id":"1208.3757","kind":"arxiv","version":2}},"canonical_sha256":"28c4088ca499cf5a1bbeb764ade017f1a58704d40bbe41191d7327f6d9547746","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28c4088ca499cf5a1bbeb764ade017f1a58704d40bbe41191d7327f6d9547746","first_computed_at":"2026-05-18T03:39:28.186062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:28.186062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SYuAgWkXFs9RB3qqt3WZrOxQ9+dGmRxW66ids8Mg7QF0e0nHoc9PLrWVLqFnYcQHcRSbKL+iju3X8bQd2uynDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:28.186846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.3757","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27553d5ef6ed33e1980da38ecb91d2e5d435685cf3c45dd245b4a319aad080d8","sha256:06e980b6b6ed5d8c8707326571f098ec734d1fbad30605ca10921234718f6828"],"state_sha256":"e1c72e48554f463fbf151d7f454535cd10db786cc1e4d046aeb6211cf086f376"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Omvq+oR5WEUk/ciiQfuNxQ1PIkMUSlxCrxfPN8Je9eyAkylipzy2sy5cnvXq8+QHRud9P85X8cPCRKR6HWlSDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:35:46.678269Z","bundle_sha256":"563ad50b27eee4cbd9fd194421373ef4bd1b0c78ec48466b811b380f729f5ed6"}}