{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HXFH43PPFJZSQTFAL3XGASFSUH","short_pith_number":"pith:HXFH43PP","schema_version":"1.0","canonical_sha256":"3dca7e6def2a73284ca05eee6048b2a1c5a4ba06b5e0e653cd03e5370e374fff","source":{"kind":"arxiv","id":"2203.05304","version":1},"attestation_state":"computed","paper":{"title":"Solving Nonsmooth Resource Allocation Problems with Feasibility Constraints through Novel Distributed Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dongxin Liu, Fan Li, Xiaohong Nian","submitted_at":"2022-03-10T11:35:44Z","abstract_excerpt":"The distributed non-smooth resource allocation problem over multi-agent networks is studied in this paper, where each agent is subject to globally coupled network resource constraints and local feasibility constraints described in terms of general convex sets. To solve such a problem, two classes of novel distributed continuous-time algorithms via differential inclusions and projection operators are proposed. Moreover, the convergence of the algorithms is analyzed by the Lyapunov functional theory and nonsmooth analysis. We illustrate that the first algorithm can globally converge to the exact"},"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":"2203.05304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-10T11:35:44Z","cross_cats_sorted":[],"title_canon_sha256":"26c7fd4621c0f0bfe6e02d238333edab928dcefad8f45ee898c7afab2fc9c8c7","abstract_canon_sha256":"fb11e058dec5e64ef8559049e7e946337e7a1e0dbcfeaa96344443cdd4eac58e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:40.536286Z","signature_b64":"RMSGnq9SpE9LEic1RKhpzqN3qHDwLFpFGQng30UlVxME/s+bWPDhoj6ehm8vKPE/O4JQdHCteFHm217zMMUGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dca7e6def2a73284ca05eee6048b2a1c5a4ba06b5e0e653cd03e5370e374fff","last_reissued_at":"2026-07-05T04:03:40.535948Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:40.535948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Nonsmooth Resource Allocation Problems with Feasibility Constraints through Novel Distributed Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dongxin Liu, Fan Li, Xiaohong Nian","submitted_at":"2022-03-10T11:35:44Z","abstract_excerpt":"The distributed non-smooth resource allocation problem over multi-agent networks is studied in this paper, where each agent is subject to globally coupled network resource constraints and local feasibility constraints described in terms of general convex sets. To solve such a problem, two classes of novel distributed continuous-time algorithms via differential inclusions and projection operators are proposed. Moreover, the convergence of the algorithms is analyzed by the Lyapunov functional theory and nonsmooth analysis. We illustrate that the first algorithm can globally converge to the exact"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.05304","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.05304/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2203.05304","created_at":"2026-07-05T04:03:40.536004+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.05304v1","created_at":"2026-07-05T04:03:40.536004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.05304","created_at":"2026-07-05T04:03:40.536004+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXFH43PPFJZS","created_at":"2026-07-05T04:03:40.536004+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXFH43PPFJZSQTFA","created_at":"2026-07-05T04:03:40.536004+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXFH43PP","created_at":"2026-07-05T04:03:40.536004+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/HXFH43PPFJZSQTFAL3XGASFSUH","json":"https://pith.science/pith/HXFH43PPFJZSQTFAL3XGASFSUH.json","graph_json":"https://pith.science/api/pith-number/HXFH43PPFJZSQTFAL3XGASFSUH/graph.json","events_json":"https://pith.science/api/pith-number/HXFH43PPFJZSQTFAL3XGASFSUH/events.json","paper":"https://pith.science/paper/HXFH43PP"},"agent_actions":{"view_html":"https://pith.science/pith/HXFH43PPFJZSQTFAL3XGASFSUH","download_json":"https://pith.science/pith/HXFH43PPFJZSQTFAL3XGASFSUH.json","view_paper":"https://pith.science/paper/HXFH43PP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.05304&json=true","fetch_graph":"https://pith.science/api/pith-number/HXFH43PPFJZSQTFAL3XGASFSUH/graph.json","fetch_events":"https://pith.science/api/pith-number/HXFH43PPFJZSQTFAL3XGASFSUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXFH43PPFJZSQTFAL3XGASFSUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXFH43PPFJZSQTFAL3XGASFSUH/action/storage_attestation","attest_author":"https://pith.science/pith/HXFH43PPFJZSQTFAL3XGASFSUH/action/author_attestation","sign_citation":"https://pith.science/pith/HXFH43PPFJZSQTFAL3XGASFSUH/action/citation_signature","submit_replication":"https://pith.science/pith/HXFH43PPFJZSQTFAL3XGASFSUH/action/replication_record"}},"created_at":"2026-07-05T04:03:40.536004+00:00","updated_at":"2026-07-05T04:03:40.536004+00:00"}