{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KXAIKJCQ7YFO2DFWZJRZUVDVOF","short_pith_number":"pith:KXAIKJCQ","canonical_record":{"source":{"id":"2605.29366","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-28T05:09:21Z","cross_cats_sorted":[],"title_canon_sha256":"9825788311f556c7a2194e24285480a98c2cc77b15dfa29f49ab1e11dda1783e","abstract_canon_sha256":"18f4b912dcfb00a08f78b99d738fbb6c42b13d167b078414f32c1db18111b2cc"},"schema_version":"1.0"},"canonical_sha256":"55c0852450fe0aed0cb6ca639a54757170a81b2239d54376c1fc4af5fba7601d","source":{"kind":"arxiv","id":"2605.29366","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.29366","created_at":"2026-05-29T01:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"2605.29366v1","created_at":"2026-05-29T01:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29366","created_at":"2026-05-29T01:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"KXAIKJCQ7YFO","created_at":"2026-05-29T01:05:35Z"},{"alias_kind":"pith_short_16","alias_value":"KXAIKJCQ7YFO2DFW","created_at":"2026-05-29T01:05:35Z"},{"alias_kind":"pith_short_8","alias_value":"KXAIKJCQ","created_at":"2026-05-29T01:05:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KXAIKJCQ7YFO2DFWZJRZUVDVOF","target":"record","payload":{"canonical_record":{"source":{"id":"2605.29366","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-28T05:09:21Z","cross_cats_sorted":[],"title_canon_sha256":"9825788311f556c7a2194e24285480a98c2cc77b15dfa29f49ab1e11dda1783e","abstract_canon_sha256":"18f4b912dcfb00a08f78b99d738fbb6c42b13d167b078414f32c1db18111b2cc"},"schema_version":"1.0"},"canonical_sha256":"55c0852450fe0aed0cb6ca639a54757170a81b2239d54376c1fc4af5fba7601d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:35.578266Z","signature_b64":"oDWcwQVlAXEk96BqmNb1+3SWJ73/Fxn09p3tnpr1uU8tKi6ela6dBOtqItJV+dEIlMfUQGpPTnbFYGL7fiKXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55c0852450fe0aed0cb6ca639a54757170a81b2239d54376c1fc4af5fba7601d","last_reissued_at":"2026-05-29T01:05:35.577629Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:35.577629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.29366","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-05-29T01:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ca53X23Kgmwwc9X2typ7gnY5aif8Z4zsE2+8AfvxZIf8XLLblq1vnAerIAwaiKiL92FwCR0QEdSjgKaSf043CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:25:59.734169Z"},"content_sha256":"4cd7722a2ab7934af99d8506a920d8654ad7f5da4d5fc38c0d3953da0fc8abde","schema_version":"1.0","event_id":"sha256:4cd7722a2ab7934af99d8506a920d8654ad7f5da4d5fc38c0d3953da0fc8abde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KXAIKJCQ7YFO2DFWZJRZUVDVOF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Integer Linear Programming with Parallel Tempering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jinkyoo Park, Kyuil Sim, Sanghyeok Choi","submitted_at":"2026-05-28T05:09:21Z","abstract_excerpt":"Integer Linear Programming (ILP) serves as a versatile framework for modeling a wide range of combinatorial optimization problems, typically addressed by sophisticated exact solvers or heuristics. While learning-based approaches have recently shown their effectiveness, they suffer from poor generalization to out-of-distribution instances and inherent dependence on external solvers. In this work, we propose a solver-free, sampling-based optimization framework for ILP that directly explores discrete feasible regions without training or external solvers. Exploiting the linear structure of ILP, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29366","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/2605.29366/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-05-29T01:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2DITo8R9E0mLMz4W29zOedU63tHiaxm/VGTuxb4Nea0ty08TjtCbiCYKjEHvAJ6xwykHbpBoZri2qVADzhfTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:25:59.734991Z"},"content_sha256":"f09e6528cdb210562940051f3f6d936338478002104425809218ea594badd4c7","schema_version":"1.0","event_id":"sha256:f09e6528cdb210562940051f3f6d936338478002104425809218ea594badd4c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KXAIKJCQ7YFO2DFWZJRZUVDVOF/bundle.json","state_url":"https://pith.science/pith/KXAIKJCQ7YFO2DFWZJRZUVDVOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KXAIKJCQ7YFO2DFWZJRZUVDVOF/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-06-05T21:25:59Z","links":{"resolver":"https://pith.science/pith/KXAIKJCQ7YFO2DFWZJRZUVDVOF","bundle":"https://pith.science/pith/KXAIKJCQ7YFO2DFWZJRZUVDVOF/bundle.json","state":"https://pith.science/pith/KXAIKJCQ7YFO2DFWZJRZUVDVOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KXAIKJCQ7YFO2DFWZJRZUVDVOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KXAIKJCQ7YFO2DFWZJRZUVDVOF","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":"18f4b912dcfb00a08f78b99d738fbb6c42b13d167b078414f32c1db18111b2cc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-28T05:09:21Z","title_canon_sha256":"9825788311f556c7a2194e24285480a98c2cc77b15dfa29f49ab1e11dda1783e"},"schema_version":"1.0","source":{"id":"2605.29366","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.29366","created_at":"2026-05-29T01:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"2605.29366v1","created_at":"2026-05-29T01:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29366","created_at":"2026-05-29T01:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"KXAIKJCQ7YFO","created_at":"2026-05-29T01:05:35Z"},{"alias_kind":"pith_short_16","alias_value":"KXAIKJCQ7YFO2DFW","created_at":"2026-05-29T01:05:35Z"},{"alias_kind":"pith_short_8","alias_value":"KXAIKJCQ","created_at":"2026-05-29T01:05:35Z"}],"graph_snapshots":[{"event_id":"sha256:f09e6528cdb210562940051f3f6d936338478002104425809218ea594badd4c7","target":"graph","created_at":"2026-05-29T01:05:35Z","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/2605.29366/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Integer Linear Programming (ILP) serves as a versatile framework for modeling a wide range of combinatorial optimization problems, typically addressed by sophisticated exact solvers or heuristics. While learning-based approaches have recently shown their effectiveness, they suffer from poor generalization to out-of-distribution instances and inherent dependence on external solvers. In this work, we propose a solver-free, sampling-based optimization framework for ILP that directly explores discrete feasible regions without training or external solvers. Exploiting the linear structure of ILP, we","authors_text":"Jinkyoo Park, Kyuil Sim, Sanghyeok Choi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-28T05:09:21Z","title":"Solving Integer Linear Programming with Parallel Tempering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29366","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:4cd7722a2ab7934af99d8506a920d8654ad7f5da4d5fc38c0d3953da0fc8abde","target":"record","created_at":"2026-05-29T01:05:35Z","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":"18f4b912dcfb00a08f78b99d738fbb6c42b13d167b078414f32c1db18111b2cc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-28T05:09:21Z","title_canon_sha256":"9825788311f556c7a2194e24285480a98c2cc77b15dfa29f49ab1e11dda1783e"},"schema_version":"1.0","source":{"id":"2605.29366","kind":"arxiv","version":1}},"canonical_sha256":"55c0852450fe0aed0cb6ca639a54757170a81b2239d54376c1fc4af5fba7601d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55c0852450fe0aed0cb6ca639a54757170a81b2239d54376c1fc4af5fba7601d","first_computed_at":"2026-05-29T01:05:35.577629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T01:05:35.577629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oDWcwQVlAXEk96BqmNb1+3SWJ73/Fxn09p3tnpr1uU8tKi6ela6dBOtqItJV+dEIlMfUQGpPTnbFYGL7fiKXBg==","signature_status":"signed_v1","signed_at":"2026-05-29T01:05:35.578266Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.29366","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4cd7722a2ab7934af99d8506a920d8654ad7f5da4d5fc38c0d3953da0fc8abde","sha256:f09e6528cdb210562940051f3f6d936338478002104425809218ea594badd4c7"],"state_sha256":"3831180d76e379f1b3a4fd48d84002032cd70100ba558dc958b3d1b983a64818"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WZTGkt0pLJcpYLFWxMjjj5dVS6gB+dYg56JsKJH9TVCnCAn87A3RWrvY1gsA69U6XmsGexhd8f4gUqRs9SI9DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:25:59.738983Z","bundle_sha256":"b1deada5a8f19161b519a71397af3b8660d9d2a6fe0274681f0ff79ed00271d9"}}