{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CQWTVFA2FELX6XJZHFETGFDP6L","short_pith_number":"pith:CQWTVFA2","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"},"canonical_sha256":"142d3a941a29177f5d39394933146ff2eb94819fd93a84f4363006270155fa35","source":{"kind":"arxiv","id":"1901.03379","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03379","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03379v3","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03379","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"CQWTVFA2FELX","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CQWTVFA2FELX6XJZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CQWTVFA2","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CQWTVFA2FELX6XJZHFETGFDP6L","target":"record","payload":{"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"},"canonical_sha256":"142d3a941a29177f5d39394933146ff2eb94819fd93a84f4363006270155fa35","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"},"source_kind":"arxiv","source_id":"1901.03379","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ErRWBXN1alwrwoqbwy8TqHsJN8YYKg9earjqyvWiR7JDLz9XY2XJ2xPWDAjiU7SvYqdMUSGENjDw3ko2GTKBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:29:18.142748Z"},"content_sha256":"0004f69d6a232e9a9828695fed0ebe07ee2bc6cf010adf5301b54cdf05b3062c","schema_version":"1.0","event_id":"sha256:0004f69d6a232e9a9828695fed0ebe07ee2bc6cf010adf5301b54cdf05b3062c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CQWTVFA2FELX6XJZHFETGFDP6L","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5WrVVSjK6BYIQqJLkUededVROaY/9tNDDJ80RX+X1/vvOUSGbL1HvFdAOE7+PjYz4bRSbxD1XD3M98JMWT1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:29:18.143388Z"},"content_sha256":"79df81f19fea7b990d96c4dc4850f616b0d6f6317274bf8fcb6f78739572c0e4","schema_version":"1.0","event_id":"sha256:79df81f19fea7b990d96c4dc4850f616b0d6f6317274bf8fcb6f78739572c0e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQWTVFA2FELX6XJZHFETGFDP6L/bundle.json","state_url":"https://pith.science/pith/CQWTVFA2FELX6XJZHFETGFDP6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQWTVFA2FELX6XJZHFETGFDP6L/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T22:29:18Z","links":{"resolver":"https://pith.science/pith/CQWTVFA2FELX6XJZHFETGFDP6L","bundle":"https://pith.science/pith/CQWTVFA2FELX6XJZHFETGFDP6L/bundle.json","state":"https://pith.science/pith/CQWTVFA2FELX6XJZHFETGFDP6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQWTVFA2FELX6XJZHFETGFDP6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CQWTVFA2FELX6XJZHFETGFDP6L","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0d6a92a979892859296e3a27b1bc723afa88f65bae071dff62391a26b17bf073","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-01-10T20:44:53Z","title_canon_sha256":"e321a9b1d340271bb1b725dd45705c59b349efa66c399f947e7adabbc213fafc"},"schema_version":"1.0","source":{"id":"1901.03379","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03379","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03379v3","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03379","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"CQWTVFA2FELX","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CQWTVFA2FELX6XJZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CQWTVFA2","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:79df81f19fea7b990d96c4dc4850f616b0d6f6317274bf8fcb6f78739572c0e4","target":"graph","created_at":"2026-05-17T23:47:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"A. Salman Avestimehr, Saeid Sahraei","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-01-10T20:44:53Z","title":"INTERPOL: Information Theoretically Verifiable Polynomial Evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03379","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0004f69d6a232e9a9828695fed0ebe07ee2bc6cf010adf5301b54cdf05b3062c","target":"record","created_at":"2026-05-17T23:47:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0d6a92a979892859296e3a27b1bc723afa88f65bae071dff62391a26b17bf073","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-01-10T20:44:53Z","title_canon_sha256":"e321a9b1d340271bb1b725dd45705c59b349efa66c399f947e7adabbc213fafc"},"schema_version":"1.0","source":{"id":"1901.03379","kind":"arxiv","version":3}},"canonical_sha256":"142d3a941a29177f5d39394933146ff2eb94819fd93a84f4363006270155fa35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"142d3a941a29177f5d39394933146ff2eb94819fd93a84f4363006270155fa35","first_computed_at":"2026-05-17T23:47:39.498689Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:39.498689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z0zET8bhUCTLheVluCRaN/YYvbHTvoxA36lq5hnOilITPmKo7Q7/9TOc5g6moWiEPOY2FgFoDYeSSlFK0B/jDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:39.499157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03379","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0004f69d6a232e9a9828695fed0ebe07ee2bc6cf010adf5301b54cdf05b3062c","sha256:79df81f19fea7b990d96c4dc4850f616b0d6f6317274bf8fcb6f78739572c0e4"],"state_sha256":"588a3f0ed1bc7fef45d136ecdc7d3947bb86326021ff37235b023c9b07f3f77f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"reJd6brPYMZdk+8ihUyMf8ynX43t6JapRPRs0K+Bzs22IBDBcq+okH6k39eWwGBUxtPxP1GVEd9F0d8HRXZ4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:29:18.147481Z","bundle_sha256":"4596f69d422722328cf9124fbc3a37652724a4cf9ee70e3e1261b3f852200ba0"}}