{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ELSV5LCOUH5ARKSOLPPPKUYWP5","short_pith_number":"pith:ELSV5LCO","schema_version":"1.0","canonical_sha256":"22e55eac4ea1fa08aa4e5bdef553167f59449602f70715bddd59a369c32e2bcc","source":{"kind":"arxiv","id":"1812.05974","version":1},"attestation_state":"computed","paper":{"title":"Distributed Submodular Minimization over Networks: a Greedy Column Generation Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA","math.OC"],"primary_cat":"cs.SY","authors_text":"Andrea Testa, Giuseppe Notarstefano, Ivano Notarnicola","submitted_at":"2018-12-14T15:11:23Z","abstract_excerpt":"Submodular optimization is a special class of combinatorial optimization arising in several machine learning problems, but also in cooperative control of complex systems. In this paper, we consider agents in an asynchronous, unreliable and time-varying directed network that aim at cooperatively solving submodular minimization problems in a fully distributed way. The challenge is that the (submodular) objective set-function is only partially known by agents, that is, each one is able to evaluate the function only for subsets including itself. We propose a distributed algorithm based on a proper"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1812.05974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-12-14T15:11:23Z","cross_cats_sorted":["cs.DC","cs.MA","math.OC"],"title_canon_sha256":"51772a7b12cd40f888489d2d1653387bdcb89b5cd140ee6a9ab1f967e5e19167","abstract_canon_sha256":"3202586bbdd3e13e1e8c9904bddd20810dc844e6447eda70c4980b57f2b3bca9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:17.653868Z","signature_b64":"Thj+pHHZb+HL9bEvy0Ca8mZp9yhofExQhq9wA/+wthtVTcFCGrYqN/9/mHFNOv//RoTg1bn+dEYlwiOCoJipDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22e55eac4ea1fa08aa4e5bdef553167f59449602f70715bddd59a369c32e2bcc","last_reissued_at":"2026-05-17T23:58:17.653345Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:17.653345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Submodular Minimization over Networks: a Greedy Column Generation Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA","math.OC"],"primary_cat":"cs.SY","authors_text":"Andrea Testa, Giuseppe Notarstefano, Ivano Notarnicola","submitted_at":"2018-12-14T15:11:23Z","abstract_excerpt":"Submodular optimization is a special class of combinatorial optimization arising in several machine learning problems, but also in cooperative control of complex systems. In this paper, we consider agents in an asynchronous, unreliable and time-varying directed network that aim at cooperatively solving submodular minimization problems in a fully distributed way. The challenge is that the (submodular) objective set-function is only partially known by agents, that is, each one is able to evaluate the function only for subsets including itself. We propose a distributed algorithm based on a proper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05974","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.05974","created_at":"2026-05-17T23:58:17.653422+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05974v1","created_at":"2026-05-17T23:58:17.653422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05974","created_at":"2026-05-17T23:58:17.653422+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELSV5LCOUH5A","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELSV5LCOUH5ARKSO","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELSV5LCO","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ELSV5LCOUH5ARKSOLPPPKUYWP5","json":"https://pith.science/pith/ELSV5LCOUH5ARKSOLPPPKUYWP5.json","graph_json":"https://pith.science/api/pith-number/ELSV5LCOUH5ARKSOLPPPKUYWP5/graph.json","events_json":"https://pith.science/api/pith-number/ELSV5LCOUH5ARKSOLPPPKUYWP5/events.json","paper":"https://pith.science/paper/ELSV5LCO"},"agent_actions":{"view_html":"https://pith.science/pith/ELSV5LCOUH5ARKSOLPPPKUYWP5","download_json":"https://pith.science/pith/ELSV5LCOUH5ARKSOLPPPKUYWP5.json","view_paper":"https://pith.science/paper/ELSV5LCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05974&json=true","fetch_graph":"https://pith.science/api/pith-number/ELSV5LCOUH5ARKSOLPPPKUYWP5/graph.json","fetch_events":"https://pith.science/api/pith-number/ELSV5LCOUH5ARKSOLPPPKUYWP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELSV5LCOUH5ARKSOLPPPKUYWP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELSV5LCOUH5ARKSOLPPPKUYWP5/action/storage_attestation","attest_author":"https://pith.science/pith/ELSV5LCOUH5ARKSOLPPPKUYWP5/action/author_attestation","sign_citation":"https://pith.science/pith/ELSV5LCOUH5ARKSOLPPPKUYWP5/action/citation_signature","submit_replication":"https://pith.science/pith/ELSV5LCOUH5ARKSOLPPPKUYWP5/action/replication_record"}},"created_at":"2026-05-17T23:58:17.653422+00:00","updated_at":"2026-05-17T23:58:17.653422+00:00"}