{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TNGR6VC3U3MKEQOV6ZWURC6DMQ","short_pith_number":"pith:TNGR6VC3","canonical_record":{"source":{"id":"1907.04302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-09T17:40:46Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"53c4e18baa7f2d74e534bc2d55a7fe3d27c8bbe1ad690107b3277f943c043268","abstract_canon_sha256":"3679dc1d33b84c8024664a7465ca3b8111fff53fef485b9cd75f39d9379824e7"},"schema_version":"1.0"},"canonical_sha256":"9b4d1f545ba6d8a241d5f66d488bc36412990312344e8d11a0a98114d0a78334","source":{"kind":"arxiv","id":"1907.04302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04302","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04302v1","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04302","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"TNGR6VC3U3MK","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TNGR6VC3U3MKEQOV","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TNGR6VC3","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TNGR6VC3U3MKEQOV6ZWURC6DMQ","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-09T17:40:46Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"53c4e18baa7f2d74e534bc2d55a7fe3d27c8bbe1ad690107b3277f943c043268","abstract_canon_sha256":"3679dc1d33b84c8024664a7465ca3b8111fff53fef485b9cd75f39d9379824e7"},"schema_version":"1.0"},"canonical_sha256":"9b4d1f545ba6d8a241d5f66d488bc36412990312344e8d11a0a98114d0a78334","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:02.724212Z","signature_b64":"pUixlLK5w2y82jlfZAWA1CbjyT1vaxs42OEsW9GtVEjQKGBHD96PYhtaIKUaqHV8GmB+fUDS/1fzpOgKXwr3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b4d1f545ba6d8a241d5f66d488bc36412990312344e8d11a0a98114d0a78334","last_reissued_at":"2026-05-17T23:41:02.723546Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:02.723546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04302","source_version":1,"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:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CYG3D9Wn7ITa8CZLsqV0Sb5FCuokD0JFX/GTuntpF3IN2NwC/TG+pekJDQ0/9SEHauwUf7/Xl4J0U5LfdyVjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:12:37.217759Z"},"content_sha256":"32b1163a13a76d9cc47cf5cc3c8c772a336206d81cf97946ccdb8d0e9178a090","schema_version":"1.0","event_id":"sha256:32b1163a13a76d9cc47cf5cc3c8c772a336206d81cf97946ccdb8d0e9178a090"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TNGR6VC3U3MKEQOV6ZWURC6DMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interactive Verifiable Polynomial Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Mohammad Ali Maddah-Ali, Saeid Sahraei, Salman Avestimehr","submitted_at":"2019-07-09T17:40:46Z","abstract_excerpt":"Cloud computing platforms have created the possibility for computationally limited users to delegate demanding tasks to strong but untrusted servers. Verifiable computing algorithms help build trust in such interactions by enabling the server to provide a proof of correctness of his results which the user can check very efficiently. In this paper, we present a doubly-efficient interactive algorithm for verifiable polynomial evaluation. Unlike the mainstream literature on verifiable computing, the soundness of our algorithm is information-theoretic and cannot be broken by a computationally unbo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04302","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"},"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:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ofHDFkXSZS8sAJGZj55nrpJoRjJKT1TMv9lYn9ry/yi3aiGW8Lqt4fAAy2VDN0Zuz0QkDft8dfsjXv0IyAgfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:12:37.218525Z"},"content_sha256":"0509f2a5478fedcb536433f293ca334c848a5fc82b616623d9b031d444908898","schema_version":"1.0","event_id":"sha256:0509f2a5478fedcb536433f293ca334c848a5fc82b616623d9b031d444908898"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNGR6VC3U3MKEQOV6ZWURC6DMQ/bundle.json","state_url":"https://pith.science/pith/TNGR6VC3U3MKEQOV6ZWURC6DMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNGR6VC3U3MKEQOV6ZWURC6DMQ/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-25T16:12:37Z","links":{"resolver":"https://pith.science/pith/TNGR6VC3U3MKEQOV6ZWURC6DMQ","bundle":"https://pith.science/pith/TNGR6VC3U3MKEQOV6ZWURC6DMQ/bundle.json","state":"https://pith.science/pith/TNGR6VC3U3MKEQOV6ZWURC6DMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNGR6VC3U3MKEQOV6ZWURC6DMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TNGR6VC3U3MKEQOV6ZWURC6DMQ","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":"3679dc1d33b84c8024664a7465ca3b8111fff53fef485b9cd75f39d9379824e7","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-09T17:40:46Z","title_canon_sha256":"53c4e18baa7f2d74e534bc2d55a7fe3d27c8bbe1ad690107b3277f943c043268"},"schema_version":"1.0","source":{"id":"1907.04302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04302","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04302v1","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04302","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"TNGR6VC3U3MK","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TNGR6VC3U3MKEQOV","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TNGR6VC3","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:0509f2a5478fedcb536433f293ca334c848a5fc82b616623d9b031d444908898","target":"graph","created_at":"2026-05-17T23:41:02Z","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":"Cloud computing platforms have created the possibility for computationally limited users to delegate demanding tasks to strong but untrusted servers. Verifiable computing algorithms help build trust in such interactions by enabling the server to provide a proof of correctness of his results which the user can check very efficiently. In this paper, we present a doubly-efficient interactive algorithm for verifiable polynomial evaluation. Unlike the mainstream literature on verifiable computing, the soundness of our algorithm is information-theoretic and cannot be broken by a computationally unbo","authors_text":"Mohammad Ali Maddah-Ali, Saeid Sahraei, Salman Avestimehr","cross_cats":["cs.CR","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-09T17:40:46Z","title":"Interactive Verifiable Polynomial Evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04302","kind":"arxiv","version":1},"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:32b1163a13a76d9cc47cf5cc3c8c772a336206d81cf97946ccdb8d0e9178a090","target":"record","created_at":"2026-05-17T23:41:02Z","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":"3679dc1d33b84c8024664a7465ca3b8111fff53fef485b9cd75f39d9379824e7","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-09T17:40:46Z","title_canon_sha256":"53c4e18baa7f2d74e534bc2d55a7fe3d27c8bbe1ad690107b3277f943c043268"},"schema_version":"1.0","source":{"id":"1907.04302","kind":"arxiv","version":1}},"canonical_sha256":"9b4d1f545ba6d8a241d5f66d488bc36412990312344e8d11a0a98114d0a78334","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b4d1f545ba6d8a241d5f66d488bc36412990312344e8d11a0a98114d0a78334","first_computed_at":"2026-05-17T23:41:02.723546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:02.723546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pUixlLK5w2y82jlfZAWA1CbjyT1vaxs42OEsW9GtVEjQKGBHD96PYhtaIKUaqHV8GmB+fUDS/1fzpOgKXwr3Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:02.724212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32b1163a13a76d9cc47cf5cc3c8c772a336206d81cf97946ccdb8d0e9178a090","sha256:0509f2a5478fedcb536433f293ca334c848a5fc82b616623d9b031d444908898"],"state_sha256":"a8c0b030639441e3c7bde518b84dce2e330edc30e580702392be4a6b6922914a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnaCec0Q0q5fX25sHLrJj4Y2OHo8KsNmsBbZkX56unTj9xwCxN1PEP1EYOKSMv/RuhDDoplvBn60gEjIb76hDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:12:37.222430Z","bundle_sha256":"f4b775218a81b16d002b7bf071498c6ccd05d400c64129ebfa6d3d96ee76d2ef"}}