{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:J74YCYCQGMGKSODO26VSMENKP6","short_pith_number":"pith:J74YCYCQ","canonical_record":{"source":{"id":"1704.02768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-04-10T09:05:53Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"be8650dc006157b9c51d1318fe79d85cd2d9be77e54e1483e8529bad37216409","abstract_canon_sha256":"bfd2b4dc8200abac979a5bac00bde7b3da7dfa361fcfbef0f12dab97713a23ca"},"schema_version":"1.0"},"canonical_sha256":"4ff9816050330ca9386ed7ab2611aa7fb235a8e087e697417337b1430b5d748b","source":{"kind":"arxiv","id":"1704.02768","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02768","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02768v1","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02768","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"pith_short_12","alias_value":"J74YCYCQGMGK","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J74YCYCQGMGKSODO","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J74YCYCQ","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:J74YCYCQGMGKSODO26VSMENKP6","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-04-10T09:05:53Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"be8650dc006157b9c51d1318fe79d85cd2d9be77e54e1483e8529bad37216409","abstract_canon_sha256":"bfd2b4dc8200abac979a5bac00bde7b3da7dfa361fcfbef0f12dab97713a23ca"},"schema_version":"1.0"},"canonical_sha256":"4ff9816050330ca9386ed7ab2611aa7fb235a8e087e697417337b1430b5d748b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:44.454110Z","signature_b64":"P3yz7jZoxAppVHzyXw05L9ZewgaPiuYQUGC0Ctb+0inSAyZUYBtHLlyvxR3NHmyTozkYuYO5ZPVwas0Ea40SCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ff9816050330ca9386ed7ab2611aa7fb235a8e087e697417337b1430b5d748b","last_reissued_at":"2026-05-18T00:46:44.453507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:44.453507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02768","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-18T00:46:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ly5v7yQv6lCkbkKbjT6usLRlUAHJxkeNQRkh5c8h5LcYgmN5qpHx13kFW+TaeiPcJd7W5Sbd91Ywub4VDYcfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:16:54.880534Z"},"content_sha256":"ad12be38b97dfb48ba76a6317a65206892e421659677d71a57daea60eaec4c6d","schema_version":"1.0","event_id":"sha256:ad12be38b97dfb48ba76a6317a65206892e421659677d71a57daea60eaec4c6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:J74YCYCQGMGKSODO26VSMENKP6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Prover efficient public verification of dense or sparse/structured matrix-vector multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.CR","authors_text":"Jean-Guillaume Dumas (CASYS), Vincent Zucca (PEQUAN)","submitted_at":"2017-04-10T09:05:53Z","abstract_excerpt":"With the emergence of cloud computing services, computationally weak devices (Clients) can delegate expensive tasks to more powerful entities (Servers). This raises the question of verifying a result at a lower cost than that of recomputing it. This verification can be private, between the Client and the Server, or public, when the result can be verified by any third party. We here present protocols for the verification of matrix-vector multiplications, that are secure against malicious Servers. The obtained algorithms are essentially optimal in the amortized model: the overhead for the Server"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02768","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-18T00:46:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b90Rma4dlAYx597MijQ1z8vn7z1Uok9g5gpBKK5QoImlMkCtTj6LFStrxMCJKy7+64zNRSpOPtyf4kqGE0S9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:16:54.880882Z"},"content_sha256":"3dd336ef12dbd63e8386b08f5277a34e72e7085fb278b930e654f2470722dcc2","schema_version":"1.0","event_id":"sha256:3dd336ef12dbd63e8386b08f5277a34e72e7085fb278b930e654f2470722dcc2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J74YCYCQGMGKSODO26VSMENKP6/bundle.json","state_url":"https://pith.science/pith/J74YCYCQGMGKSODO26VSMENKP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J74YCYCQGMGKSODO26VSMENKP6/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-06-23T21:16:54Z","links":{"resolver":"https://pith.science/pith/J74YCYCQGMGKSODO26VSMENKP6","bundle":"https://pith.science/pith/J74YCYCQGMGKSODO26VSMENKP6/bundle.json","state":"https://pith.science/pith/J74YCYCQGMGKSODO26VSMENKP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J74YCYCQGMGKSODO26VSMENKP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:J74YCYCQGMGKSODO26VSMENKP6","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":"bfd2b4dc8200abac979a5bac00bde7b3da7dfa361fcfbef0f12dab97713a23ca","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-04-10T09:05:53Z","title_canon_sha256":"be8650dc006157b9c51d1318fe79d85cd2d9be77e54e1483e8529bad37216409"},"schema_version":"1.0","source":{"id":"1704.02768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02768","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02768v1","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02768","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"pith_short_12","alias_value":"J74YCYCQGMGK","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J74YCYCQGMGKSODO","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J74YCYCQ","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:3dd336ef12dbd63e8386b08f5277a34e72e7085fb278b930e654f2470722dcc2","target":"graph","created_at":"2026-05-18T00:46:44Z","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":"With the emergence of cloud computing services, computationally weak devices (Clients) can delegate expensive tasks to more powerful entities (Servers). This raises the question of verifying a result at a lower cost than that of recomputing it. This verification can be private, between the Client and the Server, or public, when the result can be verified by any third party. We here present protocols for the verification of matrix-vector multiplications, that are secure against malicious Servers. The obtained algorithms are essentially optimal in the amortized model: the overhead for the Server","authors_text":"Jean-Guillaume Dumas (CASYS), Vincent Zucca (PEQUAN)","cross_cats":["cs.SC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-04-10T09:05:53Z","title":"Prover efficient public verification of dense or sparse/structured matrix-vector multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02768","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:ad12be38b97dfb48ba76a6317a65206892e421659677d71a57daea60eaec4c6d","target":"record","created_at":"2026-05-18T00:46:44Z","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":"bfd2b4dc8200abac979a5bac00bde7b3da7dfa361fcfbef0f12dab97713a23ca","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-04-10T09:05:53Z","title_canon_sha256":"be8650dc006157b9c51d1318fe79d85cd2d9be77e54e1483e8529bad37216409"},"schema_version":"1.0","source":{"id":"1704.02768","kind":"arxiv","version":1}},"canonical_sha256":"4ff9816050330ca9386ed7ab2611aa7fb235a8e087e697417337b1430b5d748b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ff9816050330ca9386ed7ab2611aa7fb235a8e087e697417337b1430b5d748b","first_computed_at":"2026-05-18T00:46:44.453507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:44.453507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P3yz7jZoxAppVHzyXw05L9ZewgaPiuYQUGC0Ctb+0inSAyZUYBtHLlyvxR3NHmyTozkYuYO5ZPVwas0Ea40SCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:44.454110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad12be38b97dfb48ba76a6317a65206892e421659677d71a57daea60eaec4c6d","sha256:3dd336ef12dbd63e8386b08f5277a34e72e7085fb278b930e654f2470722dcc2"],"state_sha256":"8d05858839a14ec3d1035f5c1ed2112b552f9205764f9bb2188f602864e19616"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EC5cGHsg552M+nDVOTOR9V1HTPMIaZ93rumcrob6CwEl8cVzVgnaD0dx9k1Lkl4Mqs20BPszbRsitpOC/u2yBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T21:16:54.882881Z","bundle_sha256":"70a743c420b8c9422c8eb6ac0fb7e3d574913c6df784f174893908aaed35717b"}}