{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XB56MLDSAWIMKDQULBKLBZ5SU5","short_pith_number":"pith:XB56MLDS","canonical_record":{"source":{"id":"2608.08694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-09T13:15:12Z","cross_cats_sorted":[],"title_canon_sha256":"70af712532fb89111a758f52ad026cfbfdbd2c49cf2da7ab5d5823680b90c520","abstract_canon_sha256":"dde9426767a2622d77fc002b17db1877c35dcfced07553a2bfa924c07ce86dfa"},"schema_version":"1.0"},"canonical_sha256":"b87be62c720590c50e145854b0e7b2a7658ed27a7a2d1cd0e6b7b0788ae5b40b","source":{"kind":"arxiv","id":"2608.08694","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.08694","created_at":"2026-08-11T01:25:03Z"},{"alias_kind":"arxiv_version","alias_value":"2608.08694v1","created_at":"2026-08-11T01:25:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08694","created_at":"2026-08-11T01:25:03Z"},{"alias_kind":"pith_short_12","alias_value":"XB56MLDSAWIM","created_at":"2026-08-11T01:25:03Z"},{"alias_kind":"pith_short_16","alias_value":"XB56MLDSAWIMKDQU","created_at":"2026-08-11T01:25:03Z"},{"alias_kind":"pith_short_8","alias_value":"XB56MLDS","created_at":"2026-08-11T01:25:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XB56MLDSAWIMKDQULBKLBZ5SU5","target":"record","payload":{"canonical_record":{"source":{"id":"2608.08694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-09T13:15:12Z","cross_cats_sorted":[],"title_canon_sha256":"70af712532fb89111a758f52ad026cfbfdbd2c49cf2da7ab5d5823680b90c520","abstract_canon_sha256":"dde9426767a2622d77fc002b17db1877c35dcfced07553a2bfa924c07ce86dfa"},"schema_version":"1.0"},"canonical_sha256":"b87be62c720590c50e145854b0e7b2a7658ed27a7a2d1cd0e6b7b0788ae5b40b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:25:03.460581Z","signature_b64":"9kt5q2jgHnlsYdUvBIgDIgDqwsJ85TFFOGcBFvA3eu/iUDMr2Tz7wO3zAZVG5og2SAz9OTFoiffmS8ABe2JbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b87be62c720590c50e145854b0e7b2a7658ed27a7a2d1cd0e6b7b0788ae5b40b","last_reissued_at":"2026-08-11T01:25:03.458127Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:25:03.458127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.08694","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-08-11T01:25:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YfdD/FzmNH+HOPFKCz12+7LhUi3A6zAVddWml5OxMjSB7Wy/hC4gofSGiY0pVut5LFFK7JtEueOJcILFPXVEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:13:32.688553Z"},"content_sha256":"78bab536a9e33598dbaaa724ac46c6e3f06971048010775110601c575b473dfc","schema_version":"1.0","event_id":"sha256:78bab536a9e33598dbaaa724ac46c6e3f06971048010775110601c575b473dfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XB56MLDSAWIMKDQULBKLBZ5SU5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Resource-Efficient Quantum Framework for Graph Coloring and Chromatic Number Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniele Dragoni, Francesco Turro","submitted_at":"2026-08-09T13:15:12Z","abstract_excerpt":"Many industrial optimization tasks can be modeled as graph coloring, where adjacent vertices must have different colors. This NP-hard problem is challenging for large graphs. We present a quantum encoding requiring qubits that scale logarithmically with the number of colors and linearly with vertices. Using adiabatic evolution with a novel mixer Hamiltonian and vertex terms, we compute the chromatic number and demonstrate robustness by solving constrained truck loading problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08694","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/2608.08694/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-08-11T01:25:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QTEwS8xoLKMjEtp0fWHpPmdZG1iml0BbpkvffCTe5VTSVoKJUwA4MlLzDguxnnaqYeAgU3d8K7/b//xcFupEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:13:32.689045Z"},"content_sha256":"4cf1fdd15c348078bdc7f142e84b6b7597a976bb817339a9d12fe41940a8b8d6","schema_version":"1.0","event_id":"sha256:4cf1fdd15c348078bdc7f142e84b6b7597a976bb817339a9d12fe41940a8b8d6"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:XB56MLDSAWIMKDQULBKLBZ5SU5","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1145/3341.3350 resolves to 'A generalized implicit enumeration algorithm for graph coloring'. A reader following the printed text alone cannot reach it.","snippet":"M. Kubale and B. Jackowski, “A generalized implicit enumeration algorithm for graph coloring,”Commun. ACM, vol. 28, no. 4, p. 412–418, Apr. 1985. [Online]. Available: https://doi.org/10.1145/3341. 3350","arxiv_id":"2608.08694","detector":"doi_compliance","evidence":{"ref_index":9,"verdict_class":"incontrovertible","resolved_title":"A generalized implicit enumeration algorithm for graph coloring","printed_excerpt":"10.1145/3341","reconstructed_doi":"10.1145/3341.3350"},"severity":"advisory","ref_index":9,"audited_at":"2026-08-14T05:08:28.792350Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/3341.3350","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"66ae585bc84863ecb2fea1ad3d9db05bd0e79653899634b3f95b96b7a19ffe6a","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"A generalized implicit enumeration algorithm for graph coloring","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19583,"payload_sha256":"3d4c5c70bb3bcf63a7656c3373cf67804053fddca728b9b57ea49c778f3ef083","signature_b64":"kGNkgLG+mkoaYwkz9yH4ZjvZYftjKrC0f7jOzKG6p8M4cvyShINF8WWrxeys1V+JqlDn0zQmg+SWLgbvo13xBA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-14T05:08:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M+brUkghJrK9Xh4+SynSw5lOqynI2S2AEhBlHLOF/lvX5R6ox0c8lLndrTsdl+FtT45oXMw7WYNYDwAGJTnoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:13:32.692384Z"},"content_sha256":"35ac91cd62e005a54230119d660a1f34a25da66912028e2c4f047e808912f10c","schema_version":"1.0","event_id":"sha256:35ac91cd62e005a54230119d660a1f34a25da66912028e2c4f047e808912f10c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XB56MLDSAWIMKDQULBKLBZ5SU5/bundle.json","state_url":"https://pith.science/pith/XB56MLDSAWIMKDQULBKLBZ5SU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XB56MLDSAWIMKDQULBKLBZ5SU5/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-16T09:13:32Z","links":{"resolver":"https://pith.science/pith/XB56MLDSAWIMKDQULBKLBZ5SU5","bundle":"https://pith.science/pith/XB56MLDSAWIMKDQULBKLBZ5SU5/bundle.json","state":"https://pith.science/pith/XB56MLDSAWIMKDQULBKLBZ5SU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XB56MLDSAWIMKDQULBKLBZ5SU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XB56MLDSAWIMKDQULBKLBZ5SU5","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dde9426767a2622d77fc002b17db1877c35dcfced07553a2bfa924c07ce86dfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-09T13:15:12Z","title_canon_sha256":"70af712532fb89111a758f52ad026cfbfdbd2c49cf2da7ab5d5823680b90c520"},"schema_version":"1.0","source":{"id":"2608.08694","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.08694","created_at":"2026-08-11T01:25:03Z"},{"alias_kind":"arxiv_version","alias_value":"2608.08694v1","created_at":"2026-08-11T01:25:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08694","created_at":"2026-08-11T01:25:03Z"},{"alias_kind":"pith_short_12","alias_value":"XB56MLDSAWIM","created_at":"2026-08-11T01:25:03Z"},{"alias_kind":"pith_short_16","alias_value":"XB56MLDSAWIMKDQU","created_at":"2026-08-11T01:25:03Z"},{"alias_kind":"pith_short_8","alias_value":"XB56MLDS","created_at":"2026-08-11T01:25:03Z"}],"graph_snapshots":[{"event_id":"sha256:4cf1fdd15c348078bdc7f142e84b6b7597a976bb817339a9d12fe41940a8b8d6","target":"graph","created_at":"2026-08-11T01:25:03Z","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/2608.08694/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many industrial optimization tasks can be modeled as graph coloring, where adjacent vertices must have different colors. This NP-hard problem is challenging for large graphs. We present a quantum encoding requiring qubits that scale logarithmically with the number of colors and linearly with vertices. Using adiabatic evolution with a novel mixer Hamiltonian and vertex terms, we compute the chromatic number and demonstrate robustness by solving constrained truck loading problems.","authors_text":"Daniele Dragoni, Francesco Turro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-09T13:15:12Z","title":"A Resource-Efficient Quantum Framework for Graph Coloring and Chromatic Number Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08694","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:78bab536a9e33598dbaaa724ac46c6e3f06971048010775110601c575b473dfc","target":"record","created_at":"2026-08-11T01:25:03Z","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":"dde9426767a2622d77fc002b17db1877c35dcfced07553a2bfa924c07ce86dfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-09T13:15:12Z","title_canon_sha256":"70af712532fb89111a758f52ad026cfbfdbd2c49cf2da7ab5d5823680b90c520"},"schema_version":"1.0","source":{"id":"2608.08694","kind":"arxiv","version":1}},"canonical_sha256":"b87be62c720590c50e145854b0e7b2a7658ed27a7a2d1cd0e6b7b0788ae5b40b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b87be62c720590c50e145854b0e7b2a7658ed27a7a2d1cd0e6b7b0788ae5b40b","first_computed_at":"2026-08-11T01:25:03.458127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-11T01:25:03.458127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9kt5q2jgHnlsYdUvBIgDIgDqwsJ85TFFOGcBFvA3eu/iUDMr2Tz7wO3zAZVG5og2SAz9OTFoiffmS8ABe2JbAw==","signature_status":"signed_v1","signed_at":"2026-08-11T01:25:03.460581Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.08694","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78bab536a9e33598dbaaa724ac46c6e3f06971048010775110601c575b473dfc","sha256:4cf1fdd15c348078bdc7f142e84b6b7597a976bb817339a9d12fe41940a8b8d6","sha256:35ac91cd62e005a54230119d660a1f34a25da66912028e2c4f047e808912f10c"],"state_sha256":"045d282d5f3d8a37f4dfd047d69596b42edb41049848a98899727bc2ee895993"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3+o5wvqzs18OwoXkp5PNmogh5bXF2U6wP7UKEXGAcoPVknkjX47pcZtmnIBz3oWtcytDdS9p2slFPL8l5dj0BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T09:13:32.694545Z","bundle_sha256":"1fef9ec8da5af01a64debbbe522781426e30d676828ea3d815723bbc252ddb9e"}}