{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PBPSAC7ISOAYDRRJ4LBFMFP64I","short_pith_number":"pith:PBPSAC7I","schema_version":"1.0","canonical_sha256":"785f200be8938181c629e2c25615fee210230152b3e41f9a501f2254dcb18a4e","source":{"kind":"arxiv","id":"1905.10472","version":5},"attestation_state":"computed","paper":{"title":"Accelerating Distributed Optimization via Fixed-time Convergent Flows: Extensions to Non-convex Functions and Consistent Discretization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Kunal Garg, Mayank Baranwal","submitted_at":"2019-05-24T22:54:32Z","abstract_excerpt":"Distributed optimization has gained significant attention in recent years, primarily fueled by the availability of a large amount of data and privacy-preserving requirements. This paper presents a fixed-time convergent optimization algorithm for solving a potentially non-convex optimization problem using a first-order multi-agent system. Each agent in the network can access only its private objective function, while local information exchange is permitted between the neighbors. The proposed optimization algorithm combines a fixed-time convergent distributed parameter estimation scheme with a f"},"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":"1905.10472","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-05-24T22:54:32Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"e33f5439176e044eb810d648488e42b1b75ab266e8102a7ad329ff8f24c91cd5","abstract_canon_sha256":"db0760099a5bc56207fd257709d9955594dd179dfc82d1c2c6c651fc476f81cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:14:32.971166Z","signature_b64":"txEK+qGN1iEIKqPy4QPLknuUaEpKJTBqMNCub6wYpzXuxR3YohODiKlQ4MRNH1hrnnGCQDG57qav4sgeB3fVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"785f200be8938181c629e2c25615fee210230152b3e41f9a501f2254dcb18a4e","last_reissued_at":"2026-06-04T20:14:32.970726Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:14:32.970726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Distributed Optimization via Fixed-time Convergent Flows: Extensions to Non-convex Functions and Consistent Discretization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Kunal Garg, Mayank Baranwal","submitted_at":"2019-05-24T22:54:32Z","abstract_excerpt":"Distributed optimization has gained significant attention in recent years, primarily fueled by the availability of a large amount of data and privacy-preserving requirements. This paper presents a fixed-time convergent optimization algorithm for solving a potentially non-convex optimization problem using a first-order multi-agent system. Each agent in the network can access only its private objective function, while local information exchange is permitted between the neighbors. The proposed optimization algorithm combines a fixed-time convergent distributed parameter estimation scheme with a f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10472","kind":"arxiv","version":5},"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/1905.10472/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":"1905.10472","created_at":"2026-06-04T20:14:32.970786+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10472v5","created_at":"2026-06-04T20:14:32.970786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10472","created_at":"2026-06-04T20:14:32.970786+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBPSAC7ISOAY","created_at":"2026-06-04T20:14:32.970786+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBPSAC7ISOAYDRRJ","created_at":"2026-06-04T20:14:32.970786+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBPSAC7I","created_at":"2026-06-04T20:14:32.970786+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/PBPSAC7ISOAYDRRJ4LBFMFP64I","json":"https://pith.science/pith/PBPSAC7ISOAYDRRJ4LBFMFP64I.json","graph_json":"https://pith.science/api/pith-number/PBPSAC7ISOAYDRRJ4LBFMFP64I/graph.json","events_json":"https://pith.science/api/pith-number/PBPSAC7ISOAYDRRJ4LBFMFP64I/events.json","paper":"https://pith.science/paper/PBPSAC7I"},"agent_actions":{"view_html":"https://pith.science/pith/PBPSAC7ISOAYDRRJ4LBFMFP64I","download_json":"https://pith.science/pith/PBPSAC7ISOAYDRRJ4LBFMFP64I.json","view_paper":"https://pith.science/paper/PBPSAC7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10472&json=true","fetch_graph":"https://pith.science/api/pith-number/PBPSAC7ISOAYDRRJ4LBFMFP64I/graph.json","fetch_events":"https://pith.science/api/pith-number/PBPSAC7ISOAYDRRJ4LBFMFP64I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBPSAC7ISOAYDRRJ4LBFMFP64I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBPSAC7ISOAYDRRJ4LBFMFP64I/action/storage_attestation","attest_author":"https://pith.science/pith/PBPSAC7ISOAYDRRJ4LBFMFP64I/action/author_attestation","sign_citation":"https://pith.science/pith/PBPSAC7ISOAYDRRJ4LBFMFP64I/action/citation_signature","submit_replication":"https://pith.science/pith/PBPSAC7ISOAYDRRJ4LBFMFP64I/action/replication_record"}},"created_at":"2026-06-04T20:14:32.970786+00:00","updated_at":"2026-06-04T20:14:32.970786+00:00"}