{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TTZRIFZZS7OC2B4JBH3EXML7L5","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":"cf119772dce660f4d827998873d7ae72feba5783a8f914888f87c5b8cf10f08b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-11-01T21:27:49Z","title_canon_sha256":"2384b7e0d96c3cdbd03f1bb4fe67fca92e93151708fd07919cdafcb3c96857dc"},"schema_version":"1.0","source":{"id":"1911.00595","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.00595","created_at":"2026-07-05T00:23:25Z"},{"alias_kind":"arxiv_version","alias_value":"1911.00595v2","created_at":"2026-07-05T00:23:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.00595","created_at":"2026-07-05T00:23:25Z"},{"alias_kind":"pith_short_12","alias_value":"TTZRIFZZS7OC","created_at":"2026-07-05T00:23:25Z"},{"alias_kind":"pith_short_16","alias_value":"TTZRIFZZS7OC2B4J","created_at":"2026-07-05T00:23:25Z"},{"alias_kind":"pith_short_8","alias_value":"TTZRIFZZ","created_at":"2026-07-05T00:23:25Z"}],"graph_snapshots":[{"event_id":"sha256:3dc8470d2507ee895ce2f2fce5b3b1588974d303ab56ac5ed9b88f7b0bcf4594","target":"graph","created_at":"2026-07-05T00:23:25Z","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/1911.00595/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The design of a good algorithm to solve NP-hard combinatorial approximation problems requires specific domain knowledge about the problems and often needs a trial-and-error problem solving approach. Graph coloring is one of the essential fields to provide an efficient solution for combinatorial applications such as flight scheduling, frequency allocation in networking, and register allocation. In particular, some optimization algorithms have been proposed to solve the multi-coloring graph problems but most of the cases a simple searching method would be the best approach to find an optimal sol","authors_text":"Anand Singh, Andy J. Rindos, Hamed Mohammadbagherpoor, Patrick Dreher, Xianqing Yu, Young-Hyun Oh","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-11-01T21:27:49Z","title":"Solving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.00595","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:2a49d4a78c460fb91b857e1d3f35277f5773c0b6e14593afc943734cc873e3de","target":"record","created_at":"2026-07-05T00:23:25Z","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":"cf119772dce660f4d827998873d7ae72feba5783a8f914888f87c5b8cf10f08b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-11-01T21:27:49Z","title_canon_sha256":"2384b7e0d96c3cdbd03f1bb4fe67fca92e93151708fd07919cdafcb3c96857dc"},"schema_version":"1.0","source":{"id":"1911.00595","kind":"arxiv","version":2}},"canonical_sha256":"9cf314173997dc2d078909f64bb17f5f6c47f55044f4d0da0aeb637ad1244bda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cf314173997dc2d078909f64bb17f5f6c47f55044f4d0da0aeb637ad1244bda","first_computed_at":"2026-07-05T00:23:25.363678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:23:25.363678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VXPq7T9RdB+jqPctihcnXl3Y3R4WtglaU09TIAta7MWjf2fzykH8jTmDsMcJPvVNlKjGl8CianOSWuheB6lABQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:23:25.364104Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.00595","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a49d4a78c460fb91b857e1d3f35277f5773c0b6e14593afc943734cc873e3de","sha256:3dc8470d2507ee895ce2f2fce5b3b1588974d303ab56ac5ed9b88f7b0bcf4594"],"state_sha256":"1118f02489b5d124bbd364000e129e6243039aa3602a19fa85468293e242b0cf"}