{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Q5KUZKZRVSYXVAJCUE5ZSDT2OJ","short_pith_number":"pith:Q5KUZKZR","schema_version":"1.0","canonical_sha256":"87554cab31acb17a8122a13b990e7a7263f7a40f877df0114a65fde0e0bc6667","source":{"kind":"arxiv","id":"2012.04470","version":1},"attestation_state":"computed","paper":{"title":"Graph Coloring with Quantum Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Julia Kwok, Kristen Pudenz","submitted_at":"2020-12-08T15:08:22Z","abstract_excerpt":"We develop a heuristic graph coloring approximation algorithm that uses the D-Wave 2X as an independent set sampler and evaluate its performance against a fully classical implementation. A randomly generated set of small but hard graph instances serves as our test set. Our performance analysis suggests limited quantum advantage in the hybrid quantum-classical algorithm. The quantum edge holds over multiple metrics and suggests that graph problem applications are a good fit for quantum annealers."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2012.04470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-12-08T15:08:22Z","cross_cats_sorted":[],"title_canon_sha256":"6543fb1216ed8b9e67a3fe2de5a8c932e0692aa0ba0fae8bac30fe4768f06970","abstract_canon_sha256":"a67ca4ced290f1abada05ba5b88755a7db36b35c665d568c65fb2d1a1d3206bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:04.375886Z","signature_b64":"tRsDCs2JtvSASp0gZdHisUQX9+B+7T3N/Qu+iPAteDYZvJ/egIn83k2/xo23DF5OinpNoUS+ipf+hNc8tkgCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87554cab31acb17a8122a13b990e7a7263f7a40f877df0114a65fde0e0bc6667","last_reissued_at":"2026-07-05T01:58:04.375471Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:04.375471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Coloring with Quantum Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Julia Kwok, Kristen Pudenz","submitted_at":"2020-12-08T15:08:22Z","abstract_excerpt":"We develop a heuristic graph coloring approximation algorithm that uses the D-Wave 2X as an independent set sampler and evaluate its performance against a fully classical implementation. A randomly generated set of small but hard graph instances serves as our test set. Our performance analysis suggests limited quantum advantage in the hybrid quantum-classical algorithm. The quantum edge holds over multiple metrics and suggests that graph problem applications are a good fit for quantum annealers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.04470","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.04470/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2012.04470","created_at":"2026-07-05T01:58:04.375526+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.04470v1","created_at":"2026-07-05T01:58:04.375526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.04470","created_at":"2026-07-05T01:58:04.375526+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5KUZKZRVSYX","created_at":"2026-07-05T01:58:04.375526+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5KUZKZRVSYXVAJC","created_at":"2026-07-05T01:58:04.375526+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5KUZKZR","created_at":"2026-07-05T01:58:04.375526+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.08694","citing_title":"A Resource-Efficient Quantum Framework for Graph Coloring and Chromatic Number Estimation","ref_index":2020,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q5KUZKZRVSYXVAJCUE5ZSDT2OJ","json":"https://pith.science/pith/Q5KUZKZRVSYXVAJCUE5ZSDT2OJ.json","graph_json":"https://pith.science/api/pith-number/Q5KUZKZRVSYXVAJCUE5ZSDT2OJ/graph.json","events_json":"https://pith.science/api/pith-number/Q5KUZKZRVSYXVAJCUE5ZSDT2OJ/events.json","paper":"https://pith.science/paper/Q5KUZKZR"},"agent_actions":{"view_html":"https://pith.science/pith/Q5KUZKZRVSYXVAJCUE5ZSDT2OJ","download_json":"https://pith.science/pith/Q5KUZKZRVSYXVAJCUE5ZSDT2OJ.json","view_paper":"https://pith.science/paper/Q5KUZKZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.04470&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5KUZKZRVSYXVAJCUE5ZSDT2OJ/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5KUZKZRVSYXVAJCUE5ZSDT2OJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5KUZKZRVSYXVAJCUE5ZSDT2OJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5KUZKZRVSYXVAJCUE5ZSDT2OJ/action/storage_attestation","attest_author":"https://pith.science/pith/Q5KUZKZRVSYXVAJCUE5ZSDT2OJ/action/author_attestation","sign_citation":"https://pith.science/pith/Q5KUZKZRVSYXVAJCUE5ZSDT2OJ/action/citation_signature","submit_replication":"https://pith.science/pith/Q5KUZKZRVSYXVAJCUE5ZSDT2OJ/action/replication_record"}},"created_at":"2026-07-05T01:58:04.375526+00:00","updated_at":"2026-07-05T01:58:04.375526+00:00"}