{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OXT7EURF6PNAU3DD4HGPGW225L","short_pith_number":"pith:OXT7EURF","canonical_record":{"source":{"id":"1608.01167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-03T12:46:56Z","cross_cats_sorted":[],"title_canon_sha256":"478ee11d3dffc038b83ecaadeffdf0b1f51ca8e8873335b02ea9728a2b1fad15","abstract_canon_sha256":"b6b6b80a41772e61f6aba03d64bc641bc86dfc39ccac3476fb2b9d7cd9eceed6"},"schema_version":"1.0"},"canonical_sha256":"75e7f25225f3da0a6c63e1ccf35b5aeaf27b69656aef61a30884afad84443e79","source":{"kind":"arxiv","id":"1608.01167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01167","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01167v1","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01167","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"OXT7EURF6PNA","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OXT7EURF6PNAU3DD","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OXT7EURF","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OXT7EURF6PNAU3DD4HGPGW225L","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-03T12:46:56Z","cross_cats_sorted":[],"title_canon_sha256":"478ee11d3dffc038b83ecaadeffdf0b1f51ca8e8873335b02ea9728a2b1fad15","abstract_canon_sha256":"b6b6b80a41772e61f6aba03d64bc641bc86dfc39ccac3476fb2b9d7cd9eceed6"},"schema_version":"1.0"},"canonical_sha256":"75e7f25225f3da0a6c63e1ccf35b5aeaf27b69656aef61a30884afad84443e79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:56.343357Z","signature_b64":"8+5I4xdhmUhXqcLcCwfLojsJR9XXSrCgDKVX41cZZeM3XWU2xC0/LBGkdZ226abvne3ZfQs8wLoSGAnbGqxgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75e7f25225f3da0a6c63e1ccf35b5aeaf27b69656aef61a30884afad84443e79","last_reissued_at":"2026-05-18T01:09:56.342633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:56.342633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01167","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-18T01:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cotFK1MXIr2zK2Tv9MQ71ghm0Vwj1aFslJYppW34zXetgYO+qt3+8TcTgKfvZssDiVVqEC26Ihe+nR+KWmrfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:41:23.984334Z"},"content_sha256":"81c21800b23989a93aa98793fd8306ba96f5fe99eb08779992ba18b1dd481cd4","schema_version":"1.0","event_id":"sha256:81c21800b23989a93aa98793fd8306ba96f5fe99eb08779992ba18b1dd481cd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OXT7EURF6PNAU3DD4HGPGW225L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Continuous-Time Distributed Algorithms for Extended Monotropic Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lihua Xie, Peng Yi, Xianlin Zeng, Yiguang Hong","submitted_at":"2016-08-03T12:46:56Z","abstract_excerpt":"This paper studies distributed algorithms for the extended monotropic optimization problem, which is a general convex optimization problem with a certain separable structure. The considered objective function is the sum of local convex functions assigned to agents in a multi-agent network, with private set constraints and affine equality constraints. Each agent only knows its local objective function, local constraint set, and neighbor information. We propose two novel continuous-time distributed subgradient-based algorithms with projected output feedback and derivative feedback, respectively,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01167","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-18T01:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kwfXUlVwKzt8ClRjg3wQKkcihVkamQjJeZ8PtFj3TpLDOlyBtWqsndAWtzWaVVUxsETQC9EAtY+tAJAl+2YZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:41:23.984686Z"},"content_sha256":"7799af10fc9d05de1abf3d3cc0721610e45a276e7e9fb682d9e2eab867a6f889","schema_version":"1.0","event_id":"sha256:7799af10fc9d05de1abf3d3cc0721610e45a276e7e9fb682d9e2eab867a6f889"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXT7EURF6PNAU3DD4HGPGW225L/bundle.json","state_url":"https://pith.science/pith/OXT7EURF6PNAU3DD4HGPGW225L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXT7EURF6PNAU3DD4HGPGW225L/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-23T04:41:23Z","links":{"resolver":"https://pith.science/pith/OXT7EURF6PNAU3DD4HGPGW225L","bundle":"https://pith.science/pith/OXT7EURF6PNAU3DD4HGPGW225L/bundle.json","state":"https://pith.science/pith/OXT7EURF6PNAU3DD4HGPGW225L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXT7EURF6PNAU3DD4HGPGW225L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OXT7EURF6PNAU3DD4HGPGW225L","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":"b6b6b80a41772e61f6aba03d64bc641bc86dfc39ccac3476fb2b9d7cd9eceed6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-03T12:46:56Z","title_canon_sha256":"478ee11d3dffc038b83ecaadeffdf0b1f51ca8e8873335b02ea9728a2b1fad15"},"schema_version":"1.0","source":{"id":"1608.01167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01167","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01167v1","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01167","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"OXT7EURF6PNA","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OXT7EURF6PNAU3DD","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OXT7EURF","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:7799af10fc9d05de1abf3d3cc0721610e45a276e7e9fb682d9e2eab867a6f889","target":"graph","created_at":"2026-05-18T01:09:56Z","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":"This paper studies distributed algorithms for the extended monotropic optimization problem, which is a general convex optimization problem with a certain separable structure. The considered objective function is the sum of local convex functions assigned to agents in a multi-agent network, with private set constraints and affine equality constraints. Each agent only knows its local objective function, local constraint set, and neighbor information. We propose two novel continuous-time distributed subgradient-based algorithms with projected output feedback and derivative feedback, respectively,","authors_text":"Lihua Xie, Peng Yi, Xianlin Zeng, Yiguang Hong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-03T12:46:56Z","title":"Continuous-Time Distributed Algorithms for Extended Monotropic Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01167","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:81c21800b23989a93aa98793fd8306ba96f5fe99eb08779992ba18b1dd481cd4","target":"record","created_at":"2026-05-18T01:09:56Z","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":"b6b6b80a41772e61f6aba03d64bc641bc86dfc39ccac3476fb2b9d7cd9eceed6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-03T12:46:56Z","title_canon_sha256":"478ee11d3dffc038b83ecaadeffdf0b1f51ca8e8873335b02ea9728a2b1fad15"},"schema_version":"1.0","source":{"id":"1608.01167","kind":"arxiv","version":1}},"canonical_sha256":"75e7f25225f3da0a6c63e1ccf35b5aeaf27b69656aef61a30884afad84443e79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75e7f25225f3da0a6c63e1ccf35b5aeaf27b69656aef61a30884afad84443e79","first_computed_at":"2026-05-18T01:09:56.342633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:56.342633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8+5I4xdhmUhXqcLcCwfLojsJR9XXSrCgDKVX41cZZeM3XWU2xC0/LBGkdZ226abvne3ZfQs8wLoSGAnbGqxgAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:56.343357Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81c21800b23989a93aa98793fd8306ba96f5fe99eb08779992ba18b1dd481cd4","sha256:7799af10fc9d05de1abf3d3cc0721610e45a276e7e9fb682d9e2eab867a6f889"],"state_sha256":"81105a66eec74668e2af05555395fa913d8ecae7d8f7528abc334f01c5d65311"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b7DN/c3/lWGjHvEHO3InrPa8knxD54NVUM6Xf4tFvca4zYAwRzBFbEM0ozCxljrIiEu4/C1sZBVHG0rIiW8/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:41:23.986621Z","bundle_sha256":"7eb8e79e35198268c2d54fac61fb940ee9dc3c73bcc8f73fabf5244e2349c99f"}}