{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SVIECPE3VWOOGBJ77PEOC6DXSB","short_pith_number":"pith:SVIECPE3","schema_version":"1.0","canonical_sha256":"9550413c9bad9ce3053ffbc8e1787790734aba1339975d144ec3f10e6538c56f","source":{"kind":"arxiv","id":"1605.05353","version":1},"attestation_state":"computed","paper":{"title":"Hardware Based Projection onto The Parity Polytope and Probability Simplex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mitchell Wasson, Stark C. Draper","submitted_at":"2016-05-17T20:28:27Z","abstract_excerpt":"This paper is concerned with the adaptation to hardware of methods for Euclidean norm projections onto the parity polytope and probability simplex. We first refine recent efforts to develop efficient methods of projection onto the parity polytope. Our resulting algorithm can be configured to have either average computational complexity $\\mathcal{O}\\left(d\\right)$ or worst case complexity $\\mathcal{O}\\left(d\\log{d}\\right)$ on a serial processor where $d$ is the dimension of projection space. We show how to adapt our projection routine to hardware. Our projection method uses a sub-routine that i"},"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":"1605.05353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-17T20:28:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"159fb288433d25b389cc23d5039ca3a105ec4b0f16a14bca7c4f5450de5552c5","abstract_canon_sha256":"7bfd84bb2bcc11e7f73042dc9277e5420489daeb20e59a118a0fff1e0fd69f90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:35.203411Z","signature_b64":"n/pjE1SNoT5w5PxLgWdmKMvTfCiS5fbTJShVIzDIqY4v26R0PbnOZE3qb/yWrWda6IchKvk/ziWzIIcPWrAyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9550413c9bad9ce3053ffbc8e1787790734aba1339975d144ec3f10e6538c56f","last_reissued_at":"2026-05-18T01:14:35.202665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:35.202665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardware Based Projection onto The Parity Polytope and Probability Simplex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mitchell Wasson, Stark C. Draper","submitted_at":"2016-05-17T20:28:27Z","abstract_excerpt":"This paper is concerned with the adaptation to hardware of methods for Euclidean norm projections onto the parity polytope and probability simplex. We first refine recent efforts to develop efficient methods of projection onto the parity polytope. Our resulting algorithm can be configured to have either average computational complexity $\\mathcal{O}\\left(d\\right)$ or worst case complexity $\\mathcal{O}\\left(d\\log{d}\\right)$ on a serial processor where $d$ is the dimension of projection space. We show how to adapt our projection routine to hardware. Our projection method uses a sub-routine that i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05353","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":"1605.05353","created_at":"2026-05-18T01:14:35.202794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05353v1","created_at":"2026-05-18T01:14:35.202794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05353","created_at":"2026-05-18T01:14:35.202794+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVIECPE3VWOO","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVIECPE3VWOOGBJ7","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVIECPE3","created_at":"2026-05-18T12:30:44.179134+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/SVIECPE3VWOOGBJ77PEOC6DXSB","json":"https://pith.science/pith/SVIECPE3VWOOGBJ77PEOC6DXSB.json","graph_json":"https://pith.science/api/pith-number/SVIECPE3VWOOGBJ77PEOC6DXSB/graph.json","events_json":"https://pith.science/api/pith-number/SVIECPE3VWOOGBJ77PEOC6DXSB/events.json","paper":"https://pith.science/paper/SVIECPE3"},"agent_actions":{"view_html":"https://pith.science/pith/SVIECPE3VWOOGBJ77PEOC6DXSB","download_json":"https://pith.science/pith/SVIECPE3VWOOGBJ77PEOC6DXSB.json","view_paper":"https://pith.science/paper/SVIECPE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05353&json=true","fetch_graph":"https://pith.science/api/pith-number/SVIECPE3VWOOGBJ77PEOC6DXSB/graph.json","fetch_events":"https://pith.science/api/pith-number/SVIECPE3VWOOGBJ77PEOC6DXSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVIECPE3VWOOGBJ77PEOC6DXSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVIECPE3VWOOGBJ77PEOC6DXSB/action/storage_attestation","attest_author":"https://pith.science/pith/SVIECPE3VWOOGBJ77PEOC6DXSB/action/author_attestation","sign_citation":"https://pith.science/pith/SVIECPE3VWOOGBJ77PEOC6DXSB/action/citation_signature","submit_replication":"https://pith.science/pith/SVIECPE3VWOOGBJ77PEOC6DXSB/action/replication_record"}},"created_at":"2026-05-18T01:14:35.202794+00:00","updated_at":"2026-05-18T01:14:35.202794+00:00"}