{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DWXOGWLXXLRBDVBEB4NOXGU6UW","short_pith_number":"pith:DWXOGWLX","schema_version":"1.0","canonical_sha256":"1daee35977bae211d4240f1aeb9a9ea580050e0aa4a180ba4ffe43192924ab90","source":{"kind":"arxiv","id":"1309.1089","version":1},"attestation_state":"computed","paper":{"title":"Randomness-efficient Curve Samplers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Zeyu Guo","submitted_at":"2013-09-04T16:17:44Z","abstract_excerpt":"Curve samplers are sampling algorithms that proceed by viewing the domain as a vector space over a finite field, and randomly picking a low-degree curve in it as the sample. Curve samplers exhibit a nice property besides the sampling property: the restriction of low-degree polynomials over the domain to the sampled curve is still low-degree. This property is often used in combination with the sampling property and has found many applications, including PCP constructions, local decoding of codes, and algebraic PRG constructions.\n  The randomness complexity of curve samplers is a crucial paramet"},"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":"1309.1089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-04T16:17:44Z","cross_cats_sorted":[],"title_canon_sha256":"bfbbc482eed62752cf880d3b29b024e98de01aed3711f2834904df21a6fb6253","abstract_canon_sha256":"4f0d7b15c3f6e6b5faad07aef0f04559d6e4b912375f9d8557752a969b2b9aa3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:09.129503Z","signature_b64":"7qSlGMzUPcmp8fuUahaNZnSQ5UvRC5lBzCyru9HVnQyS+TIeoKeC+1kAODEkoh5YlQ81Ks5elP4O5Dis7vWaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1daee35977bae211d4240f1aeb9a9ea580050e0aa4a180ba4ffe43192924ab90","last_reissued_at":"2026-05-18T03:14:09.129022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:09.129022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomness-efficient Curve Samplers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Zeyu Guo","submitted_at":"2013-09-04T16:17:44Z","abstract_excerpt":"Curve samplers are sampling algorithms that proceed by viewing the domain as a vector space over a finite field, and randomly picking a low-degree curve in it as the sample. Curve samplers exhibit a nice property besides the sampling property: the restriction of low-degree polynomials over the domain to the sampled curve is still low-degree. This property is often used in combination with the sampling property and has found many applications, including PCP constructions, local decoding of codes, and algebraic PRG constructions.\n  The randomness complexity of curve samplers is a crucial paramet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1089","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":"1309.1089","created_at":"2026-05-18T03:14:09.129091+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1089v1","created_at":"2026-05-18T03:14:09.129091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1089","created_at":"2026-05-18T03:14:09.129091+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWXOGWLXXLRB","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWXOGWLXXLRBDVBE","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWXOGWLX","created_at":"2026-05-18T12:27:43.054852+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/DWXOGWLXXLRBDVBEB4NOXGU6UW","json":"https://pith.science/pith/DWXOGWLXXLRBDVBEB4NOXGU6UW.json","graph_json":"https://pith.science/api/pith-number/DWXOGWLXXLRBDVBEB4NOXGU6UW/graph.json","events_json":"https://pith.science/api/pith-number/DWXOGWLXXLRBDVBEB4NOXGU6UW/events.json","paper":"https://pith.science/paper/DWXOGWLX"},"agent_actions":{"view_html":"https://pith.science/pith/DWXOGWLXXLRBDVBEB4NOXGU6UW","download_json":"https://pith.science/pith/DWXOGWLXXLRBDVBEB4NOXGU6UW.json","view_paper":"https://pith.science/paper/DWXOGWLX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1089&json=true","fetch_graph":"https://pith.science/api/pith-number/DWXOGWLXXLRBDVBEB4NOXGU6UW/graph.json","fetch_events":"https://pith.science/api/pith-number/DWXOGWLXXLRBDVBEB4NOXGU6UW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWXOGWLXXLRBDVBEB4NOXGU6UW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWXOGWLXXLRBDVBEB4NOXGU6UW/action/storage_attestation","attest_author":"https://pith.science/pith/DWXOGWLXXLRBDVBEB4NOXGU6UW/action/author_attestation","sign_citation":"https://pith.science/pith/DWXOGWLXXLRBDVBEB4NOXGU6UW/action/citation_signature","submit_replication":"https://pith.science/pith/DWXOGWLXXLRBDVBEB4NOXGU6UW/action/replication_record"}},"created_at":"2026-05-18T03:14:09.129091+00:00","updated_at":"2026-05-18T03:14:09.129091+00:00"}