{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WBEI6OSQSXEIK4A7DB4TACBXPF","short_pith_number":"pith:WBEI6OSQ","canonical_record":{"source":{"id":"2406.01887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2024-06-04T01:41:42Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ca070ef649a766b3cbc83cbc97954a16a06948824e732185a9deaf9d6fdee3bb","abstract_canon_sha256":"a06a8d40203bf7b0f58d44ea0efc7c985869c31196cb5c42eb58ff057f18fc9c"},"schema_version":"1.0"},"canonical_sha256":"b0488f3a5095c885701f18793008377962504bc140d80d5d37ad818dfbe842b6","source":{"kind":"arxiv","id":"2406.01887","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.01887","created_at":"2026-07-05T09:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"2406.01887v1","created_at":"2026-07-05T09:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.01887","created_at":"2026-07-05T09:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"WBEI6OSQSXEI","created_at":"2026-07-05T09:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"WBEI6OSQSXEIK4A7","created_at":"2026-07-05T09:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"WBEI6OSQ","created_at":"2026-07-05T09:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WBEI6OSQSXEIK4A7DB4TACBXPF","target":"record","payload":{"canonical_record":{"source":{"id":"2406.01887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2024-06-04T01:41:42Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ca070ef649a766b3cbc83cbc97954a16a06948824e732185a9deaf9d6fdee3bb","abstract_canon_sha256":"a06a8d40203bf7b0f58d44ea0efc7c985869c31196cb5c42eb58ff057f18fc9c"},"schema_version":"1.0"},"canonical_sha256":"b0488f3a5095c885701f18793008377962504bc140d80d5d37ad818dfbe842b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:30:15.833909Z","signature_b64":"0V8AbYZ1l2rcMZ9ZHq/nqzKKIrrXoLkKYkC7FwGogJJWaOjtOBl/8aSBr+SbWw4W1qGjKY7cUrrbyzHox4rCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0488f3a5095c885701f18793008377962504bc140d80d5d37ad818dfbe842b6","last_reissued_at":"2026-07-05T09:30:15.833422Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:30:15.833422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.01887","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-05T09:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+lauRnLOVOYPsq/g4qXGgB4McBmrSYPL49tnvPfoyLJmpWrxjNtvlB944flojG5S5LV5rceSrGHlc0VN+pMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-20T08:30:48.886035Z"},"content_sha256":"9c5df9b773e704c60dcdf79e723680b51332f431eb627623921c5178e6f0bc2a","schema_version":"1.0","event_id":"sha256:9c5df9b773e704c60dcdf79e723680b51332f431eb627623921c5178e6f0bc2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WBEI6OSQSXEIK4A7DB4TACBXPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Annealing-Assisted Column Generation for Inequality-Constrained Combinatorial Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cond-mat.stat-mech","authors_text":"Hiroshi Kanai, Kotaro Tanahashi, Masashi Yamashita, Shu Tanaka","submitted_at":"2024-06-04T01:41:42Z","abstract_excerpt":"Ising machines are expected to solve combinatorial optimization problems faster than the existing integer programming solvers. These problems, particularly those encountered in practical situations, typically involve inequality constraints. However, owing to the hardware limitations of the current Ising machines, solving combinatorial optimization problems with inequality constraints remains challenging. The Capacitated Vehicle Routing Problem (CVRP) is a typical example of a problem with inequality constraints. The objective function of the CVRP is to minimize the total distance traveled by e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.01887","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/2406.01887/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-05T09:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uz5XDzzZvug0W5vl37IanV2exFP4agGCgYvxqv1fTXhhb3hmSorphoWFMU1dzVTlkhmznBuc0HwYPHb2rlr5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-20T08:30:48.886431Z"},"content_sha256":"c4541febf78c185c55a23e51ca3d7225131c40a9fa1d2860cf18bdac9bc6ce7d","schema_version":"1.0","event_id":"sha256:c4541febf78c185c55a23e51ca3d7225131c40a9fa1d2860cf18bdac9bc6ce7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBEI6OSQSXEIK4A7DB4TACBXPF/bundle.json","state_url":"https://pith.science/pith/WBEI6OSQSXEIK4A7DB4TACBXPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBEI6OSQSXEIK4A7DB4TACBXPF/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-20T08:30:48Z","links":{"resolver":"https://pith.science/pith/WBEI6OSQSXEIK4A7DB4TACBXPF","bundle":"https://pith.science/pith/WBEI6OSQSXEIK4A7DB4TACBXPF/bundle.json","state":"https://pith.science/pith/WBEI6OSQSXEIK4A7DB4TACBXPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBEI6OSQSXEIK4A7DB4TACBXPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WBEI6OSQSXEIK4A7DB4TACBXPF","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":"a06a8d40203bf7b0f58d44ea0efc7c985869c31196cb5c42eb58ff057f18fc9c","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2024-06-04T01:41:42Z","title_canon_sha256":"ca070ef649a766b3cbc83cbc97954a16a06948824e732185a9deaf9d6fdee3bb"},"schema_version":"1.0","source":{"id":"2406.01887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.01887","created_at":"2026-07-05T09:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"2406.01887v1","created_at":"2026-07-05T09:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.01887","created_at":"2026-07-05T09:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"WBEI6OSQSXEI","created_at":"2026-07-05T09:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"WBEI6OSQSXEIK4A7","created_at":"2026-07-05T09:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"WBEI6OSQ","created_at":"2026-07-05T09:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:c4541febf78c185c55a23e51ca3d7225131c40a9fa1d2860cf18bdac9bc6ce7d","target":"graph","created_at":"2026-07-05T09:30:15Z","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/2406.01887/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ising machines are expected to solve combinatorial optimization problems faster than the existing integer programming solvers. These problems, particularly those encountered in practical situations, typically involve inequality constraints. However, owing to the hardware limitations of the current Ising machines, solving combinatorial optimization problems with inequality constraints remains challenging. The Capacitated Vehicle Routing Problem (CVRP) is a typical example of a problem with inequality constraints. The objective function of the CVRP is to minimize the total distance traveled by e","authors_text":"Hiroshi Kanai, Kotaro Tanahashi, Masashi Yamashita, Shu Tanaka","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2024-06-04T01:41:42Z","title":"Annealing-Assisted Column Generation for Inequality-Constrained Combinatorial Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.01887","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:9c5df9b773e704c60dcdf79e723680b51332f431eb627623921c5178e6f0bc2a","target":"record","created_at":"2026-07-05T09:30:15Z","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":"a06a8d40203bf7b0f58d44ea0efc7c985869c31196cb5c42eb58ff057f18fc9c","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2024-06-04T01:41:42Z","title_canon_sha256":"ca070ef649a766b3cbc83cbc97954a16a06948824e732185a9deaf9d6fdee3bb"},"schema_version":"1.0","source":{"id":"2406.01887","kind":"arxiv","version":1}},"canonical_sha256":"b0488f3a5095c885701f18793008377962504bc140d80d5d37ad818dfbe842b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0488f3a5095c885701f18793008377962504bc140d80d5d37ad818dfbe842b6","first_computed_at":"2026-07-05T09:30:15.833422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:30:15.833422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0V8AbYZ1l2rcMZ9ZHq/nqzKKIrrXoLkKYkC7FwGogJJWaOjtOBl/8aSBr+SbWw4W1qGjKY7cUrrbyzHox4rCBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:30:15.833909Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.01887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c5df9b773e704c60dcdf79e723680b51332f431eb627623921c5178e6f0bc2a","sha256:c4541febf78c185c55a23e51ca3d7225131c40a9fa1d2860cf18bdac9bc6ce7d"],"state_sha256":"d6c96b6a2ef48b3c2c08e2608c9fdd7a0914810790eec07d19d215cd9c4cb354"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kzs58x2PxrvjBhmbhnq5OtNXBPOYLXWSe/tkBONCGLQbjwFEMaVjQVBVnebejE7gafH1FYrFaRCgEowgxNdqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-20T08:30:48.889091Z","bundle_sha256":"a2048beb4c29c5bb4cdda19f0031765f694f6dbe0a69707881d9929249888659"}}