{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XZYKRJTJBOGATA7FL62KX7NPDD","short_pith_number":"pith:XZYKRJTJ","canonical_record":{"source":{"id":"1103.1345","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-03-07T19:28:02Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"104d39d49affa9a19f72b96e3393137dac0d45e4e418dd79c593f514656e7796","abstract_canon_sha256":"22fe26388e042c4e5b32c23005fec137d16b5fb61bf1dc539b0aa8e12f5d18e0"},"schema_version":"1.0"},"canonical_sha256":"be70a8a6690b8c0983e55fb4abfdaf18cefff21a35e9b9a6a5001e93b57657b5","source":{"kind":"arxiv","id":"1103.1345","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1345","created_at":"2026-05-18T02:02:58Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1345v3","created_at":"2026-05-18T02:02:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1345","created_at":"2026-05-18T02:02:58Z"},{"alias_kind":"pith_short_12","alias_value":"XZYKRJTJBOGA","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XZYKRJTJBOGATA7F","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XZYKRJTJ","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XZYKRJTJBOGATA7FL62KX7NPDD","target":"record","payload":{"canonical_record":{"source":{"id":"1103.1345","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-03-07T19:28:02Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"104d39d49affa9a19f72b96e3393137dac0d45e4e418dd79c593f514656e7796","abstract_canon_sha256":"22fe26388e042c4e5b32c23005fec137d16b5fb61bf1dc539b0aa8e12f5d18e0"},"schema_version":"1.0"},"canonical_sha256":"be70a8a6690b8c0983e55fb4abfdaf18cefff21a35e9b9a6a5001e93b57657b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:58.712273Z","signature_b64":"dSt4HIFSfidXIMguP2YdyVxwi2krAflS0METOR7lrlHhi74DrpGflSLSKv/yq+NWVFgGI4u9x93UyDdPRCL3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be70a8a6690b8c0983e55fb4abfdaf18cefff21a35e9b9a6a5001e93b57657b5","last_reissued_at":"2026-05-18T02:02:58.711676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:58.711676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.1345","source_version":3,"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-18T02:02:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+HTleRzVqjtIT8Svlg8/v9Km3NveLsgwYQPx3qaG0/Bu/cd54F6LDsThqf3MurnLqBM8zflkQl87uWSxxvgVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:00:20.772529Z"},"content_sha256":"eb908f6980326e17683dd1b02c9ddaab9a99155f32054173a42b183cf527e344","schema_version":"1.0","event_id":"sha256:eb908f6980326e17683dd1b02c9ddaab9a99155f32054173a42b183cf527e344"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XZYKRJTJBOGATA7FL62KX7NPDD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ramsey numbers and adiabatic quantum computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Frank Gaitan, Lane Clark","submitted_at":"2011-03-07T19:28:02Z","abstract_excerpt":"The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers $R(m,n)$ with $m,n\\geq 3$, only nine are currently known. We present a quantum algorithm for the computation of the Ramsey numbers $R(m,n)$. We show how the computation of $R(m,n)$ can be mapped to a combinatorial optimization problem whose solution can be found using adiabatic quantum evolution. We numerically simulate this adiabatic quantum algorithm and show that it correctly determines the Ramsey numbers R(3,3) and R(2,s) for $5\\leq s\\leq 7$. We then discuss the algorithm's "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1345","kind":"arxiv","version":3},"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-18T02:02:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eyrXh5ZIQfQscB0qwShrCrbAhpyAHKG8Z7nB6mwCHaiRXqKYzyk1s8IZlMv6qZsBwQ4ljOmNllgWdBtjc4xPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:00:20.773097Z"},"content_sha256":"11def2e9949e2eb048cdb04746c180cd96ebaf3d82baf32c28a189a582dbdad9","schema_version":"1.0","event_id":"sha256:11def2e9949e2eb048cdb04746c180cd96ebaf3d82baf32c28a189a582dbdad9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZYKRJTJBOGATA7FL62KX7NPDD/bundle.json","state_url":"https://pith.science/pith/XZYKRJTJBOGATA7FL62KX7NPDD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZYKRJTJBOGATA7FL62KX7NPDD/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-11T02:00:20Z","links":{"resolver":"https://pith.science/pith/XZYKRJTJBOGATA7FL62KX7NPDD","bundle":"https://pith.science/pith/XZYKRJTJBOGATA7FL62KX7NPDD/bundle.json","state":"https://pith.science/pith/XZYKRJTJBOGATA7FL62KX7NPDD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZYKRJTJBOGATA7FL62KX7NPDD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XZYKRJTJBOGATA7FL62KX7NPDD","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":"22fe26388e042c4e5b32c23005fec137d16b5fb61bf1dc539b0aa8e12f5d18e0","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-03-07T19:28:02Z","title_canon_sha256":"104d39d49affa9a19f72b96e3393137dac0d45e4e418dd79c593f514656e7796"},"schema_version":"1.0","source":{"id":"1103.1345","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1345","created_at":"2026-05-18T02:02:58Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1345v3","created_at":"2026-05-18T02:02:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1345","created_at":"2026-05-18T02:02:58Z"},{"alias_kind":"pith_short_12","alias_value":"XZYKRJTJBOGA","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XZYKRJTJBOGATA7F","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XZYKRJTJ","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:11def2e9949e2eb048cdb04746c180cd96ebaf3d82baf32c28a189a582dbdad9","target":"graph","created_at":"2026-05-18T02:02:58Z","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":"The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers $R(m,n)$ with $m,n\\geq 3$, only nine are currently known. We present a quantum algorithm for the computation of the Ramsey numbers $R(m,n)$. We show how the computation of $R(m,n)$ can be mapped to a combinatorial optimization problem whose solution can be found using adiabatic quantum evolution. We numerically simulate this adiabatic quantum algorithm and show that it correctly determines the Ramsey numbers R(3,3) and R(2,s) for $5\\leq s\\leq 7$. We then discuss the algorithm's ","authors_text":"Frank Gaitan, Lane Clark","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-03-07T19:28:02Z","title":"Ramsey numbers and adiabatic quantum computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1345","kind":"arxiv","version":3},"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:eb908f6980326e17683dd1b02c9ddaab9a99155f32054173a42b183cf527e344","target":"record","created_at":"2026-05-18T02:02:58Z","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":"22fe26388e042c4e5b32c23005fec137d16b5fb61bf1dc539b0aa8e12f5d18e0","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-03-07T19:28:02Z","title_canon_sha256":"104d39d49affa9a19f72b96e3393137dac0d45e4e418dd79c593f514656e7796"},"schema_version":"1.0","source":{"id":"1103.1345","kind":"arxiv","version":3}},"canonical_sha256":"be70a8a6690b8c0983e55fb4abfdaf18cefff21a35e9b9a6a5001e93b57657b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be70a8a6690b8c0983e55fb4abfdaf18cefff21a35e9b9a6a5001e93b57657b5","first_computed_at":"2026-05-18T02:02:58.711676Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:02:58.711676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dSt4HIFSfidXIMguP2YdyVxwi2krAflS0METOR7lrlHhi74DrpGflSLSKv/yq+NWVFgGI4u9x93UyDdPRCL3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:02:58.712273Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.1345","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb908f6980326e17683dd1b02c9ddaab9a99155f32054173a42b183cf527e344","sha256:11def2e9949e2eb048cdb04746c180cd96ebaf3d82baf32c28a189a582dbdad9"],"state_sha256":"d8d941a557744e085bf8a2be4f893d0078df8e646ddcbcbb8c778818ef266f19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"otdFRc7tcKbL9nO6oNuk55Ag2Vs1LJUkkl+HEATKkv9yf3YqF4111lXtuI8VSy/rDjeNHvT+e3FwteGDzDwCAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:00:20.776283Z","bundle_sha256":"8c09b4e52c0d148f61ea1ba5be57cc8d9c5d14b0867616e3e15e888b204898fd"}}