{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ZXGQE7C5BWS7PSADWXEIROGRLV","short_pith_number":"pith:ZXGQE7C5","canonical_record":{"source":{"id":"2506.14250","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-17T07:11:48Z","cross_cats_sorted":[],"title_canon_sha256":"70717b85b2d6d5d00d9896085a106bf61d2788b4c4e48d5d9e6931fed6be50b4","abstract_canon_sha256":"8a7300f828d3c544ef93bdbcc2fb15555da19481d1e57a76720cd895b5d72ef0"},"schema_version":"1.0"},"canonical_sha256":"cdcd027c5d0da5f7c803b5c888b8d15d529feebb87b08161ee79c48c72947c81","source":{"kind":"arxiv","id":"2506.14250","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.14250","created_at":"2026-07-05T11:22:51Z"},{"alias_kind":"arxiv_version","alias_value":"2506.14250v1","created_at":"2026-07-05T11:22:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.14250","created_at":"2026-07-05T11:22:51Z"},{"alias_kind":"pith_short_12","alias_value":"ZXGQE7C5BWS7","created_at":"2026-07-05T11:22:51Z"},{"alias_kind":"pith_short_16","alias_value":"ZXGQE7C5BWS7PSAD","created_at":"2026-07-05T11:22:51Z"},{"alias_kind":"pith_short_8","alias_value":"ZXGQE7C5","created_at":"2026-07-05T11:22:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ZXGQE7C5BWS7PSADWXEIROGRLV","target":"record","payload":{"canonical_record":{"source":{"id":"2506.14250","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-17T07:11:48Z","cross_cats_sorted":[],"title_canon_sha256":"70717b85b2d6d5d00d9896085a106bf61d2788b4c4e48d5d9e6931fed6be50b4","abstract_canon_sha256":"8a7300f828d3c544ef93bdbcc2fb15555da19481d1e57a76720cd895b5d72ef0"},"schema_version":"1.0"},"canonical_sha256":"cdcd027c5d0da5f7c803b5c888b8d15d529feebb87b08161ee79c48c72947c81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:51.897228Z","signature_b64":"QHv77Ok8hQanq3wLpTVeYXH8zSpCp840Yn3p6QnhIFrepGkwYEXAIS7rk3LKmmcjosY+pgDgo/qqaGlTEMFgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdcd027c5d0da5f7c803b5c888b8d15d529feebb87b08161ee79c48c72947c81","last_reissued_at":"2026-07-05T11:22:51.896663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:51.896663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.14250","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-05T11:22:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rxmtx1LZ2IyLVhLFrvt6mKX14gSrpzflG4XpbQ7/mrgQl0uK2U6Ucay0mBtW4zZQKoMKD/+tva5YDaPY9NnVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T20:56:51.362643Z"},"content_sha256":"0c3f2163350f87a6502bcc2fe2b26ba770b0852d5e412b05e0f1369b8299ebcb","schema_version":"1.0","event_id":"sha256:0c3f2163350f87a6502bcc2fe2b26ba770b0852d5e412b05e0f1369b8299ebcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ZXGQE7C5BWS7PSADWXEIROGRLV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hoong Chuin LAU, Monit Sharma","submitted_at":"2025-06-17T07:11:48Z","abstract_excerpt":"A range of quantum algorithms, especially those leveraging variational parameterization and circuit-based optimization, are being studied as alternatives for solving classically intractable combinatorial optimization problems (COPs). However, their applicability is limited by hardware constraints, including shallow circuit depth, limited qubit counts, and noise. To mitigate these issues, we propose a hybrid classical--quantum framework based on graph shrinking to reduce the number of variables and constraints in QUBO formulations of COPs, while preserving problem structure.\n  Our approach intr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.14250","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/2506.14250/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-05T11:22:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aEw0kiFO8QqWxEblU5HhOpuXVsfkBSlVPJuLswBybkB3s6L6yyqCUNjmksRre91eXKvIcnyXO9541W7gYFJNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T20:56:51.363037Z"},"content_sha256":"859447fa72debd394bd72286b8f51750bb0c27f1d4383d4d4a458831aa584797","schema_version":"1.0","event_id":"sha256:859447fa72debd394bd72286b8f51750bb0c27f1d4383d4d4a458831aa584797"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXGQE7C5BWS7PSADWXEIROGRLV/bundle.json","state_url":"https://pith.science/pith/ZXGQE7C5BWS7PSADWXEIROGRLV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXGQE7C5BWS7PSADWXEIROGRLV/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-10T20:56:51Z","links":{"resolver":"https://pith.science/pith/ZXGQE7C5BWS7PSADWXEIROGRLV","bundle":"https://pith.science/pith/ZXGQE7C5BWS7PSADWXEIROGRLV/bundle.json","state":"https://pith.science/pith/ZXGQE7C5BWS7PSADWXEIROGRLV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXGQE7C5BWS7PSADWXEIROGRLV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZXGQE7C5BWS7PSADWXEIROGRLV","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":"8a7300f828d3c544ef93bdbcc2fb15555da19481d1e57a76720cd895b5d72ef0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-17T07:11:48Z","title_canon_sha256":"70717b85b2d6d5d00d9896085a106bf61d2788b4c4e48d5d9e6931fed6be50b4"},"schema_version":"1.0","source":{"id":"2506.14250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.14250","created_at":"2026-07-05T11:22:51Z"},{"alias_kind":"arxiv_version","alias_value":"2506.14250v1","created_at":"2026-07-05T11:22:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.14250","created_at":"2026-07-05T11:22:51Z"},{"alias_kind":"pith_short_12","alias_value":"ZXGQE7C5BWS7","created_at":"2026-07-05T11:22:51Z"},{"alias_kind":"pith_short_16","alias_value":"ZXGQE7C5BWS7PSAD","created_at":"2026-07-05T11:22:51Z"},{"alias_kind":"pith_short_8","alias_value":"ZXGQE7C5","created_at":"2026-07-05T11:22:51Z"}],"graph_snapshots":[{"event_id":"sha256:859447fa72debd394bd72286b8f51750bb0c27f1d4383d4d4a458831aa584797","target":"graph","created_at":"2026-07-05T11:22:51Z","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/2506.14250/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A range of quantum algorithms, especially those leveraging variational parameterization and circuit-based optimization, are being studied as alternatives for solving classically intractable combinatorial optimization problems (COPs). However, their applicability is limited by hardware constraints, including shallow circuit depth, limited qubit counts, and noise. To mitigate these issues, we propose a hybrid classical--quantum framework based on graph shrinking to reduce the number of variables and constraints in QUBO formulations of COPs, while preserving problem structure.\n  Our approach intr","authors_text":"Hoong Chuin LAU, Monit Sharma","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.14250","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:0c3f2163350f87a6502bcc2fe2b26ba770b0852d5e412b05e0f1369b8299ebcb","target":"record","created_at":"2026-07-05T11:22:51Z","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":"8a7300f828d3c544ef93bdbcc2fb15555da19481d1e57a76720cd895b5d72ef0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-17T07:11:48Z","title_canon_sha256":"70717b85b2d6d5d00d9896085a106bf61d2788b4c4e48d5d9e6931fed6be50b4"},"schema_version":"1.0","source":{"id":"2506.14250","kind":"arxiv","version":1}},"canonical_sha256":"cdcd027c5d0da5f7c803b5c888b8d15d529feebb87b08161ee79c48c72947c81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdcd027c5d0da5f7c803b5c888b8d15d529feebb87b08161ee79c48c72947c81","first_computed_at":"2026-07-05T11:22:51.896663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:22:51.896663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QHv77Ok8hQanq3wLpTVeYXH8zSpCp840Yn3p6QnhIFrepGkwYEXAIS7rk3LKmmcjosY+pgDgo/qqaGlTEMFgDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:22:51.897228Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.14250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c3f2163350f87a6502bcc2fe2b26ba770b0852d5e412b05e0f1369b8299ebcb","sha256:859447fa72debd394bd72286b8f51750bb0c27f1d4383d4d4a458831aa584797"],"state_sha256":"5d77b72af0c5f533f68490c43ac76c08c50a3aee1744a2ddcee5b69664b830c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zUsxJVzQL7lowTzco+CGMVuM2mnro6RdMtQkwunx+BvuVfOtOWtouTO6S0x6KsiG19vOTHdQERMSO3JtWJ3eBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T20:56:51.365194Z","bundle_sha256":"ca168ac2c0b78999ec210822f42f62cc8bbf35dd08defa2eaa02993b3970f00c"}}