{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:X6XEFW2XE4D7ZWTPSYRHEOL5IL","short_pith_number":"pith:X6XEFW2X","schema_version":"1.0","canonical_sha256":"bfae42db572707fcda6f962272397d42f0554c30db06fda1a6dad7f8fee142c0","source":{"kind":"arxiv","id":"1403.7058","version":2},"attestation_state":"computed","paper":{"title":"The Sketching Complexity of Graph Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandr Andoni, David P. Woodruff, Robert Krauthgamer","submitted_at":"2014-03-27T14:42:11Z","abstract_excerpt":"We study the problem of sketching an input graph, so that given the sketch, one can estimate the weight of any cut in the graph within factor $1+\\epsilon$. We present lower and upper bounds on the size of a randomized sketch, focusing on the dependence on the accuracy parameter $\\epsilon>0$.\n  First, we prove that for every $\\epsilon > 1/\\sqrt n$, every sketch that succeeds (with constant probability) in estimating the weight of all cuts $(S,\\bar S)$ in an $n$-vertex graph (simultaneously), must be of size $\\Omega(n/\\epsilon^2)$ bits. In the special case where the sketch is itself a weighted g"},"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":"1403.7058","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-27T14:42:11Z","cross_cats_sorted":[],"title_canon_sha256":"595712734bef7b18b3e01351784d7ddba05c6b380267e90765b650d748182567","abstract_canon_sha256":"9be51529acece381ef8cac70cdbcb21c9a74572a8ff6d40bec6963aad407626f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:10.106361Z","signature_b64":"8Apw+9hKSoPVcl6oDrvg3r2420hicMtPImIcOvCO5mkw6ZVVWPna8l2EO6e2u+xeNv96wHQ6Uwzdg6W6G21qDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfae42db572707fcda6f962272397d42f0554c30db06fda1a6dad7f8fee142c0","last_reissued_at":"2026-05-18T02:38:10.105714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:10.105714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Sketching Complexity of Graph Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandr Andoni, David P. Woodruff, Robert Krauthgamer","submitted_at":"2014-03-27T14:42:11Z","abstract_excerpt":"We study the problem of sketching an input graph, so that given the sketch, one can estimate the weight of any cut in the graph within factor $1+\\epsilon$. We present lower and upper bounds on the size of a randomized sketch, focusing on the dependence on the accuracy parameter $\\epsilon>0$.\n  First, we prove that for every $\\epsilon > 1/\\sqrt n$, every sketch that succeeds (with constant probability) in estimating the weight of all cuts $(S,\\bar S)$ in an $n$-vertex graph (simultaneously), must be of size $\\Omega(n/\\epsilon^2)$ bits. In the special case where the sketch is itself a weighted g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7058","kind":"arxiv","version":2},"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":"1403.7058","created_at":"2026-05-18T02:38:10.105801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.7058v2","created_at":"2026-05-18T02:38:10.105801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7058","created_at":"2026-05-18T02:38:10.105801+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6XEFW2XE4D7","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6XEFW2XE4D7ZWTP","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6XEFW2X","created_at":"2026-05-18T12:28:57.508820+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/X6XEFW2XE4D7ZWTPSYRHEOL5IL","json":"https://pith.science/pith/X6XEFW2XE4D7ZWTPSYRHEOL5IL.json","graph_json":"https://pith.science/api/pith-number/X6XEFW2XE4D7ZWTPSYRHEOL5IL/graph.json","events_json":"https://pith.science/api/pith-number/X6XEFW2XE4D7ZWTPSYRHEOL5IL/events.json","paper":"https://pith.science/paper/X6XEFW2X"},"agent_actions":{"view_html":"https://pith.science/pith/X6XEFW2XE4D7ZWTPSYRHEOL5IL","download_json":"https://pith.science/pith/X6XEFW2XE4D7ZWTPSYRHEOL5IL.json","view_paper":"https://pith.science/paper/X6XEFW2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.7058&json=true","fetch_graph":"https://pith.science/api/pith-number/X6XEFW2XE4D7ZWTPSYRHEOL5IL/graph.json","fetch_events":"https://pith.science/api/pith-number/X6XEFW2XE4D7ZWTPSYRHEOL5IL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6XEFW2XE4D7ZWTPSYRHEOL5IL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6XEFW2XE4D7ZWTPSYRHEOL5IL/action/storage_attestation","attest_author":"https://pith.science/pith/X6XEFW2XE4D7ZWTPSYRHEOL5IL/action/author_attestation","sign_citation":"https://pith.science/pith/X6XEFW2XE4D7ZWTPSYRHEOL5IL/action/citation_signature","submit_replication":"https://pith.science/pith/X6XEFW2XE4D7ZWTPSYRHEOL5IL/action/replication_record"}},"created_at":"2026-05-18T02:38:10.105801+00:00","updated_at":"2026-05-18T02:38:10.105801+00:00"}