{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RXUULR7PXN57US4NG3MLS5ZAX6","short_pith_number":"pith:RXUULR7P","canonical_record":{"source":{"id":"1804.03391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-10T08:22:42Z","cross_cats_sorted":[],"title_canon_sha256":"92952f5f7c675b4ddc1454bc8b0dd728110f54eaafc816d75a23c1fa77b67859","abstract_canon_sha256":"048319bc48e5d06b95d75b21668aa078b7a74ced4dc758b2ac4a22574509af14"},"schema_version":"1.0"},"canonical_sha256":"8de945c7efbb7bfa4b8d36d8b97720bfb69bbb76e7bceee67001fdc29fea1e42","source":{"kind":"arxiv","id":"1804.03391","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03391","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03391v2","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03391","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"RXUULR7PXN57","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RXUULR7PXN57US4N","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RXUULR7P","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RXUULR7PXN57US4NG3MLS5ZAX6","target":"record","payload":{"canonical_record":{"source":{"id":"1804.03391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-10T08:22:42Z","cross_cats_sorted":[],"title_canon_sha256":"92952f5f7c675b4ddc1454bc8b0dd728110f54eaafc816d75a23c1fa77b67859","abstract_canon_sha256":"048319bc48e5d06b95d75b21668aa078b7a74ced4dc758b2ac4a22574509af14"},"schema_version":"1.0"},"canonical_sha256":"8de945c7efbb7bfa4b8d36d8b97720bfb69bbb76e7bceee67001fdc29fea1e42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:22.678545Z","signature_b64":"exkUccc6bqQUVKEZAZdnDC3f9U7kz9pIKmiVgUuNxsidEyrGzmCNVyoOWELPVkvFNNVklwY47pZQbZetI4n2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8de945c7efbb7bfa4b8d36d8b97720bfb69bbb76e7bceee67001fdc29fea1e42","last_reissued_at":"2026-05-17T23:44:22.677925Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:22.677925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.03391","source_version":2,"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-17T23:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcpo4NEnIZ61XJs1d36AD4USO3Nc5WK3cVK/NudvzPnJikiCPM5xQ4NkHPdxuC1XG7XOth8jGI9QRDFryUabDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:25:55.914770Z"},"content_sha256":"6babc81c6a4aba11b94a9034bca5b925a05ab5a7d19049df9623096f276da6e9","schema_version":"1.0","event_id":"sha256:6babc81c6a4aba11b94a9034bca5b925a05ab5a7d19049df9623096f276da6e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RXUULR7PXN57US4NG3MLS5ZAX6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Mixed-Integer Linear Programming via Cut Generation and Constraint Exchange","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alessandro Rucco, Andrea Testa, Giuseppe Notarstefano","submitted_at":"2018-04-10T08:22:42Z","abstract_excerpt":"Many problems of interest for cyber-physical network systems can be formulated as Mixed-Integer Linear Programs in which the constraints are distributed among the agents. In this paper we propose a distributed algorithmic framework to solve this class of optimization problems in a peer-to-peer network with no coordinator and with limited computation and communication capabilities. At each communication round, agents locally solve a small linear program, generate suitable cutting planes and communicate a fixed number of active constraints. Within the distributed framework, we first propose an a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03391","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-17T23:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U4lNLq4FPqvX6VQrksjuzp1YpRBevp7JJvRwcmZjKFkp7jLwvT35D4PAMYGGCNZePWQcC6+MBDLVpufS3UIXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:25:55.915137Z"},"content_sha256":"2c44685460137f764f74d021dde9df87a864a06a52bee34db58af6e9a18d05fc","schema_version":"1.0","event_id":"sha256:2c44685460137f764f74d021dde9df87a864a06a52bee34db58af6e9a18d05fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXUULR7PXN57US4NG3MLS5ZAX6/bundle.json","state_url":"https://pith.science/pith/RXUULR7PXN57US4NG3MLS5ZAX6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXUULR7PXN57US4NG3MLS5ZAX6/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-04T01:25:55Z","links":{"resolver":"https://pith.science/pith/RXUULR7PXN57US4NG3MLS5ZAX6","bundle":"https://pith.science/pith/RXUULR7PXN57US4NG3MLS5ZAX6/bundle.json","state":"https://pith.science/pith/RXUULR7PXN57US4NG3MLS5ZAX6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXUULR7PXN57US4NG3MLS5ZAX6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RXUULR7PXN57US4NG3MLS5ZAX6","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":"048319bc48e5d06b95d75b21668aa078b7a74ced4dc758b2ac4a22574509af14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-10T08:22:42Z","title_canon_sha256":"92952f5f7c675b4ddc1454bc8b0dd728110f54eaafc816d75a23c1fa77b67859"},"schema_version":"1.0","source":{"id":"1804.03391","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03391","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03391v2","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03391","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"RXUULR7PXN57","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RXUULR7PXN57US4N","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RXUULR7P","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:2c44685460137f764f74d021dde9df87a864a06a52bee34db58af6e9a18d05fc","target":"graph","created_at":"2026-05-17T23:44:22Z","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"},"paper":{"abstract_excerpt":"Many problems of interest for cyber-physical network systems can be formulated as Mixed-Integer Linear Programs in which the constraints are distributed among the agents. In this paper we propose a distributed algorithmic framework to solve this class of optimization problems in a peer-to-peer network with no coordinator and with limited computation and communication capabilities. At each communication round, agents locally solve a small linear program, generate suitable cutting planes and communicate a fixed number of active constraints. Within the distributed framework, we first propose an a","authors_text":"Alessandro Rucco, Andrea Testa, Giuseppe Notarstefano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-10T08:22:42Z","title":"Distributed Mixed-Integer Linear Programming via Cut Generation and Constraint Exchange"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03391","kind":"arxiv","version":2},"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:6babc81c6a4aba11b94a9034bca5b925a05ab5a7d19049df9623096f276da6e9","target":"record","created_at":"2026-05-17T23:44:22Z","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":"048319bc48e5d06b95d75b21668aa078b7a74ced4dc758b2ac4a22574509af14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-10T08:22:42Z","title_canon_sha256":"92952f5f7c675b4ddc1454bc8b0dd728110f54eaafc816d75a23c1fa77b67859"},"schema_version":"1.0","source":{"id":"1804.03391","kind":"arxiv","version":2}},"canonical_sha256":"8de945c7efbb7bfa4b8d36d8b97720bfb69bbb76e7bceee67001fdc29fea1e42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8de945c7efbb7bfa4b8d36d8b97720bfb69bbb76e7bceee67001fdc29fea1e42","first_computed_at":"2026-05-17T23:44:22.677925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:22.677925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"exkUccc6bqQUVKEZAZdnDC3f9U7kz9pIKmiVgUuNxsidEyrGzmCNVyoOWELPVkvFNNVklwY47pZQbZetI4n2BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:22.678545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03391","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6babc81c6a4aba11b94a9034bca5b925a05ab5a7d19049df9623096f276da6e9","sha256:2c44685460137f764f74d021dde9df87a864a06a52bee34db58af6e9a18d05fc"],"state_sha256":"85133f83fcc5948a7ad424de781c5ab9017e4f5f56385fcb95ed40fc32bd8542"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nlAxl/BN0FassAEcpOJlJm0O53hyEXxNMTd2/60jC+wi4HnaOtgksLV0bWEGX7Rrtzzjdxj9NHrHA+L6HodqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:25:55.917180Z","bundle_sha256":"2dbced755b279708cb21b0f6d0acb975b4a4c7d3d19b107112d7aaab9e5962f3"}}