{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3ZHFCGH2JGBRHOADHBV2Q3A5TM","short_pith_number":"pith:3ZHFCGH2","canonical_record":{"source":{"id":"1712.01621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-05T13:55:28Z","cross_cats_sorted":[],"title_canon_sha256":"e1436dc7472a2bff0b0f10f6677ace1f5bbeca63d68b7077f245ad6581af58cb","abstract_canon_sha256":"53fbdbcfba9b9ff497c4b1cc0f9af4dcb490e0595bcbbea1d80adccd1b36de31"},"schema_version":"1.0"},"canonical_sha256":"de4e5118fa498313b803386ba86c1d9b167c672f669e6cf0a72741fb43d89e9d","source":{"kind":"arxiv","id":"1712.01621","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01621","created_at":"2026-05-18T00:28:48Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01621v1","created_at":"2026-05-18T00:28:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01621","created_at":"2026-05-18T00:28:48Z"},{"alias_kind":"pith_short_12","alias_value":"3ZHFCGH2JGBR","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ZHFCGH2JGBRHOAD","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ZHFCGH2","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3ZHFCGH2JGBRHOADHBV2Q3A5TM","target":"record","payload":{"canonical_record":{"source":{"id":"1712.01621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-05T13:55:28Z","cross_cats_sorted":[],"title_canon_sha256":"e1436dc7472a2bff0b0f10f6677ace1f5bbeca63d68b7077f245ad6581af58cb","abstract_canon_sha256":"53fbdbcfba9b9ff497c4b1cc0f9af4dcb490e0595bcbbea1d80adccd1b36de31"},"schema_version":"1.0"},"canonical_sha256":"de4e5118fa498313b803386ba86c1d9b167c672f669e6cf0a72741fb43d89e9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:48.177419Z","signature_b64":"xGDzCIKdfiGocROTQY00fhoQAUwVuUJAUoOTT5huhEepLx6e4zNVfmOnF++5DlzxgxLJc9SIVsfmSfwRb7woDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de4e5118fa498313b803386ba86c1d9b167c672f669e6cf0a72741fb43d89e9d","last_reissued_at":"2026-05-18T00:28:48.176734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:48.176734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.01621","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-18T00:28:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPB4B+uSQexzj0W+moTALG5DPGU1zjOIMHD3nEyOlhcbpfuvsf3sVyXIBkbjHjE46Lzlurg39A4gI35o5hUZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:34:10.159200Z"},"content_sha256":"54cca381d22e8d4ee4d1721a305b9ec0fc974f4db929bd4433892dddc8bceed8","schema_version":"1.0","event_id":"sha256:54cca381d22e8d4ee4d1721a305b9ec0fc974f4db929bd4433892dddc8bceed8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3ZHFCGH2JGBRHOADHBV2Q3A5TM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Finite-Time Cutting Plane Algorithm for Distributed Mixed Integer Linear Programming","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":"2017-12-05T13:55:28Z","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 algorithm to solve this class of optimization problems in a peer-to-peer network with no coordinator and with limited computation and communication capabilities. In the proposed algorithm, at each communication round, agents solve locally a small LP, generate suitable cutting planes, namely intersection cuts and cost-based cuts, and communicate a fixed number of active constraints, i.e.,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01621","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":""},"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-18T00:28:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UK/hnW4cTX0yrRMGNlgRvDMDCyDEKXZZuFRi2fDu4RWwNIR9W3a+fcppYUk86HDKABEoU5S8sJvMqEpWgc8qCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:34:10.159589Z"},"content_sha256":"a42561b9533cddbcd65b2394036266e2e07ef96ec398cf930be73c2b5eb8afcf","schema_version":"1.0","event_id":"sha256:a42561b9533cddbcd65b2394036266e2e07ef96ec398cf930be73c2b5eb8afcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZHFCGH2JGBRHOADHBV2Q3A5TM/bundle.json","state_url":"https://pith.science/pith/3ZHFCGH2JGBRHOADHBV2Q3A5TM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZHFCGH2JGBRHOADHBV2Q3A5TM/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-04T06:34:10Z","links":{"resolver":"https://pith.science/pith/3ZHFCGH2JGBRHOADHBV2Q3A5TM","bundle":"https://pith.science/pith/3ZHFCGH2JGBRHOADHBV2Q3A5TM/bundle.json","state":"https://pith.science/pith/3ZHFCGH2JGBRHOADHBV2Q3A5TM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZHFCGH2JGBRHOADHBV2Q3A5TM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3ZHFCGH2JGBRHOADHBV2Q3A5TM","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":"53fbdbcfba9b9ff497c4b1cc0f9af4dcb490e0595bcbbea1d80adccd1b36de31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-05T13:55:28Z","title_canon_sha256":"e1436dc7472a2bff0b0f10f6677ace1f5bbeca63d68b7077f245ad6581af58cb"},"schema_version":"1.0","source":{"id":"1712.01621","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01621","created_at":"2026-05-18T00:28:48Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01621v1","created_at":"2026-05-18T00:28:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01621","created_at":"2026-05-18T00:28:48Z"},{"alias_kind":"pith_short_12","alias_value":"3ZHFCGH2JGBR","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ZHFCGH2JGBRHOAD","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ZHFCGH2","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:a42561b9533cddbcd65b2394036266e2e07ef96ec398cf930be73c2b5eb8afcf","target":"graph","created_at":"2026-05-18T00:28:48Z","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 algorithm to solve this class of optimization problems in a peer-to-peer network with no coordinator and with limited computation and communication capabilities. In the proposed algorithm, at each communication round, agents solve locally a small LP, generate suitable cutting planes, namely intersection cuts and cost-based cuts, and communicate a fixed number of active constraints, i.e.,","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":"2017-12-05T13:55:28Z","title":"A Finite-Time Cutting Plane Algorithm for Distributed Mixed Integer Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01621","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:54cca381d22e8d4ee4d1721a305b9ec0fc974f4db929bd4433892dddc8bceed8","target":"record","created_at":"2026-05-18T00:28:48Z","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":"53fbdbcfba9b9ff497c4b1cc0f9af4dcb490e0595bcbbea1d80adccd1b36de31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-05T13:55:28Z","title_canon_sha256":"e1436dc7472a2bff0b0f10f6677ace1f5bbeca63d68b7077f245ad6581af58cb"},"schema_version":"1.0","source":{"id":"1712.01621","kind":"arxiv","version":1}},"canonical_sha256":"de4e5118fa498313b803386ba86c1d9b167c672f669e6cf0a72741fb43d89e9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de4e5118fa498313b803386ba86c1d9b167c672f669e6cf0a72741fb43d89e9d","first_computed_at":"2026-05-18T00:28:48.176734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:48.176734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xGDzCIKdfiGocROTQY00fhoQAUwVuUJAUoOTT5huhEepLx6e4zNVfmOnF++5DlzxgxLJc9SIVsfmSfwRb7woDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:48.177419Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01621","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54cca381d22e8d4ee4d1721a305b9ec0fc974f4db929bd4433892dddc8bceed8","sha256:a42561b9533cddbcd65b2394036266e2e07ef96ec398cf930be73c2b5eb8afcf"],"state_sha256":"6f9fc91ce51d4b2f4153acc3a363f63d51961ff994bc8f6235322e3a84d160b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lEWSKv6f8S8eNrlI3wEGEk+PMMPTzUclcCPmXIFS7K+CtXmeaLejbKh3wcNBbXfE43TYfeckE5SRgLUO8AQpDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:34:10.161593Z","bundle_sha256":"502adf33eb242267b1e5ab7d8f4377656d610a7b387fc890584d0859d454cd0d"}}