{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:F6N22YAYJLP6TF7Z5FFSUWL2LB","short_pith_number":"pith:F6N22YAY","canonical_record":{"source":{"id":"1903.06454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-15T10:47:48Z","cross_cats_sorted":[],"title_canon_sha256":"2cac4f83ed33989f29228754487d324017fbd258ea2bd9c8c7fce3de2229be8f","abstract_canon_sha256":"af20135f3d51ca3cbc78aa9adefe8a90de7b6bf91378d46882f6a470dc4635fd"},"schema_version":"1.0"},"canonical_sha256":"2f9bad60184adfe997f9e94b2a597a5874459b0c8c0ef76f5aacb01ec5d14281","source":{"kind":"arxiv","id":"1903.06454","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06454","created_at":"2026-07-05T01:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06454v2","created_at":"2026-07-05T01:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06454","created_at":"2026-07-05T01:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"F6N22YAYJLP6","created_at":"2026-07-05T01:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"F6N22YAYJLP6TF7Z","created_at":"2026-07-05T01:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"F6N22YAY","created_at":"2026-07-05T01:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:F6N22YAYJLP6TF7Z5FFSUWL2LB","target":"record","payload":{"canonical_record":{"source":{"id":"1903.06454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-15T10:47:48Z","cross_cats_sorted":[],"title_canon_sha256":"2cac4f83ed33989f29228754487d324017fbd258ea2bd9c8c7fce3de2229be8f","abstract_canon_sha256":"af20135f3d51ca3cbc78aa9adefe8a90de7b6bf91378d46882f6a470dc4635fd"},"schema_version":"1.0"},"canonical_sha256":"2f9bad60184adfe997f9e94b2a597a5874459b0c8c0ef76f5aacb01ec5d14281","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:28:28.174286Z","signature_b64":"vFY1p4p+137LPIQwZWLiLfuAtNq71CSMB2ExFrCsai7lEjlL/Cw8IQXGin41GOnRC82lO3bkQfZU6HRO5/MJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f9bad60184adfe997f9e94b2a597a5874459b0c8c0ef76f5aacb01ec5d14281","last_reissued_at":"2026-07-05T01:28:28.173911Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:28:28.173911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.06454","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-07-05T01:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MR77aRinZsZekALlu8B3EY5FOHiOSif6oXHSkx2pjL6UKgSP7VUewJccQ/nVQ8fBefEQM8b3yMPc9yjJsBbkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T23:20:43.106062Z"},"content_sha256":"1d6ccd5df4c3219f2e1f47fd3e4e4c9a9633d11c6ca5bf3766d693943c2045bb","schema_version":"1.0","event_id":"sha256:1d6ccd5df4c3219f2e1f47fd3e4e4c9a9633d11c6ca5bf3766d693943c2045bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:F6N22YAYJLP6TF7Z5FFSUWL2LB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Quantum Annealing Algorithm for Finding Pure Nash Equilibria in Graphical Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Christoph Roch, Claudia Linnhoff-Popien, Robert M\\\"uller, Sebastian Feld, Thomas Gabor, Thomy Phan","submitted_at":"2019-03-15T10:47:48Z","abstract_excerpt":"We introduce Q-Nash, a quantum annealing algorithm for the NP-complete problem of Fnding pure Nash equilibria in graphical games. The algorithm consists of two phases. The first phase determines all combinations of best response strategies for each player using classical computation. The second phase finds pure Nash equilibria using a quantum annealing device by mapping the computed combinations to a quadratic unconstrained binary optimization formulation based on the Set Cover problem. We empirically evaluate Q-Nash on D-Wave's Quantum Annealer 2000Q using different graphical game topologies."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06454","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1903.06454/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pNzC1HGv0rsD3hfAJTTf+jTm8cNWhh23M92Sh/KEkzVARcCdECr8bWgy1GCQoTrGNIRvlx7ihavbP+l4Ct1ZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T23:20:43.106590Z"},"content_sha256":"836a8618eb001048f810a02ad666b82d17e5a208cfdd48403e7b192efbbc234d","schema_version":"1.0","event_id":"sha256:836a8618eb001048f810a02ad666b82d17e5a208cfdd48403e7b192efbbc234d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6N22YAYJLP6TF7Z5FFSUWL2LB/bundle.json","state_url":"https://pith.science/pith/F6N22YAYJLP6TF7Z5FFSUWL2LB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6N22YAYJLP6TF7Z5FFSUWL2LB/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-07-31T23:20:43Z","links":{"resolver":"https://pith.science/pith/F6N22YAYJLP6TF7Z5FFSUWL2LB","bundle":"https://pith.science/pith/F6N22YAYJLP6TF7Z5FFSUWL2LB/bundle.json","state":"https://pith.science/pith/F6N22YAYJLP6TF7Z5FFSUWL2LB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6N22YAYJLP6TF7Z5FFSUWL2LB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:F6N22YAYJLP6TF7Z5FFSUWL2LB","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":"af20135f3d51ca3cbc78aa9adefe8a90de7b6bf91378d46882f6a470dc4635fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-15T10:47:48Z","title_canon_sha256":"2cac4f83ed33989f29228754487d324017fbd258ea2bd9c8c7fce3de2229be8f"},"schema_version":"1.0","source":{"id":"1903.06454","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06454","created_at":"2026-07-05T01:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06454v2","created_at":"2026-07-05T01:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06454","created_at":"2026-07-05T01:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"F6N22YAYJLP6","created_at":"2026-07-05T01:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"F6N22YAYJLP6TF7Z","created_at":"2026-07-05T01:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"F6N22YAY","created_at":"2026-07-05T01:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:836a8618eb001048f810a02ad666b82d17e5a208cfdd48403e7b192efbbc234d","target":"graph","created_at":"2026-07-05T01:28: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1903.06454/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce Q-Nash, a quantum annealing algorithm for the NP-complete problem of Fnding pure Nash equilibria in graphical games. The algorithm consists of two phases. The first phase determines all combinations of best response strategies for each player using classical computation. The second phase finds pure Nash equilibria using a quantum annealing device by mapping the computed combinations to a quadratic unconstrained binary optimization formulation based on the Set Cover problem. We empirically evaluate Q-Nash on D-Wave's Quantum Annealer 2000Q using different graphical game topologies.","authors_text":"Christoph Roch, Claudia Linnhoff-Popien, Robert M\\\"uller, Sebastian Feld, Thomas Gabor, Thomy Phan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-15T10:47:48Z","title":"A Quantum Annealing Algorithm for Finding Pure Nash Equilibria in Graphical Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06454","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:1d6ccd5df4c3219f2e1f47fd3e4e4c9a9633d11c6ca5bf3766d693943c2045bb","target":"record","created_at":"2026-07-05T01:28: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":"af20135f3d51ca3cbc78aa9adefe8a90de7b6bf91378d46882f6a470dc4635fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-15T10:47:48Z","title_canon_sha256":"2cac4f83ed33989f29228754487d324017fbd258ea2bd9c8c7fce3de2229be8f"},"schema_version":"1.0","source":{"id":"1903.06454","kind":"arxiv","version":2}},"canonical_sha256":"2f9bad60184adfe997f9e94b2a597a5874459b0c8c0ef76f5aacb01ec5d14281","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f9bad60184adfe997f9e94b2a597a5874459b0c8c0ef76f5aacb01ec5d14281","first_computed_at":"2026-07-05T01:28:28.173911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:28:28.173911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vFY1p4p+137LPIQwZWLiLfuAtNq71CSMB2ExFrCsai7lEjlL/Cw8IQXGin41GOnRC82lO3bkQfZU6HRO5/MJBA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:28:28.174286Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.06454","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d6ccd5df4c3219f2e1f47fd3e4e4c9a9633d11c6ca5bf3766d693943c2045bb","sha256:836a8618eb001048f810a02ad666b82d17e5a208cfdd48403e7b192efbbc234d"],"state_sha256":"ccb3898dc14f2f4b5a7ba4a6f2eaf1cdee2aa348130321078c70d0e76d7b5a68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YPFN/q3rfI520wCHr3+6hW96vO/4+aa83Tc4Q0SPjvt+tsbYaXWM/cIQYPzK9KV5JCGXBQIzbxRd72mPNcrmDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T23:20:43.110448Z","bundle_sha256":"4e1eb6038bcd6774caa26b3690bb6000d2ccc44e1f1b36e1d3d08290ad39f27c"}}