{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6JQMU73KHJADWGUR5PMWSWJDBB","short_pith_number":"pith:6JQMU73K","canonical_record":{"source":{"id":"1712.10261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-29T15:44:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"22c14df9f2b64c20f7589457406bcd55ae0f4b2600352673aa73b7293e4e8c1f","abstract_canon_sha256":"53becd27026e05a314f974ef339a0083a2a3759b4c7617fb941e9092c5e75f3a"},"schema_version":"1.0"},"canonical_sha256":"f260ca7f6a3a403b1a91ebd96959230871c3e51c1630a77c6076c4480afa78d1","source":{"kind":"arxiv","id":"1712.10261","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10261","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10261v1","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10261","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"6JQMU73KHJAD","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6JQMU73KHJADWGUR","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6JQMU73K","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6JQMU73KHJADWGUR5PMWSWJDBB","target":"record","payload":{"canonical_record":{"source":{"id":"1712.10261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-29T15:44:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"22c14df9f2b64c20f7589457406bcd55ae0f4b2600352673aa73b7293e4e8c1f","abstract_canon_sha256":"53becd27026e05a314f974ef339a0083a2a3759b4c7617fb941e9092c5e75f3a"},"schema_version":"1.0"},"canonical_sha256":"f260ca7f6a3a403b1a91ebd96959230871c3e51c1630a77c6076c4480afa78d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:03.578793Z","signature_b64":"QGUINtq11Cg7p9J5mhINgVyv0mMDSeKyMJ/B5fzBwMTSSx9G0Qs2feSNp3si+iuw6NpjjLA+WRzXChOs/ThbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f260ca7f6a3a403b1a91ebd96959230871c3e51c1630a77c6076c4480afa78d1","last_reissued_at":"2026-05-18T00:27:03.578123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:03.578123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.10261","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:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ml4fgXlN9wTQMO1Gah/g9tDJXVvrg4JUyeShcU/+ECqO1RUpdd0hjuWxZKbtHL4eO6+4ywGTzulL8SGVPjrPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:07:33.133272Z"},"content_sha256":"280f8954a2e42dd700999d241538c318b9433144f6b6914938968c5797c68055","schema_version":"1.0","event_id":"sha256:280f8954a2e42dd700999d241538c318b9433144f6b6914938968c5797c68055"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6JQMU73KHJADWGUR5PMWSWJDBB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Lower Bounds for Sketching Graph Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Alexandra Kolla, Charles Carlson, Luca Trevisan, Nikhil Srivastava","submitted_at":"2017-12-29T15:44:08Z","abstract_excerpt":"We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undirected graph on $n$ vertices up to a $1+\\epsilon$ error must use $\\Omega(n\\log n/\\epsilon^2)$ bits of space in the worst case, improving the $\\Omega(n/\\epsilon^2)$ bound of Andoni et al. and matching the best known upper bound achieved by spectral sparsifiers. Our proof is based on a rigidity phenomenon for cut (and spectral) approximation which may be of independent interest: any two $d-$regular graphs which approxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10261","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:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yRuRGbOMhl26VCEe4l1odblMLq+ChfYZ+OSDQsyU+ps0Fq1M8Mz4ACcbAy656CvGhwIBkdtLmeUfw/MDUFozBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:07:33.133862Z"},"content_sha256":"7265f449de4cbe337b064d8644e538dfe331eb7d149ad7d084c57bbea16bb82f","schema_version":"1.0","event_id":"sha256:7265f449de4cbe337b064d8644e538dfe331eb7d149ad7d084c57bbea16bb82f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JQMU73KHJADWGUR5PMWSWJDBB/bundle.json","state_url":"https://pith.science/pith/6JQMU73KHJADWGUR5PMWSWJDBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JQMU73KHJADWGUR5PMWSWJDBB/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-07T08:07:33Z","links":{"resolver":"https://pith.science/pith/6JQMU73KHJADWGUR5PMWSWJDBB","bundle":"https://pith.science/pith/6JQMU73KHJADWGUR5PMWSWJDBB/bundle.json","state":"https://pith.science/pith/6JQMU73KHJADWGUR5PMWSWJDBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JQMU73KHJADWGUR5PMWSWJDBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6JQMU73KHJADWGUR5PMWSWJDBB","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":"53becd27026e05a314f974ef339a0083a2a3759b4c7617fb941e9092c5e75f3a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-29T15:44:08Z","title_canon_sha256":"22c14df9f2b64c20f7589457406bcd55ae0f4b2600352673aa73b7293e4e8c1f"},"schema_version":"1.0","source":{"id":"1712.10261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10261","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10261v1","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10261","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"6JQMU73KHJAD","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6JQMU73KHJADWGUR","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6JQMU73K","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:7265f449de4cbe337b064d8644e538dfe331eb7d149ad7d084c57bbea16bb82f","target":"graph","created_at":"2026-05-18T00:27:03Z","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 space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undirected graph on $n$ vertices up to a $1+\\epsilon$ error must use $\\Omega(n\\log n/\\epsilon^2)$ bits of space in the worst case, improving the $\\Omega(n/\\epsilon^2)$ bound of Andoni et al. and matching the best known upper bound achieved by spectral sparsifiers. Our proof is based on a rigidity phenomenon for cut (and spectral) approximation which may be of independent interest: any two $d-$regular graphs which approxi","authors_text":"Alexandra Kolla, Charles Carlson, Luca Trevisan, Nikhil Srivastava","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-29T15:44:08Z","title":"Optimal Lower Bounds for Sketching Graph Cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10261","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:280f8954a2e42dd700999d241538c318b9433144f6b6914938968c5797c68055","target":"record","created_at":"2026-05-18T00:27:03Z","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":"53becd27026e05a314f974ef339a0083a2a3759b4c7617fb941e9092c5e75f3a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-29T15:44:08Z","title_canon_sha256":"22c14df9f2b64c20f7589457406bcd55ae0f4b2600352673aa73b7293e4e8c1f"},"schema_version":"1.0","source":{"id":"1712.10261","kind":"arxiv","version":1}},"canonical_sha256":"f260ca7f6a3a403b1a91ebd96959230871c3e51c1630a77c6076c4480afa78d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f260ca7f6a3a403b1a91ebd96959230871c3e51c1630a77c6076c4480afa78d1","first_computed_at":"2026-05-18T00:27:03.578123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:03.578123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QGUINtq11Cg7p9J5mhINgVyv0mMDSeKyMJ/B5fzBwMTSSx9G0Qs2feSNp3si+iuw6NpjjLA+WRzXChOs/ThbCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:03.578793Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.10261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:280f8954a2e42dd700999d241538c318b9433144f6b6914938968c5797c68055","sha256:7265f449de4cbe337b064d8644e538dfe331eb7d149ad7d084c57bbea16bb82f"],"state_sha256":"9d279cacf775942b7644175178436988d77ed1e5d884a993dbb537aa45e2fcd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YGrINU+MrPVrbgQeiSUnf6FtyPOZAVI1GqVJ9vqg8EsWfCWXveChX2TZAVOhEzijmpnpVuoGGDX2hINgP8VTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T08:07:33.136850Z","bundle_sha256":"de2ccc8561963512e888348b9ece7c9f5a5678d1d1080690bec61f623da920ef"}}