{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RQB5SZWW4JQHSBBV4ZSMSEKUEW","short_pith_number":"pith:RQB5SZWW","canonical_record":{"source":{"id":"1709.07379","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-21T15:36:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"da5acafa2e382ea46a0c1a4f1e44f027d8aceafb48a5aca24a3b38fb371d05f8","abstract_canon_sha256":"cc3110916759c6c3e0c54ab339e1cc7d715242c7d174be03d6381c4167ce639a"},"schema_version":"1.0"},"canonical_sha256":"8c03d966d6e260790435e664c9115425b896e207f6e48843d059171ec3a24198","source":{"kind":"arxiv","id":"1709.07379","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07379","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07379v3","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07379","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"pith_short_12","alias_value":"RQB5SZWW4JQH","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RQB5SZWW4JQHSBBV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RQB5SZWW","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RQB5SZWW4JQHSBBV4ZSMSEKUEW","target":"record","payload":{"canonical_record":{"source":{"id":"1709.07379","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-21T15:36:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"da5acafa2e382ea46a0c1a4f1e44f027d8aceafb48a5aca24a3b38fb371d05f8","abstract_canon_sha256":"cc3110916759c6c3e0c54ab339e1cc7d715242c7d174be03d6381c4167ce639a"},"schema_version":"1.0"},"canonical_sha256":"8c03d966d6e260790435e664c9115425b896e207f6e48843d059171ec3a24198","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:28.805445Z","signature_b64":"W7ViSLaf25C2fUC1bZflUi1Ln8WEh3E7Y/856sZGEyhXtodwi3te6dvXTVs5KHl1BKFdupgk7QPRBeP6XDZBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c03d966d6e260790435e664c9115425b896e207f6e48843d059171ec3a24198","last_reissued_at":"2026-05-18T00:25:28.804861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:28.804861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.07379","source_version":3,"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:25:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s/LOFlp7ygX2DFeJ9FWTpI29kN6bDGEy7EwDK3NjtJchwLVNmvlcw+s5Wq6fjJqWSFzEYsd8LFD+lfUQmTvjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:06:00.113172Z"},"content_sha256":"6234ee48d43b8489e8d8e6c73d32e2af15221c63105bd0886b27ee0ea68c94c5","schema_version":"1.0","event_id":"sha256:6234ee48d43b8489e8d8e6c73d32e2af15221c63105bd0886b27ee0ea68c94c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RQB5SZWW4JQHSBBV4ZSMSEKUEW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Submodular Minimization And Motion Coordination Over Discrete State Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Hassan Jaleel, Jeff Shamma","submitted_at":"2017-09-21T15:36:11Z","abstract_excerpt":"We develop a framework for the distributed minimization of submodular functions. Submodular functions are a discrete analog of convex functions and are extensively used in large-scale combinatorial optimization problems. While there has been significant interest in the distributed formulations of convex optimization problems, distributed minimization of submodular functions has received relatively little research attention. Our framework relies on an equivalent convex reformulation of a submodular minimization problem, which is efficiently computable. We then use this relaxation to exploit met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07379","kind":"arxiv","version":3},"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:25:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPzHU2Odqq+wK8KzfD6gM17vXreyXn9muB2hYJ9JwCycJh77Z5XCia4KNR/yU0YHG3pfDr7YdpMoWLu/g9jhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:06:00.113894Z"},"content_sha256":"8e005e82a143ec7e5ef9c9f08d0267de85b150d77c303f24122c9750518b1990","schema_version":"1.0","event_id":"sha256:8e005e82a143ec7e5ef9c9f08d0267de85b150d77c303f24122c9750518b1990"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQB5SZWW4JQHSBBV4ZSMSEKUEW/bundle.json","state_url":"https://pith.science/pith/RQB5SZWW4JQHSBBV4ZSMSEKUEW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQB5SZWW4JQHSBBV4ZSMSEKUEW/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-09T05:06:00Z","links":{"resolver":"https://pith.science/pith/RQB5SZWW4JQHSBBV4ZSMSEKUEW","bundle":"https://pith.science/pith/RQB5SZWW4JQHSBBV4ZSMSEKUEW/bundle.json","state":"https://pith.science/pith/RQB5SZWW4JQHSBBV4ZSMSEKUEW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQB5SZWW4JQHSBBV4ZSMSEKUEW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RQB5SZWW4JQHSBBV4ZSMSEKUEW","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":"cc3110916759c6c3e0c54ab339e1cc7d715242c7d174be03d6381c4167ce639a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-21T15:36:11Z","title_canon_sha256":"da5acafa2e382ea46a0c1a4f1e44f027d8aceafb48a5aca24a3b38fb371d05f8"},"schema_version":"1.0","source":{"id":"1709.07379","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07379","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07379v3","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07379","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"pith_short_12","alias_value":"RQB5SZWW4JQH","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RQB5SZWW4JQHSBBV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RQB5SZWW","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:8e005e82a143ec7e5ef9c9f08d0267de85b150d77c303f24122c9750518b1990","target":"graph","created_at":"2026-05-18T00:25:28Z","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":"We develop a framework for the distributed minimization of submodular functions. Submodular functions are a discrete analog of convex functions and are extensively used in large-scale combinatorial optimization problems. While there has been significant interest in the distributed formulations of convex optimization problems, distributed minimization of submodular functions has received relatively little research attention. Our framework relies on an equivalent convex reformulation of a submodular minimization problem, which is efficiently computable. We then use this relaxation to exploit met","authors_text":"Hassan Jaleel, Jeff Shamma","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-21T15:36:11Z","title":"Distributed Submodular Minimization And Motion Coordination Over Discrete State Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07379","kind":"arxiv","version":3},"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:6234ee48d43b8489e8d8e6c73d32e2af15221c63105bd0886b27ee0ea68c94c5","target":"record","created_at":"2026-05-18T00:25:28Z","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":"cc3110916759c6c3e0c54ab339e1cc7d715242c7d174be03d6381c4167ce639a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-21T15:36:11Z","title_canon_sha256":"da5acafa2e382ea46a0c1a4f1e44f027d8aceafb48a5aca24a3b38fb371d05f8"},"schema_version":"1.0","source":{"id":"1709.07379","kind":"arxiv","version":3}},"canonical_sha256":"8c03d966d6e260790435e664c9115425b896e207f6e48843d059171ec3a24198","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c03d966d6e260790435e664c9115425b896e207f6e48843d059171ec3a24198","first_computed_at":"2026-05-18T00:25:28.804861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:28.804861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W7ViSLaf25C2fUC1bZflUi1Ln8WEh3E7Y/856sZGEyhXtodwi3te6dvXTVs5KHl1BKFdupgk7QPRBeP6XDZBBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:28.805445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07379","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6234ee48d43b8489e8d8e6c73d32e2af15221c63105bd0886b27ee0ea68c94c5","sha256:8e005e82a143ec7e5ef9c9f08d0267de85b150d77c303f24122c9750518b1990"],"state_sha256":"cb1b3d60fa55a6587a76fe0b7bdb06c8547e1d9d3c7f03460e16d802deadc62e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lNXp6r5O+SijthNg0fARceu0zQDP2StPiFjLaPLKo+loMFaPhp6+6MSShiObFquebpDDEjyjfj6bIZI+EpwZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:06:00.117672Z","bundle_sha256":"bc583752cd56c81fdfdbf1bbffe98399eff1c9bcc141ef80067f092b2308e14e"}}