{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GMFH3URPEJ2KMCGLVTU5QZ6DYT","short_pith_number":"pith:GMFH3URP","canonical_record":{"source":{"id":"2502.13947","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2025-02-19T18:42:50Z","cross_cats_sorted":[],"title_canon_sha256":"84a3ace7a98d0e6d1b21774bab976e7dc02830056da51801721011fd48f9e38f","abstract_canon_sha256":"bea5d98a1f729fe49bcd3ac24556d0549ffb0254d49a565f63351957e281543c"},"schema_version":"1.0"},"canonical_sha256":"330a7dd22f2274a608cbace9d867c3c4d43f5b83e5faf3ea062d92a5badd88a0","source":{"kind":"arxiv","id":"2502.13947","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.13947","created_at":"2026-07-05T10:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"2502.13947v1","created_at":"2026-07-05T10:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13947","created_at":"2026-07-05T10:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"GMFH3URPEJ2K","created_at":"2026-07-05T10:17:02Z"},{"alias_kind":"pith_short_16","alias_value":"GMFH3URPEJ2KMCGL","created_at":"2026-07-05T10:17:02Z"},{"alias_kind":"pith_short_8","alias_value":"GMFH3URP","created_at":"2026-07-05T10:17:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GMFH3URPEJ2KMCGLVTU5QZ6DYT","target":"record","payload":{"canonical_record":{"source":{"id":"2502.13947","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2025-02-19T18:42:50Z","cross_cats_sorted":[],"title_canon_sha256":"84a3ace7a98d0e6d1b21774bab976e7dc02830056da51801721011fd48f9e38f","abstract_canon_sha256":"bea5d98a1f729fe49bcd3ac24556d0549ffb0254d49a565f63351957e281543c"},"schema_version":"1.0"},"canonical_sha256":"330a7dd22f2274a608cbace9d867c3c4d43f5b83e5faf3ea062d92a5badd88a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:17:02.845447Z","signature_b64":"uuE7ehxuKP9Rc3EanZlJmRN6wG7PXmQeoSUfEIBQ/3+5m2jC1LkzyoU74I6vALnMzgsHaE2fxY9Orupvgp+lBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"330a7dd22f2274a608cbace9d867c3c4d43f5b83e5faf3ea062d92a5badd88a0","last_reissued_at":"2026-07-05T10:17:02.845032Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:17:02.845032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.13947","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:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBe8lmOe4TMJAneueiZxmAr0AdIv+wgTrOzMF+TtNrrP/4q4Qzmdvb7TpkRRXat/ctp+s0M5tjxMPHLZ8TRkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T16:43:08.434216Z"},"content_sha256":"25dbfcc6dd7f627277e2fb93eded27e932aea9b973368926fafac27ad7078b53","schema_version":"1.0","event_id":"sha256:25dbfcc6dd7f627277e2fb93eded27e932aea9b973368926fafac27ad7078b53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GMFH3URPEJ2KMCGLVTU5QZ6DYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"IC-D2S: A Hybrid Ising-Classical-Machines Data-Driven QUBO Solver Method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Armin Abdollahi, Massoud Pedram, Mehdi Kamal","submitted_at":"2025-02-19T18:42:50Z","abstract_excerpt":"We present a heuristic algorithm designed to solve Quadratic Unconstrained Binary Optimization (QUBO) problems efficiently. The algorithm, referred to as IC-D2S, leverages a hybrid approach using Ising and classical machines to address very large problem sizes. Considering the practical limitation on the size of the Ising machine(IM), our algorithm partitions the QUBO problem into a collection of QUBO subproblems (called subQUBOs) and utilizes the IM to solve each subQUBO. Our proposed heuristic algorithm uses a set of control parameters to generate the subQUBOs and explore the search space. A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13947","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/2502.13947/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:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"81//PopmL1oEbkLhFbZRN1eRoFQLCXX3x6ACZ8gJRVTtdgo+lR4OUpjG+wxl96z+vvL6tkOvRFDO/qb8SOhSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T16:43:08.434666Z"},"content_sha256":"3b4dbb058b4e7875f3dbd1e2d3d04f5f648f4a61d7bdee89600056a3523d04e8","schema_version":"1.0","event_id":"sha256:3b4dbb058b4e7875f3dbd1e2d3d04f5f648f4a61d7bdee89600056a3523d04e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMFH3URPEJ2KMCGLVTU5QZ6DYT/bundle.json","state_url":"https://pith.science/pith/GMFH3URPEJ2KMCGLVTU5QZ6DYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMFH3URPEJ2KMCGLVTU5QZ6DYT/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-31T16:43:08Z","links":{"resolver":"https://pith.science/pith/GMFH3URPEJ2KMCGLVTU5QZ6DYT","bundle":"https://pith.science/pith/GMFH3URPEJ2KMCGLVTU5QZ6DYT/bundle.json","state":"https://pith.science/pith/GMFH3URPEJ2KMCGLVTU5QZ6DYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMFH3URPEJ2KMCGLVTU5QZ6DYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GMFH3URPEJ2KMCGLVTU5QZ6DYT","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":"bea5d98a1f729fe49bcd3ac24556d0549ffb0254d49a565f63351957e281543c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2025-02-19T18:42:50Z","title_canon_sha256":"84a3ace7a98d0e6d1b21774bab976e7dc02830056da51801721011fd48f9e38f"},"schema_version":"1.0","source":{"id":"2502.13947","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.13947","created_at":"2026-07-05T10:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"2502.13947v1","created_at":"2026-07-05T10:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13947","created_at":"2026-07-05T10:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"GMFH3URPEJ2K","created_at":"2026-07-05T10:17:02Z"},{"alias_kind":"pith_short_16","alias_value":"GMFH3URPEJ2KMCGL","created_at":"2026-07-05T10:17:02Z"},{"alias_kind":"pith_short_8","alias_value":"GMFH3URP","created_at":"2026-07-05T10:17:02Z"}],"graph_snapshots":[{"event_id":"sha256:3b4dbb058b4e7875f3dbd1e2d3d04f5f648f4a61d7bdee89600056a3523d04e8","target":"graph","created_at":"2026-07-05T10:17:02Z","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/2502.13947/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a heuristic algorithm designed to solve Quadratic Unconstrained Binary Optimization (QUBO) problems efficiently. The algorithm, referred to as IC-D2S, leverages a hybrid approach using Ising and classical machines to address very large problem sizes. Considering the practical limitation on the size of the Ising machine(IM), our algorithm partitions the QUBO problem into a collection of QUBO subproblems (called subQUBOs) and utilizes the IM to solve each subQUBO. Our proposed heuristic algorithm uses a set of control parameters to generate the subQUBOs and explore the search space. A","authors_text":"Armin Abdollahi, Massoud Pedram, Mehdi Kamal","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2025-02-19T18:42:50Z","title":"IC-D2S: A Hybrid Ising-Classical-Machines Data-Driven QUBO Solver Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13947","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:25dbfcc6dd7f627277e2fb93eded27e932aea9b973368926fafac27ad7078b53","target":"record","created_at":"2026-07-05T10:17:02Z","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":"bea5d98a1f729fe49bcd3ac24556d0549ffb0254d49a565f63351957e281543c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2025-02-19T18:42:50Z","title_canon_sha256":"84a3ace7a98d0e6d1b21774bab976e7dc02830056da51801721011fd48f9e38f"},"schema_version":"1.0","source":{"id":"2502.13947","kind":"arxiv","version":1}},"canonical_sha256":"330a7dd22f2274a608cbace9d867c3c4d43f5b83e5faf3ea062d92a5badd88a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"330a7dd22f2274a608cbace9d867c3c4d43f5b83e5faf3ea062d92a5badd88a0","first_computed_at":"2026-07-05T10:17:02.845032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:17:02.845032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uuE7ehxuKP9Rc3EanZlJmRN6wG7PXmQeoSUfEIBQ/3+5m2jC1LkzyoU74I6vALnMzgsHaE2fxY9Orupvgp+lBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:17:02.845447Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.13947","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25dbfcc6dd7f627277e2fb93eded27e932aea9b973368926fafac27ad7078b53","sha256:3b4dbb058b4e7875f3dbd1e2d3d04f5f648f4a61d7bdee89600056a3523d04e8"],"state_sha256":"9401115191a9d943ec8cdd67ef4ebed1016cf576364d8db808655d1641f8c5b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xh1KZ0gidMTIbEmOroVYFmis8W+M3iSqBTGsDPV5IUPe35KAFLT4AhHOrNp/cG2rjGn2LH0zW6IWCrtoA6eVDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T16:43:08.440936Z","bundle_sha256":"f8e2e5cd6f4ba1110a69ab2d12f559b4201e555fb9e44cc536fd93ae72e1cdce"}}