{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CQWTVFA2FELX6XJZHFETGFDP6L","short_pith_number":"pith:CQWTVFA2","schema_version":"1.0","canonical_sha256":"142d3a941a29177f5d39394933146ff2eb94819fd93a84f4363006270155fa35","source":{"kind":"arxiv","id":"1901.03379","version":3},"attestation_state":"computed","paper":{"title":"INTERPOL: Information Theoretically Verifiable Polynomial Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"A. Salman Avestimehr, Saeid Sahraei","submitted_at":"2019-01-10T20:44:53Z","abstract_excerpt":"We study the problem of verifiable polynomial evaluation in the user-server and multi-party setups. We propose {INTERPOL}, an information-theoretically verifiable algorithm that allows a user to delegate the evaluation of a polynomial to a server, and verify the correctness of the results with high probability and in sublinear complexity. Compared to the existing approaches which typically rely on cryptographic assumptions, {INTERPOL} stands out in that it does not assume any computational limitation on the server. {INTERPOL} relies on decomposition of polynomial evaluation into two matrix mul"},"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":"1901.03379","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-01-10T20:44:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e321a9b1d340271bb1b725dd45705c59b349efa66c399f947e7adabbc213fafc","abstract_canon_sha256":"0d6a92a979892859296e3a27b1bc723afa88f65bae071dff62391a26b17bf073"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:39.499157Z","signature_b64":"z0zET8bhUCTLheVluCRaN/YYvbHTvoxA36lq5hnOilITPmKo7Q7/9TOc5g6moWiEPOY2FgFoDYeSSlFK0B/jDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"142d3a941a29177f5d39394933146ff2eb94819fd93a84f4363006270155fa35","last_reissued_at":"2026-05-17T23:47:39.498689Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:39.498689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"INTERPOL: Information Theoretically Verifiable Polynomial Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"A. Salman Avestimehr, Saeid Sahraei","submitted_at":"2019-01-10T20:44:53Z","abstract_excerpt":"We study the problem of verifiable polynomial evaluation in the user-server and multi-party setups. We propose {INTERPOL}, an information-theoretically verifiable algorithm that allows a user to delegate the evaluation of a polynomial to a server, and verify the correctness of the results with high probability and in sublinear complexity. Compared to the existing approaches which typically rely on cryptographic assumptions, {INTERPOL} stands out in that it does not assume any computational limitation on the server. {INTERPOL} relies on decomposition of polynomial evaluation into two matrix mul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03379","kind":"arxiv","version":3},"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":"1901.03379","created_at":"2026-05-17T23:47:39.498770+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03379v3","created_at":"2026-05-17T23:47:39.498770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03379","created_at":"2026-05-17T23:47:39.498770+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQWTVFA2FELX","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQWTVFA2FELX6XJZ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQWTVFA2","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1906.10817","citing_title":"Coded State Machine -- Scaling State Machine Execution under Byzantine Faults","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"1907.04302","citing_title":"Interactive Verifiable Polynomial Evaluation","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CQWTVFA2FELX6XJZHFETGFDP6L","json":"https://pith.science/pith/CQWTVFA2FELX6XJZHFETGFDP6L.json","graph_json":"https://pith.science/api/pith-number/CQWTVFA2FELX6XJZHFETGFDP6L/graph.json","events_json":"https://pith.science/api/pith-number/CQWTVFA2FELX6XJZHFETGFDP6L/events.json","paper":"https://pith.science/paper/CQWTVFA2"},"agent_actions":{"view_html":"https://pith.science/pith/CQWTVFA2FELX6XJZHFETGFDP6L","download_json":"https://pith.science/pith/CQWTVFA2FELX6XJZHFETGFDP6L.json","view_paper":"https://pith.science/paper/CQWTVFA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03379&json=true","fetch_graph":"https://pith.science/api/pith-number/CQWTVFA2FELX6XJZHFETGFDP6L/graph.json","fetch_events":"https://pith.science/api/pith-number/CQWTVFA2FELX6XJZHFETGFDP6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQWTVFA2FELX6XJZHFETGFDP6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQWTVFA2FELX6XJZHFETGFDP6L/action/storage_attestation","attest_author":"https://pith.science/pith/CQWTVFA2FELX6XJZHFETGFDP6L/action/author_attestation","sign_citation":"https://pith.science/pith/CQWTVFA2FELX6XJZHFETGFDP6L/action/citation_signature","submit_replication":"https://pith.science/pith/CQWTVFA2FELX6XJZHFETGFDP6L/action/replication_record"}},"created_at":"2026-05-17T23:47:39.498770+00:00","updated_at":"2026-05-17T23:47:39.498770+00:00"}