{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:AMK4IOYLHUFIDJIZUT74NPJQYX","short_pith_number":"pith:AMK4IOYL","canonical_record":{"source":{"id":"2203.04783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-09T15:06:20Z","cross_cats_sorted":[],"title_canon_sha256":"36e2c929483ffb0931facc71d41df85bd40920e34c2c21ab86feea12edaa9cc1","abstract_canon_sha256":"5acf100b502b105b2e9a2023b1feb3fe8370a0d50f155fbf1b25b873c35ab80b"},"schema_version":"1.0"},"canonical_sha256":"0315c43b0b3d0a81a519a4ffc6bd30c5d6f37f23bfea17c2064943e37039aef5","source":{"kind":"arxiv","id":"2203.04783","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.04783","created_at":"2026-07-05T04:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2203.04783v1","created_at":"2026-07-05T04:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.04783","created_at":"2026-07-05T04:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"AMK4IOYLHUFI","created_at":"2026-07-05T04:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"AMK4IOYLHUFIDJIZ","created_at":"2026-07-05T04:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"AMK4IOYL","created_at":"2026-07-05T04:03:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:AMK4IOYLHUFIDJIZUT74NPJQYX","target":"record","payload":{"canonical_record":{"source":{"id":"2203.04783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-09T15:06:20Z","cross_cats_sorted":[],"title_canon_sha256":"36e2c929483ffb0931facc71d41df85bd40920e34c2c21ab86feea12edaa9cc1","abstract_canon_sha256":"5acf100b502b105b2e9a2023b1feb3fe8370a0d50f155fbf1b25b873c35ab80b"},"schema_version":"1.0"},"canonical_sha256":"0315c43b0b3d0a81a519a4ffc6bd30c5d6f37f23bfea17c2064943e37039aef5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:22.393063Z","signature_b64":"hFBeSgYOfs5SnKGw/zINwHj4rzWSEPI+rz0bIVFN4fT15MBR5v8PNPgpbdSPWkBEpGsV5jhhFL77vH+l5CbwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0315c43b0b3d0a81a519a4ffc6bd30c5d6f37f23bfea17c2064943e37039aef5","last_reissued_at":"2026-07-05T04:03:22.392707Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:22.392707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.04783","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-07-05T04:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Ia7WpGAhjE5DjOULzZVIQ0OyOUXD8JX42hUJdKpfUlSMCMAv9TubNmerOoVH7IdP9v29oUzNjJ895CWWgDIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-28T10:52:22.007335Z"},"content_sha256":"04b31d51e1ac71c749f0628ea692585639e5fac693b13d479a3dff45b4c64b1f","schema_version":"1.0","event_id":"sha256:04b31d51e1ac71c749f0628ea692585639e5fac693b13d479a3dff45b4c64b1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:AMK4IOYLHUFIDJIZUT74NPJQYX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Novel Distributed Algorithms Design for Nonsmooth Resource Allocation on Weight-Balanced Digraphs","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-09T15:06:20Z","abstract_excerpt":"In this paper, the distributed resource allocation problem on strongly connected and weight-balanced digraphs is investigated, where the decisions of each agent are restricted to satisfy the coupled network resource constraints and heterogeneous general convex sets. Moreover, the local cost function can be non-smooth. In order to achieve the exact optimum of the nonsmooth resource allocation problem, a novel continuous-time distributed algorithm based on the gradient descent scheme and differentiated projection operators is proposed. With the help of the set-valued LaSalle invariance principle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.04783","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.04783/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"},"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-07-05T04:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0h8HIqZv+3bNeKGQ+tF7v1zY4NRfkRTaUbn3jLjjZeRT2Ults/4EXuEgTWvVIx+DfkDVkHYcC8lt+5r5RzCuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-28T10:52:22.008809Z"},"content_sha256":"bd3e312afcd68783ab559bad6db2c9559be7f8b4a4a6c681d7ab043de4fa6672","schema_version":"1.0","event_id":"sha256:bd3e312afcd68783ab559bad6db2c9559be7f8b4a4a6c681d7ab043de4fa6672"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMK4IOYLHUFIDJIZUT74NPJQYX/bundle.json","state_url":"https://pith.science/pith/AMK4IOYLHUFIDJIZUT74NPJQYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMK4IOYLHUFIDJIZUT74NPJQYX/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-07-28T10:52:22Z","links":{"resolver":"https://pith.science/pith/AMK4IOYLHUFIDJIZUT74NPJQYX","bundle":"https://pith.science/pith/AMK4IOYLHUFIDJIZUT74NPJQYX/bundle.json","state":"https://pith.science/pith/AMK4IOYLHUFIDJIZUT74NPJQYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMK4IOYLHUFIDJIZUT74NPJQYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:AMK4IOYLHUFIDJIZUT74NPJQYX","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":"5acf100b502b105b2e9a2023b1feb3fe8370a0d50f155fbf1b25b873c35ab80b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-09T15:06:20Z","title_canon_sha256":"36e2c929483ffb0931facc71d41df85bd40920e34c2c21ab86feea12edaa9cc1"},"schema_version":"1.0","source":{"id":"2203.04783","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.04783","created_at":"2026-07-05T04:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2203.04783v1","created_at":"2026-07-05T04:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.04783","created_at":"2026-07-05T04:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"AMK4IOYLHUFI","created_at":"2026-07-05T04:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"AMK4IOYLHUFIDJIZ","created_at":"2026-07-05T04:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"AMK4IOYL","created_at":"2026-07-05T04:03:22Z"}],"graph_snapshots":[{"event_id":"sha256:bd3e312afcd68783ab559bad6db2c9559be7f8b4a4a6c681d7ab043de4fa6672","target":"graph","created_at":"2026-07-05T04:03:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.04783/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, the distributed resource allocation problem on strongly connected and weight-balanced digraphs is investigated, where the decisions of each agent are restricted to satisfy the coupled network resource constraints and heterogeneous general convex sets. Moreover, the local cost function can be non-smooth. In order to achieve the exact optimum of the nonsmooth resource allocation problem, a novel continuous-time distributed algorithm based on the gradient descent scheme and differentiated projection operators is proposed. With the help of the set-valued LaSalle invariance principle","authors_text":"Dongxin Liu, Fan Li, Xiaohong Nian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-09T15:06:20Z","title":"Novel Distributed Algorithms Design for Nonsmooth Resource Allocation on Weight-Balanced Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.04783","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:04b31d51e1ac71c749f0628ea692585639e5fac693b13d479a3dff45b4c64b1f","target":"record","created_at":"2026-07-05T04:03:22Z","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":"5acf100b502b105b2e9a2023b1feb3fe8370a0d50f155fbf1b25b873c35ab80b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-09T15:06:20Z","title_canon_sha256":"36e2c929483ffb0931facc71d41df85bd40920e34c2c21ab86feea12edaa9cc1"},"schema_version":"1.0","source":{"id":"2203.04783","kind":"arxiv","version":1}},"canonical_sha256":"0315c43b0b3d0a81a519a4ffc6bd30c5d6f37f23bfea17c2064943e37039aef5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0315c43b0b3d0a81a519a4ffc6bd30c5d6f37f23bfea17c2064943e37039aef5","first_computed_at":"2026-07-05T04:03:22.392707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:03:22.392707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hFBeSgYOfs5SnKGw/zINwHj4rzWSEPI+rz0bIVFN4fT15MBR5v8PNPgpbdSPWkBEpGsV5jhhFL77vH+l5CbwBw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:03:22.393063Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.04783","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04b31d51e1ac71c749f0628ea692585639e5fac693b13d479a3dff45b4c64b1f","sha256:bd3e312afcd68783ab559bad6db2c9559be7f8b4a4a6c681d7ab043de4fa6672"],"state_sha256":"9191c042bd1ff18749c319a4eda85fdc0ce8bc17cdbbaa4e7170cba0e298d797"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i16x/mpgA6oPSk2AKKJTOCaO31GXSWluZyc+3V5SFYNYFWK3Bqzbn2F9IbzSl035RVEMbquc/chNSssQEWL2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-28T10:52:22.012140Z","bundle_sha256":"1febb42126fc24832a2b6936f8a4d9c793200ff9c0bb17920096a28a9f30b1ab"}}