{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BJIFKS72UULOACHX4UNPPUK3SI","short_pith_number":"pith:BJIFKS72","schema_version":"1.0","canonical_sha256":"0a50554bfaa516e008f7e51af7d15b920e174585618e3358f26507ca8a6aa540","source":{"kind":"arxiv","id":"1412.8493","version":1},"attestation_state":"computed","paper":{"title":"An ADMM algorithm for solving a proximal bound-constrained quadratic program","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an","submitted_at":"2014-12-29T21:35:19Z","abstract_excerpt":"We consider a proximal operator given by a quadratic function subject to bound constraints and give an optimization algorithm using the alternating direction method of multipliers (ADMM). The algorithm is particularly efficient to solve a collection of proximal operators that share the same quadratic form, or if the quadratic program is the relaxation of a binary quadratic problem."},"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":"1412.8493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-29T21:35:19Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"36df06e1ad9633332bc15dfab4b2a535a6fe5a873418e4c5536997c5ec405849","abstract_canon_sha256":"dbf622de566d0c58af02564e3e8990fe13660369e703b5d4318360cf306588b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:17.307980Z","signature_b64":"eQ2JKuoiRK+KL5QmxsakM8bZOErpRqCkRZpLQL1abHcC1EnwjI95LXfWPtV/z4WbpQC5IFxZx0xWBHAMsGNrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a50554bfaa516e008f7e51af7d15b920e174585618e3358f26507ca8a6aa540","last_reissued_at":"2026-05-18T02:30:17.307467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:17.307467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An ADMM algorithm for solving a proximal bound-constrained quadratic program","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an","submitted_at":"2014-12-29T21:35:19Z","abstract_excerpt":"We consider a proximal operator given by a quadratic function subject to bound constraints and give an optimization algorithm using the alternating direction method of multipliers (ADMM). The algorithm is particularly efficient to solve a collection of proximal operators that share the same quadratic form, or if the quadratic program is the relaxation of a binary quadratic problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8493","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":""},"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":"1412.8493","created_at":"2026-05-18T02:30:17.307552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8493v1","created_at":"2026-05-18T02:30:17.307552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8493","created_at":"2026-05-18T02:30:17.307552+00:00"},{"alias_kind":"pith_short_12","alias_value":"BJIFKS72UULO","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BJIFKS72UULOACHX","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BJIFKS72","created_at":"2026-05-18T12:28:22.404517+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/BJIFKS72UULOACHX4UNPPUK3SI","json":"https://pith.science/pith/BJIFKS72UULOACHX4UNPPUK3SI.json","graph_json":"https://pith.science/api/pith-number/BJIFKS72UULOACHX4UNPPUK3SI/graph.json","events_json":"https://pith.science/api/pith-number/BJIFKS72UULOACHX4UNPPUK3SI/events.json","paper":"https://pith.science/paper/BJIFKS72"},"agent_actions":{"view_html":"https://pith.science/pith/BJIFKS72UULOACHX4UNPPUK3SI","download_json":"https://pith.science/pith/BJIFKS72UULOACHX4UNPPUK3SI.json","view_paper":"https://pith.science/paper/BJIFKS72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8493&json=true","fetch_graph":"https://pith.science/api/pith-number/BJIFKS72UULOACHX4UNPPUK3SI/graph.json","fetch_events":"https://pith.science/api/pith-number/BJIFKS72UULOACHX4UNPPUK3SI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BJIFKS72UULOACHX4UNPPUK3SI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BJIFKS72UULOACHX4UNPPUK3SI/action/storage_attestation","attest_author":"https://pith.science/pith/BJIFKS72UULOACHX4UNPPUK3SI/action/author_attestation","sign_citation":"https://pith.science/pith/BJIFKS72UULOACHX4UNPPUK3SI/action/citation_signature","submit_replication":"https://pith.science/pith/BJIFKS72UULOACHX4UNPPUK3SI/action/replication_record"}},"created_at":"2026-05-18T02:30:17.307552+00:00","updated_at":"2026-05-18T02:30:17.307552+00:00"}