{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:F3WQWVTZFOHVDESSK3YQUODNYZ","short_pith_number":"pith:F3WQWVTZ","schema_version":"1.0","canonical_sha256":"2eed0b56792b8f51925256f10a386dc6569d65cc3bfe671cf8caf3c5f988ac1d","source":{"kind":"arxiv","id":"2506.08024","version":1},"attestation_state":"computed","paper":{"title":"Distributed Asynchronous Primal-Dual Optimization for Supply-Chain Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Laksh Patel, Neel Shanbhag","submitted_at":"2025-05-29T21:11:48Z","abstract_excerpt":"Distributed supply-chain optimization demands algorithms that can cope with unreliable communication, unbounded messaging delays, and geographically dispersed agents while still guaranteeing convergence with provable rates. In this work, we introduce DAPD-SCO (Distributed Asynchronous Primal-Dual Optimization for Supply-Chain Networks), a fully asynchronous primal-dual scheme for network flow allocation over directed acyclic supply-chain graphs. Each edge agent independently updates its local flow by projected gradient descent, and each retailer agent independently updates its dual multiplier "},"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":"2506.08024","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-29T21:11:48Z","cross_cats_sorted":[],"title_canon_sha256":"c10fd125f29732412c18ece0e3e508cec3ca6f942ef0f55a10793e3c17ac6e1f","abstract_canon_sha256":"f6872f952d81a1fb1169c2cea64438b16680695ff21da10366de956eb038a168"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:43.844553Z","signature_b64":"BqmBhuQ93rOHfZskW0D/diLNusACQuGuKs3+LXOuF1hVNg5XlxnG9jbOGRc71RNLP4Tkotrb77NQmdAi8R3HBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eed0b56792b8f51925256f10a386dc6569d65cc3bfe671cf8caf3c5f988ac1d","last_reissued_at":"2026-07-05T11:18:43.844168Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:43.844168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Asynchronous Primal-Dual Optimization for Supply-Chain Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Laksh Patel, Neel Shanbhag","submitted_at":"2025-05-29T21:11:48Z","abstract_excerpt":"Distributed supply-chain optimization demands algorithms that can cope with unreliable communication, unbounded messaging delays, and geographically dispersed agents while still guaranteeing convergence with provable rates. In this work, we introduce DAPD-SCO (Distributed Asynchronous Primal-Dual Optimization for Supply-Chain Networks), a fully asynchronous primal-dual scheme for network flow allocation over directed acyclic supply-chain graphs. Each edge agent independently updates its local flow by projected gradient descent, and each retailer agent independently updates its dual multiplier "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08024","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/2506.08024/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":"2506.08024","created_at":"2026-07-05T11:18:43.844221+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.08024v1","created_at":"2026-07-05T11:18:43.844221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08024","created_at":"2026-07-05T11:18:43.844221+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3WQWVTZFOHV","created_at":"2026-07-05T11:18:43.844221+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3WQWVTZFOHVDESS","created_at":"2026-07-05T11:18:43.844221+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3WQWVTZ","created_at":"2026-07-05T11:18:43.844221+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/F3WQWVTZFOHVDESSK3YQUODNYZ","json":"https://pith.science/pith/F3WQWVTZFOHVDESSK3YQUODNYZ.json","graph_json":"https://pith.science/api/pith-number/F3WQWVTZFOHVDESSK3YQUODNYZ/graph.json","events_json":"https://pith.science/api/pith-number/F3WQWVTZFOHVDESSK3YQUODNYZ/events.json","paper":"https://pith.science/paper/F3WQWVTZ"},"agent_actions":{"view_html":"https://pith.science/pith/F3WQWVTZFOHVDESSK3YQUODNYZ","download_json":"https://pith.science/pith/F3WQWVTZFOHVDESSK3YQUODNYZ.json","view_paper":"https://pith.science/paper/F3WQWVTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.08024&json=true","fetch_graph":"https://pith.science/api/pith-number/F3WQWVTZFOHVDESSK3YQUODNYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/F3WQWVTZFOHVDESSK3YQUODNYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3WQWVTZFOHVDESSK3YQUODNYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3WQWVTZFOHVDESSK3YQUODNYZ/action/storage_attestation","attest_author":"https://pith.science/pith/F3WQWVTZFOHVDESSK3YQUODNYZ/action/author_attestation","sign_citation":"https://pith.science/pith/F3WQWVTZFOHVDESSK3YQUODNYZ/action/citation_signature","submit_replication":"https://pith.science/pith/F3WQWVTZFOHVDESSK3YQUODNYZ/action/replication_record"}},"created_at":"2026-07-05T11:18:43.844221+00:00","updated_at":"2026-07-05T11:18:43.844221+00:00"}