{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:6XWEYMZHRLRPZWVNPWA6OWQVGM","short_pith_number":"pith:6XWEYMZH","canonical_record":{"source":{"id":"2504.21335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-30T05:45:15Z","cross_cats_sorted":[],"title_canon_sha256":"57e191cb0b32a163c7df72965d16dfda576a55440ebc64f9c30e11d8c5701887","abstract_canon_sha256":"dde47467ac46b4eaf56c997e13b6c04deb454004705424a324147898c0b4901a"},"schema_version":"1.0"},"canonical_sha256":"f5ec4c33278ae2fcdaad7d81e75a153328976dca4080fc7a2849d12920f94b3a","source":{"kind":"arxiv","id":"2504.21335","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.21335","created_at":"2026-07-05T10:56:22Z"},{"alias_kind":"arxiv_version","alias_value":"2504.21335v1","created_at":"2026-07-05T10:56:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21335","created_at":"2026-07-05T10:56:22Z"},{"alias_kind":"pith_short_12","alias_value":"6XWEYMZHRLRP","created_at":"2026-07-05T10:56:22Z"},{"alias_kind":"pith_short_16","alias_value":"6XWEYMZHRLRPZWVN","created_at":"2026-07-05T10:56:22Z"},{"alias_kind":"pith_short_8","alias_value":"6XWEYMZH","created_at":"2026-07-05T10:56:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:6XWEYMZHRLRPZWVNPWA6OWQVGM","target":"record","payload":{"canonical_record":{"source":{"id":"2504.21335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-30T05:45:15Z","cross_cats_sorted":[],"title_canon_sha256":"57e191cb0b32a163c7df72965d16dfda576a55440ebc64f9c30e11d8c5701887","abstract_canon_sha256":"dde47467ac46b4eaf56c997e13b6c04deb454004705424a324147898c0b4901a"},"schema_version":"1.0"},"canonical_sha256":"f5ec4c33278ae2fcdaad7d81e75a153328976dca4080fc7a2849d12920f94b3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:56:22.390914Z","signature_b64":"XOlPlZc2eBtKKImxhuNdNZhue7/4HaNKZ1NtUSrbZVUhtYpWUoTn03mo9oYwKpVOkAseSGWbG2mVeyXasGBEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5ec4c33278ae2fcdaad7d81e75a153328976dca4080fc7a2849d12920f94b3a","last_reissued_at":"2026-07-05T10:56:22.390501Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:56:22.390501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.21335","source_version":1,"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-05T10:56:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OVP3Cn9fMFU/WiQKUcBCOsUWwE0u7aewBwSWFo+aJ685smbBwTV5iqgaJ0WoeHY9IjgXc58zkCjCOWYEv3R0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:42:35.311972Z"},"content_sha256":"52e7c39c4599d1e339b1c53fd03503ef771cf54d8538957d0929caed85de55e9","schema_version":"1.0","event_id":"sha256:52e7c39c4599d1e339b1c53fd03503ef771cf54d8538957d0929caed85de55e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:6XWEYMZHRLRPZWVNPWA6OWQVGM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient hybrid variational quantum algorithm for solving graph coloring problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dongmei Liu, Jian Li, Lili Yan, Shibing Zhang, Xiubo Cheng, Yan Chang","submitted_at":"2025-04-30T05:45:15Z","abstract_excerpt":"In the era of Noisy Intermediate Scale Quantum (NISQ) computing, available quantum resources are limited. Many NP-hard problems can be efficiently addressed using hybrid classical and quantum computational methods. This paper proposes a hybrid variational quantum algorithm designed to solve the $k$-coloring problem of graph vertices. The hybrid classical and quantum algorithms primarily partition the graph into multiple subgraphs through hierarchical techniques. The Quantum Approximate Optimization Algorithm (QAOA) is employed to determine the coloring within the subgraphs, while a classical g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21335","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/2504.21335/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-05T10:56:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWwSi7plRfiGovdFdrPC/RGqPK1cPa9ZzGuYY9Iu3RpB53F5YjXqPPgTRjfCZ0MrK3bfX3fsYXFj+qKFvzl5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:42:35.312890Z"},"content_sha256":"12a93ae2a69d1047ed80a2d628c5ca15acbab71f8f871479abd41f0e54f098a7","schema_version":"1.0","event_id":"sha256:12a93ae2a69d1047ed80a2d628c5ca15acbab71f8f871479abd41f0e54f098a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6XWEYMZHRLRPZWVNPWA6OWQVGM/bundle.json","state_url":"https://pith.science/pith/6XWEYMZHRLRPZWVNPWA6OWQVGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6XWEYMZHRLRPZWVNPWA6OWQVGM/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-08-10T19:42:35Z","links":{"resolver":"https://pith.science/pith/6XWEYMZHRLRPZWVNPWA6OWQVGM","bundle":"https://pith.science/pith/6XWEYMZHRLRPZWVNPWA6OWQVGM/bundle.json","state":"https://pith.science/pith/6XWEYMZHRLRPZWVNPWA6OWQVGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6XWEYMZHRLRPZWVNPWA6OWQVGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6XWEYMZHRLRPZWVNPWA6OWQVGM","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":"dde47467ac46b4eaf56c997e13b6c04deb454004705424a324147898c0b4901a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-30T05:45:15Z","title_canon_sha256":"57e191cb0b32a163c7df72965d16dfda576a55440ebc64f9c30e11d8c5701887"},"schema_version":"1.0","source":{"id":"2504.21335","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.21335","created_at":"2026-07-05T10:56:22Z"},{"alias_kind":"arxiv_version","alias_value":"2504.21335v1","created_at":"2026-07-05T10:56:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21335","created_at":"2026-07-05T10:56:22Z"},{"alias_kind":"pith_short_12","alias_value":"6XWEYMZHRLRP","created_at":"2026-07-05T10:56:22Z"},{"alias_kind":"pith_short_16","alias_value":"6XWEYMZHRLRPZWVN","created_at":"2026-07-05T10:56:22Z"},{"alias_kind":"pith_short_8","alias_value":"6XWEYMZH","created_at":"2026-07-05T10:56:22Z"}],"graph_snapshots":[{"event_id":"sha256:12a93ae2a69d1047ed80a2d628c5ca15acbab71f8f871479abd41f0e54f098a7","target":"graph","created_at":"2026-07-05T10:56:22Z","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/2504.21335/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the era of Noisy Intermediate Scale Quantum (NISQ) computing, available quantum resources are limited. Many NP-hard problems can be efficiently addressed using hybrid classical and quantum computational methods. This paper proposes a hybrid variational quantum algorithm designed to solve the $k$-coloring problem of graph vertices. The hybrid classical and quantum algorithms primarily partition the graph into multiple subgraphs through hierarchical techniques. The Quantum Approximate Optimization Algorithm (QAOA) is employed to determine the coloring within the subgraphs, while a classical g","authors_text":"Dongmei Liu, Jian Li, Lili Yan, Shibing Zhang, Xiubo Cheng, Yan Chang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-30T05:45:15Z","title":"Efficient hybrid variational quantum algorithm for solving graph coloring problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21335","kind":"arxiv","version":1},"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:52e7c39c4599d1e339b1c53fd03503ef771cf54d8538957d0929caed85de55e9","target":"record","created_at":"2026-07-05T10:56:22Z","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":"dde47467ac46b4eaf56c997e13b6c04deb454004705424a324147898c0b4901a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-30T05:45:15Z","title_canon_sha256":"57e191cb0b32a163c7df72965d16dfda576a55440ebc64f9c30e11d8c5701887"},"schema_version":"1.0","source":{"id":"2504.21335","kind":"arxiv","version":1}},"canonical_sha256":"f5ec4c33278ae2fcdaad7d81e75a153328976dca4080fc7a2849d12920f94b3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5ec4c33278ae2fcdaad7d81e75a153328976dca4080fc7a2849d12920f94b3a","first_computed_at":"2026-07-05T10:56:22.390501Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:56:22.390501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XOlPlZc2eBtKKImxhuNdNZhue7/4HaNKZ1NtUSrbZVUhtYpWUoTn03mo9oYwKpVOkAseSGWbG2mVeyXasGBEDA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:56:22.390914Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.21335","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52e7c39c4599d1e339b1c53fd03503ef771cf54d8538957d0929caed85de55e9","sha256:12a93ae2a69d1047ed80a2d628c5ca15acbab71f8f871479abd41f0e54f098a7"],"state_sha256":"214940b758d56f6f681a61120643449c5cecba6ccf3fe479ea47ce4ac2481dff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cpj1GY3DIUKUeezAAVurEkaQX0lzP4gJATYKU5213iHCbZuBSur9JNRNfPbzvF6BHynQ7BDQjTIEAoDh+dFsDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T19:42:35.321356Z","bundle_sha256":"ce85fd2668fe99eff1976218dda68167f242e30f904ae153521de6710fc547b9"}}