{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XLWHZRRMQMMNCCFODFRAOT2IRP","short_pith_number":"pith:XLWHZRRM","schema_version":"1.0","canonical_sha256":"baec7cc62c8318d108ae1962074f488bd29478fd8ee5799b840bb4c438ecf31a","source":{"kind":"arxiv","id":"2007.03039","version":1},"attestation_state":"computed","paper":{"title":"Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Chakrabarti, Justin Thaler, Prantar Ghosh","submitted_at":"2020-07-06T19:57:52Z","abstract_excerpt":"We study graph computations in an enhanced data streaming setting, where a space-bounded client reading the edge stream of a massive graph may delegate some of its work to a cloud service. We seek algorithms that allow the client to verify a purported proof sent by the cloud service that the work done in the cloud is correct. A line of work starting with Chakrabarti et al. (ICALP 2009) has provided such algorithms, which we call schemes, for several statistical and graph-theoretic problems, many of which exhibit a tradeoff between the length of the proof and the space used by the streaming ver"},"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":"2007.03039","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-07-06T19:57:52Z","cross_cats_sorted":[],"title_canon_sha256":"cfbbe7bbb6010f7ba9ca092857a458060a491ebb373efc78602c0f3936d56d2f","abstract_canon_sha256":"57475b540b7cde714e4020be188f66a0232471ec1932eb7b249429100a9bf98f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:58.980441Z","signature_b64":"Mr/MR8JM//tmzJTvA27yxCMIKCSD3jzp3wUPR9A7Q2tA63RoBmJp/skt+1HP1jnHqhdmFHGadATXhdyP3WYMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baec7cc62c8318d108ae1962074f488bd29478fd8ee5799b840bb4c438ecf31a","last_reissued_at":"2026-07-05T01:16:58.980043Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:58.980043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Chakrabarti, Justin Thaler, Prantar Ghosh","submitted_at":"2020-07-06T19:57:52Z","abstract_excerpt":"We study graph computations in an enhanced data streaming setting, where a space-bounded client reading the edge stream of a massive graph may delegate some of its work to a cloud service. We seek algorithms that allow the client to verify a purported proof sent by the cloud service that the work done in the cloud is correct. A line of work starting with Chakrabarti et al. (ICALP 2009) has provided such algorithms, which we call schemes, for several statistical and graph-theoretic problems, many of which exhibit a tradeoff between the length of the proof and the space used by the streaming ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03039","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.03039/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.03039","created_at":"2026-07-05T01:16:58.980099+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.03039v1","created_at":"2026-07-05T01:16:58.980099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03039","created_at":"2026-07-05T01:16:58.980099+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLWHZRRMQMMN","created_at":"2026-07-05T01:16:58.980099+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLWHZRRMQMMNCCFO","created_at":"2026-07-05T01:16:58.980099+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLWHZRRM","created_at":"2026-07-05T01:16:58.980099+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/XLWHZRRMQMMNCCFODFRAOT2IRP","json":"https://pith.science/pith/XLWHZRRMQMMNCCFODFRAOT2IRP.json","graph_json":"https://pith.science/api/pith-number/XLWHZRRMQMMNCCFODFRAOT2IRP/graph.json","events_json":"https://pith.science/api/pith-number/XLWHZRRMQMMNCCFODFRAOT2IRP/events.json","paper":"https://pith.science/paper/XLWHZRRM"},"agent_actions":{"view_html":"https://pith.science/pith/XLWHZRRMQMMNCCFODFRAOT2IRP","download_json":"https://pith.science/pith/XLWHZRRMQMMNCCFODFRAOT2IRP.json","view_paper":"https://pith.science/paper/XLWHZRRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.03039&json=true","fetch_graph":"https://pith.science/api/pith-number/XLWHZRRMQMMNCCFODFRAOT2IRP/graph.json","fetch_events":"https://pith.science/api/pith-number/XLWHZRRMQMMNCCFODFRAOT2IRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLWHZRRMQMMNCCFODFRAOT2IRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLWHZRRMQMMNCCFODFRAOT2IRP/action/storage_attestation","attest_author":"https://pith.science/pith/XLWHZRRMQMMNCCFODFRAOT2IRP/action/author_attestation","sign_citation":"https://pith.science/pith/XLWHZRRMQMMNCCFODFRAOT2IRP/action/citation_signature","submit_replication":"https://pith.science/pith/XLWHZRRMQMMNCCFODFRAOT2IRP/action/replication_record"}},"created_at":"2026-07-05T01:16:58.980099+00:00","updated_at":"2026-07-05T01:16:58.980099+00:00"}