{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XEJ4PGWCRFOQLO5UZJ45O3MM5S","short_pith_number":"pith:XEJ4PGWC","canonical_record":{"source":{"id":"1811.03657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-11-08T19:32:41Z","cross_cats_sorted":["cs.DC","cs.MA","cs.SY","math.OC"],"title_canon_sha256":"f3cdccaebc0f336527212af9ec6519df10695805d06c340e5914327fd57ed52b","abstract_canon_sha256":"d2a1fcc8e70de70f39503523123761101dc068ece131a7db79553723e76bc961"},"schema_version":"1.0"},"canonical_sha256":"b913c79ac2895d05bbb4ca79d76d8cecbfdce7243dc3e1f87aaf1156c48a1b6f","source":{"kind":"arxiv","id":"1811.03657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03657","created_at":"2026-06-04T20:13:40Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03657v1","created_at":"2026-06-04T20:13:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03657","created_at":"2026-06-04T20:13:40Z"},{"alias_kind":"pith_short_12","alias_value":"XEJ4PGWCRFOQ","created_at":"2026-06-04T20:13:40Z"},{"alias_kind":"pith_short_16","alias_value":"XEJ4PGWCRFOQLO5U","created_at":"2026-06-04T20:13:40Z"},{"alias_kind":"pith_short_8","alias_value":"XEJ4PGWC","created_at":"2026-06-04T20:13:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XEJ4PGWCRFOQLO5UZJ45O3MM5S","target":"record","payload":{"canonical_record":{"source":{"id":"1811.03657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-11-08T19:32:41Z","cross_cats_sorted":["cs.DC","cs.MA","cs.SY","math.OC"],"title_canon_sha256":"f3cdccaebc0f336527212af9ec6519df10695805d06c340e5914327fd57ed52b","abstract_canon_sha256":"d2a1fcc8e70de70f39503523123761101dc068ece131a7db79553723e76bc961"},"schema_version":"1.0"},"canonical_sha256":"b913c79ac2895d05bbb4ca79d76d8cecbfdce7243dc3e1f87aaf1156c48a1b6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:13:40.213398Z","signature_b64":"IBsM02c6OPAXqHswe16HRhqIr/EX3zjyLkemr0qJAiGioiGXHv7G8ntsMm8G0+aT/mb4fisCwbWzHlEOdPKHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b913c79ac2895d05bbb4ca79d76d8cecbfdce7243dc3e1f87aaf1156c48a1b6f","last_reissued_at":"2026-06-04T20:13:40.212772Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:13:40.212772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.03657","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-06-04T20:13:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFp3tQ+VVbiqRh9nDujmvwZWD9INel3JlBfs7w3DZ2ITFz7fa531aTmhtU22BMQqWyfR3LlPBNIB5QBKnw6sDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:17:14.536873Z"},"content_sha256":"5e613ce526e9febb11c9c13f7fab910f1372271cfdd7146fa3a4b6a327eb87c2","schema_version":"1.0","event_id":"sha256:5e613ce526e9febb11c9c13f7fab910f1372271cfdd7146fa3a4b6a327eb87c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XEJ4PGWCRFOQLO5UZJ45O3MM5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Primal Decomposition Method with Suboptimality Bounds for Distributed Mixed-Integer Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA","cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Andrea Camisa, Giuseppe Notarstefano, Ivano Notarnicola","submitted_at":"2018-11-08T19:32:41Z","abstract_excerpt":"In this paper we deal with a network of agents seeking to solve in a distributed way Mixed-Integer Linear Programs (MILPs) with a coupling constraint (modeling a limited shared resource) and local constraints. MILPs are NP-hard problems and several challenges arise in a distributed framework, so that looking for suboptimal solutions is of interest. To achieve this goal, the presence of a linear coupling calls for tailored decomposition approaches. We propose a fully distributed algorithm based on a primal decomposition approach and a suitable tightening of the coupling constraints. Agents repe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03657","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/1811.03657/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-06-04T20:13:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bruB+O/wHQU8jzYBW2lMTGRcBsZvDSCUbWnNfqAYqB4jFFJ/MHiZsOmR0y7TeXdL39u8CgEq6TGQMvgKMhpoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:17:14.537234Z"},"content_sha256":"c43fbec11de6a33cb60765a48180df6ae857adbbf4fe0d01de43f4037fca041b","schema_version":"1.0","event_id":"sha256:c43fbec11de6a33cb60765a48180df6ae857adbbf4fe0d01de43f4037fca041b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XEJ4PGWCRFOQLO5UZJ45O3MM5S/bundle.json","state_url":"https://pith.science/pith/XEJ4PGWCRFOQLO5UZJ45O3MM5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XEJ4PGWCRFOQLO5UZJ45O3MM5S/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-08T22:17:14Z","links":{"resolver":"https://pith.science/pith/XEJ4PGWCRFOQLO5UZJ45O3MM5S","bundle":"https://pith.science/pith/XEJ4PGWCRFOQLO5UZJ45O3MM5S/bundle.json","state":"https://pith.science/pith/XEJ4PGWCRFOQLO5UZJ45O3MM5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XEJ4PGWCRFOQLO5UZJ45O3MM5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XEJ4PGWCRFOQLO5UZJ45O3MM5S","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":"d2a1fcc8e70de70f39503523123761101dc068ece131a7db79553723e76bc961","cross_cats_sorted":["cs.DC","cs.MA","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-11-08T19:32:41Z","title_canon_sha256":"f3cdccaebc0f336527212af9ec6519df10695805d06c340e5914327fd57ed52b"},"schema_version":"1.0","source":{"id":"1811.03657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03657","created_at":"2026-06-04T20:13:40Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03657v1","created_at":"2026-06-04T20:13:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03657","created_at":"2026-06-04T20:13:40Z"},{"alias_kind":"pith_short_12","alias_value":"XEJ4PGWCRFOQ","created_at":"2026-06-04T20:13:40Z"},{"alias_kind":"pith_short_16","alias_value":"XEJ4PGWCRFOQLO5U","created_at":"2026-06-04T20:13:40Z"},{"alias_kind":"pith_short_8","alias_value":"XEJ4PGWC","created_at":"2026-06-04T20:13:40Z"}],"graph_snapshots":[{"event_id":"sha256:c43fbec11de6a33cb60765a48180df6ae857adbbf4fe0d01de43f4037fca041b","target":"graph","created_at":"2026-06-04T20:13:40Z","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/1811.03657/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we deal with a network of agents seeking to solve in a distributed way Mixed-Integer Linear Programs (MILPs) with a coupling constraint (modeling a limited shared resource) and local constraints. MILPs are NP-hard problems and several challenges arise in a distributed framework, so that looking for suboptimal solutions is of interest. To achieve this goal, the presence of a linear coupling calls for tailored decomposition approaches. We propose a fully distributed algorithm based on a primal decomposition approach and a suitable tightening of the coupling constraints. Agents repe","authors_text":"Andrea Camisa, Giuseppe Notarstefano, Ivano Notarnicola","cross_cats":["cs.DC","cs.MA","cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-11-08T19:32:41Z","title":"A Primal Decomposition Method with Suboptimality Bounds for Distributed Mixed-Integer Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03657","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:5e613ce526e9febb11c9c13f7fab910f1372271cfdd7146fa3a4b6a327eb87c2","target":"record","created_at":"2026-06-04T20:13:40Z","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":"d2a1fcc8e70de70f39503523123761101dc068ece131a7db79553723e76bc961","cross_cats_sorted":["cs.DC","cs.MA","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-11-08T19:32:41Z","title_canon_sha256":"f3cdccaebc0f336527212af9ec6519df10695805d06c340e5914327fd57ed52b"},"schema_version":"1.0","source":{"id":"1811.03657","kind":"arxiv","version":1}},"canonical_sha256":"b913c79ac2895d05bbb4ca79d76d8cecbfdce7243dc3e1f87aaf1156c48a1b6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b913c79ac2895d05bbb4ca79d76d8cecbfdce7243dc3e1f87aaf1156c48a1b6f","first_computed_at":"2026-06-04T20:13:40.212772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T20:13:40.212772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IBsM02c6OPAXqHswe16HRhqIr/EX3zjyLkemr0qJAiGioiGXHv7G8ntsMm8G0+aT/mb4fisCwbWzHlEOdPKHDQ==","signature_status":"signed_v1","signed_at":"2026-06-04T20:13:40.213398Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e613ce526e9febb11c9c13f7fab910f1372271cfdd7146fa3a4b6a327eb87c2","sha256:c43fbec11de6a33cb60765a48180df6ae857adbbf4fe0d01de43f4037fca041b"],"state_sha256":"06865aa3e638c0ce2aa221ad9c21e7ca621bffed311e92bfe287cc43f09e32be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQGQIxn3+HgHDJ/4cKXY92a/7/AtJDbvrMv4NoQ/9Om8JQD9SWnOrkdustmh5aoBz/vBPwCSlFUD01oiUfnJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:17:14.539280Z","bundle_sha256":"00373c75ee630603e0b46a5785ba681e3d22cb0ba1c13c18473a93aa9e5308d0"}}