{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LVYUOE24K7HHQW3F5QG6LA52Q6","short_pith_number":"pith:LVYUOE24","schema_version":"1.0","canonical_sha256":"5d7147135c57ce785b65ec0de583ba8784b11a12046633509f9333625de9f534","source":{"kind":"arxiv","id":"1605.01418","version":6},"attestation_state":"computed","paper":{"title":"A Sampling Kaczmarz-Motzkin Algorithm for Linear Feasibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Deanna Needell, Jamie Haddock, Jesus De Loera","submitted_at":"2016-05-04T20:15:46Z","abstract_excerpt":"We combine two iterative algorithms for solving large-scale systems of linear inequalities, the relaxation method of Agmon, Motzkin et al. and the randomized Kaczmarz method. In doing so, we obtain a family of algorithms that generalize and extend both techniques. We prove several convergence results, and our computational experiments show our algorithms often outperform the original methods."},"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.01418","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-04T20:15:46Z","cross_cats_sorted":[],"title_canon_sha256":"8c89ae017ad7421aaf89040b337804b41f91552790415e885c139773c8db285d","abstract_canon_sha256":"a01601742c3808424cad68273e8be2f53ed0e447d8ad6e09047d5ff64dae411b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:23.225601Z","signature_b64":"aSDnUsTAAGWjAMPQg6NC7JGPYTpvhhXI8hjLNvI3LWCJNTxk8rAUXCsdL0oBBYiD/qTlnMbN9igSMSfCJr0rAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d7147135c57ce785b65ec0de583ba8784b11a12046633509f9333625de9f534","last_reissued_at":"2026-05-17T23:44:23.224975Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:23.224975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sampling Kaczmarz-Motzkin Algorithm for Linear Feasibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Deanna Needell, Jamie Haddock, Jesus De Loera","submitted_at":"2016-05-04T20:15:46Z","abstract_excerpt":"We combine two iterative algorithms for solving large-scale systems of linear inequalities, the relaxation method of Agmon, Motzkin et al. and the randomized Kaczmarz method. In doing so, we obtain a family of algorithms that generalize and extend both techniques. We prove several convergence results, and our computational experiments show our algorithms often outperform the original methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01418","kind":"arxiv","version":6},"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.01418","created_at":"2026-05-17T23:44:23.225064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01418v6","created_at":"2026-05-17T23:44:23.225064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01418","created_at":"2026-05-17T23:44:23.225064+00:00"},{"alias_kind":"pith_short_12","alias_value":"LVYUOE24K7HH","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LVYUOE24K7HHQW3F","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LVYUOE24","created_at":"2026-05-18T12:30:29.479603+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/LVYUOE24K7HHQW3F5QG6LA52Q6","json":"https://pith.science/pith/LVYUOE24K7HHQW3F5QG6LA52Q6.json","graph_json":"https://pith.science/api/pith-number/LVYUOE24K7HHQW3F5QG6LA52Q6/graph.json","events_json":"https://pith.science/api/pith-number/LVYUOE24K7HHQW3F5QG6LA52Q6/events.json","paper":"https://pith.science/paper/LVYUOE24"},"agent_actions":{"view_html":"https://pith.science/pith/LVYUOE24K7HHQW3F5QG6LA52Q6","download_json":"https://pith.science/pith/LVYUOE24K7HHQW3F5QG6LA52Q6.json","view_paper":"https://pith.science/paper/LVYUOE24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01418&json=true","fetch_graph":"https://pith.science/api/pith-number/LVYUOE24K7HHQW3F5QG6LA52Q6/graph.json","fetch_events":"https://pith.science/api/pith-number/LVYUOE24K7HHQW3F5QG6LA52Q6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LVYUOE24K7HHQW3F5QG6LA52Q6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LVYUOE24K7HHQW3F5QG6LA52Q6/action/storage_attestation","attest_author":"https://pith.science/pith/LVYUOE24K7HHQW3F5QG6LA52Q6/action/author_attestation","sign_citation":"https://pith.science/pith/LVYUOE24K7HHQW3F5QG6LA52Q6/action/citation_signature","submit_replication":"https://pith.science/pith/LVYUOE24K7HHQW3F5QG6LA52Q6/action/replication_record"}},"created_at":"2026-05-17T23:44:23.225064+00:00","updated_at":"2026-05-17T23:44:23.225064+00:00"}