{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:X6XEFW2XE4D7ZWTPSYRHEOL5IL","short_pith_number":"pith:X6XEFW2X","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"},"canonical_sha256":"bfae42db572707fcda6f962272397d42f0554c30db06fda1a6dad7f8fee142c0","source":{"kind":"arxiv","id":"1403.7058","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7058","created_at":"2026-05-18T02:38:10Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7058v2","created_at":"2026-05-18T02:38:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7058","created_at":"2026-05-18T02:38:10Z"},{"alias_kind":"pith_short_12","alias_value":"X6XEFW2XE4D7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"X6XEFW2XE4D7ZWTP","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"X6XEFW2X","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:X6XEFW2XE4D7ZWTPSYRHEOL5IL","target":"record","payload":{"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"},"canonical_sha256":"bfae42db572707fcda6f962272397d42f0554c30db06fda1a6dad7f8fee142c0","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"},"source_kind":"arxiv","source_id":"1403.7058","source_version":2,"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-18T02:38:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VDH9KIP0WqaDyqg7fRgap8+ZjJ5HgiRnujL8cdAnWA/uGhIsyOXJBh0nDtTHl2Cpg11ci81Y/Bs7bWMbWXIOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:13:42.662609Z"},"content_sha256":"560bc875d340a0cda8127a48a4e15f47a6f0b9fe35f16b2beed3b3e70e589fdb","schema_version":"1.0","event_id":"sha256:560bc875d340a0cda8127a48a4e15f47a6f0b9fe35f16b2beed3b3e70e589fdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:X6XEFW2XE4D7ZWTPSYRHEOL5IL","target":"graph","payload":{"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"},"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-18T02:38:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6qhLMcJcS3mHZ4em76hWndsapUE0PGLq4ffUtohn9u+nQP33C6IAWrNzA6cnNAuVWJN3R6ZB5OtGnuVjt4yvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:13:42.663298Z"},"content_sha256":"4712a0e116ca5aad2fe86aac339dc8154fb6f2a068f7bb8ff653781bfcdc5106","schema_version":"1.0","event_id":"sha256:4712a0e116ca5aad2fe86aac339dc8154fb6f2a068f7bb8ff653781bfcdc5106"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6XEFW2XE4D7ZWTPSYRHEOL5IL/bundle.json","state_url":"https://pith.science/pith/X6XEFW2XE4D7ZWTPSYRHEOL5IL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6XEFW2XE4D7ZWTPSYRHEOL5IL/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-28T18:13:42Z","links":{"resolver":"https://pith.science/pith/X6XEFW2XE4D7ZWTPSYRHEOL5IL","bundle":"https://pith.science/pith/X6XEFW2XE4D7ZWTPSYRHEOL5IL/bundle.json","state":"https://pith.science/pith/X6XEFW2XE4D7ZWTPSYRHEOL5IL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6XEFW2XE4D7ZWTPSYRHEOL5IL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:X6XEFW2XE4D7ZWTPSYRHEOL5IL","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":"9be51529acece381ef8cac70cdbcb21c9a74572a8ff6d40bec6963aad407626f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-27T14:42:11Z","title_canon_sha256":"595712734bef7b18b3e01351784d7ddba05c6b380267e90765b650d748182567"},"schema_version":"1.0","source":{"id":"1403.7058","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7058","created_at":"2026-05-18T02:38:10Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7058v2","created_at":"2026-05-18T02:38:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7058","created_at":"2026-05-18T02:38:10Z"},{"alias_kind":"pith_short_12","alias_value":"X6XEFW2XE4D7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"X6XEFW2XE4D7ZWTP","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"X6XEFW2X","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:4712a0e116ca5aad2fe86aac339dc8154fb6f2a068f7bb8ff653781bfcdc5106","target":"graph","created_at":"2026-05-18T02:38:10Z","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 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","authors_text":"Alexandr Andoni, David P. Woodruff, Robert Krauthgamer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-27T14:42:11Z","title":"The Sketching Complexity of Graph Cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7058","kind":"arxiv","version":2},"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:560bc875d340a0cda8127a48a4e15f47a6f0b9fe35f16b2beed3b3e70e589fdb","target":"record","created_at":"2026-05-18T02:38:10Z","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":"9be51529acece381ef8cac70cdbcb21c9a74572a8ff6d40bec6963aad407626f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-27T14:42:11Z","title_canon_sha256":"595712734bef7b18b3e01351784d7ddba05c6b380267e90765b650d748182567"},"schema_version":"1.0","source":{"id":"1403.7058","kind":"arxiv","version":2}},"canonical_sha256":"bfae42db572707fcda6f962272397d42f0554c30db06fda1a6dad7f8fee142c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfae42db572707fcda6f962272397d42f0554c30db06fda1a6dad7f8fee142c0","first_computed_at":"2026-05-18T02:38:10.105714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:10.105714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Apw+9hKSoPVcl6oDrvg3r2420hicMtPImIcOvCO5mkw6ZVVWPna8l2EO6e2u+xeNv96wHQ6Uwzdg6W6G21qDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:10.106361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.7058","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:560bc875d340a0cda8127a48a4e15f47a6f0b9fe35f16b2beed3b3e70e589fdb","sha256:4712a0e116ca5aad2fe86aac339dc8154fb6f2a068f7bb8ff653781bfcdc5106"],"state_sha256":"1b3acb61c634cb3504062c6e4dcd0a8e5e2f0ae3ec10aa9794e844daaa68de5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UMxP0mv7xJQY1s0wI/ylfPris4vzN5kSrVUJvEUUxfPoZCpp/RQ44voogWbfBIfE7wbVq13s4rNTCYD1L4iVDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:13:42.667541Z","bundle_sha256":"f3b84d352a2a0f1ef8838881906f499175895f1cd9808cfbb11111c4ac6f6115"}}