{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4AYYZBNFJ624FM6BHNQGDUJFCS","short_pith_number":"pith:4AYYZBNF","schema_version":"1.0","canonical_sha256":"e0318c85a54fb5c2b3c13b6061d125149b8b91a793d00597cda31ffa8e9c258f","source":{"kind":"arxiv","id":"2409.04998","version":1},"attestation_state":"computed","paper":{"title":"A Double Tracking Method for Optimization with Decentralized Generalized Orthogonality Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"math.OC","authors_text":"Lei Wang, Nachuan Xiao, Xin Liu","submitted_at":"2024-09-08T06:57:35Z","abstract_excerpt":"In this paper, we consider the decentralized optimization problems with generalized orthogonality constraints, where both the objective function and the constraint exhibit a distributed structure. Such optimization problems, albeit ubiquitous in practical applications, remain unsolvable by existing algorithms in the presence of distributed constraints. To address this issue, we convert the original problem into an unconstrained penalty model by resorting to the recently proposed constraint-dissolving operator. However, this transformation compromises the essential property of separability in t"},"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":"2409.04998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-08T06:57:35Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"c2b079f11ed22434e16f747b2d6ea2ababa87ef80c7d5700000bfc24edfc200f","abstract_canon_sha256":"aa7e2262dbe97153068e85360b50ef629e8a404b416e90462d45f48f60c64474"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:04:42.728803Z","signature_b64":"RuFKWfTovfMmGC25TWGDBUOqnw/pPuL6UwcB42LQbfSFFbQIVHW0gsk8PYjO6uIAfDc/d6iBTFcpeZ0XAPnKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0318c85a54fb5c2b3c13b6061d125149b8b91a793d00597cda31ffa8e9c258f","last_reissued_at":"2026-07-05T09:04:42.728381Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:04:42.728381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Double Tracking Method for Optimization with Decentralized Generalized Orthogonality Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"math.OC","authors_text":"Lei Wang, Nachuan Xiao, Xin Liu","submitted_at":"2024-09-08T06:57:35Z","abstract_excerpt":"In this paper, we consider the decentralized optimization problems with generalized orthogonality constraints, where both the objective function and the constraint exhibit a distributed structure. Such optimization problems, albeit ubiquitous in practical applications, remain unsolvable by existing algorithms in the presence of distributed constraints. To address this issue, we convert the original problem into an unconstrained penalty model by resorting to the recently proposed constraint-dissolving operator. However, this transformation compromises the essential property of separability in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.04998","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/2409.04998/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":"2409.04998","created_at":"2026-07-05T09:04:42.728439+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.04998v1","created_at":"2026-07-05T09:04:42.728439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04998","created_at":"2026-07-05T09:04:42.728439+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AYYZBNFJ624","created_at":"2026-07-05T09:04:42.728439+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AYYZBNFJ624FM6B","created_at":"2026-07-05T09:04:42.728439+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AYYZBNF","created_at":"2026-07-05T09:04:42.728439+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.19182","citing_title":"A Unified Algorithm for Nonconvex Decentralized Nonlinear Optimization","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4AYYZBNFJ624FM6BHNQGDUJFCS","json":"https://pith.science/pith/4AYYZBNFJ624FM6BHNQGDUJFCS.json","graph_json":"https://pith.science/api/pith-number/4AYYZBNFJ624FM6BHNQGDUJFCS/graph.json","events_json":"https://pith.science/api/pith-number/4AYYZBNFJ624FM6BHNQGDUJFCS/events.json","paper":"https://pith.science/paper/4AYYZBNF"},"agent_actions":{"view_html":"https://pith.science/pith/4AYYZBNFJ624FM6BHNQGDUJFCS","download_json":"https://pith.science/pith/4AYYZBNFJ624FM6BHNQGDUJFCS.json","view_paper":"https://pith.science/paper/4AYYZBNF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.04998&json=true","fetch_graph":"https://pith.science/api/pith-number/4AYYZBNFJ624FM6BHNQGDUJFCS/graph.json","fetch_events":"https://pith.science/api/pith-number/4AYYZBNFJ624FM6BHNQGDUJFCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AYYZBNFJ624FM6BHNQGDUJFCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AYYZBNFJ624FM6BHNQGDUJFCS/action/storage_attestation","attest_author":"https://pith.science/pith/4AYYZBNFJ624FM6BHNQGDUJFCS/action/author_attestation","sign_citation":"https://pith.science/pith/4AYYZBNFJ624FM6BHNQGDUJFCS/action/citation_signature","submit_replication":"https://pith.science/pith/4AYYZBNFJ624FM6BHNQGDUJFCS/action/replication_record"}},"created_at":"2026-07-05T09:04:42.728439+00:00","updated_at":"2026-07-05T09:04:42.728439+00:00"}