{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CQZ3SAGO4UIJPQXEWVTPJSLZ75","short_pith_number":"pith:CQZ3SAGO","canonical_record":{"source":{"id":"2606.13182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T10:50:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"45a086d9599f4f1f7cde4828ad54e828778f8859a26a062d310910d40239f274","abstract_canon_sha256":"ea8ab571313b7e2d8959746f786742fec15694a1716044b98918854309a59434"},"schema_version":"1.0"},"canonical_sha256":"1433b900cee51097c2e4b566f4c979ff40ac08004278bd298ac49ffa9446bf80","source":{"kind":"arxiv","id":"2606.13182","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13182","created_at":"2026-06-12T01:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13182v1","created_at":"2026-06-12T01:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13182","created_at":"2026-06-12T01:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"CQZ3SAGO4UIJ","created_at":"2026-06-12T01:09:45Z"},{"alias_kind":"pith_short_16","alias_value":"CQZ3SAGO4UIJPQXE","created_at":"2026-06-12T01:09:45Z"},{"alias_kind":"pith_short_8","alias_value":"CQZ3SAGO","created_at":"2026-06-12T01:09:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CQZ3SAGO4UIJPQXEWVTPJSLZ75","target":"record","payload":{"canonical_record":{"source":{"id":"2606.13182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T10:50:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"45a086d9599f4f1f7cde4828ad54e828778f8859a26a062d310910d40239f274","abstract_canon_sha256":"ea8ab571313b7e2d8959746f786742fec15694a1716044b98918854309a59434"},"schema_version":"1.0"},"canonical_sha256":"1433b900cee51097c2e4b566f4c979ff40ac08004278bd298ac49ffa9446bf80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:45.544731Z","signature_b64":"hWPrSKNz9DMS82WfyM3Z1xmbQNKKCC1zaf757Igw7w1mlv4gMB1yKSGUC1j0UcGmo8JufiHZz4TsOe1Uq/Z2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1433b900cee51097c2e4b566f4c979ff40ac08004278bd298ac49ffa9446bf80","last_reissued_at":"2026-06-12T01:09:45.543902Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:45.543902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.13182","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-06-12T01:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dLYZTJ9MTkh9XqSLuNrgJOGiCXKhz5s6uI5CjiCHccp5PnuisvYoZatORgefnZgfMlJQUM1IT+yRJSvxCVBoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:49:51.819549Z"},"content_sha256":"1a511c484fdbab60340ec49131853e6619c133563b474f22891462f7258e80c8","schema_version":"1.0","event_id":"sha256:1a511c484fdbab60340ec49131853e6619c133563b474f22891462f7258e80c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CQZ3SAGO4UIJPQXEWVTPJSLZ75","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Alessandro Panconesi, Andrew Tomkins, Erasmo Tani, Flavio Chierichetti, Mirko Giacchini, Ravi Kumar","submitted_at":"2026-06-11T10:50:45Z","abstract_excerpt":"In this work we settle the complexity of three sketching problems. (i) We show that sketching vertex neighborhood sizes in graphs requires $\\Omega(n^2)$ bits, standing in sharp contrast to the $\\tilde{O}(n)$ complexity of sketching edge cuts. (ii) We obtain tight lower and upper bounds of $\\tilde{\\Theta}(n^2)$ for sketching coverage functions with additive and multiplicative errors. (iii) We prove an $\\Omega(n^2)$ lower bound for sketching Random Utility Models under the $\\ell_\\infty$-norm, improving upon the previous $\\Omega(n \\log n)$ bound and matching a known upper bound to within logarith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13182","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/2606.13182/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"},"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-06-12T01:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqvpI+2/rpJevFDr2wOmeaZKwWvq6y7EtxqHyZxgcNjm3vkATSVLowPJICi4iP906qIY5ozckRx6jUnkBO+5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:49:51.820504Z"},"content_sha256":"8b602b3914ede7c0264217f8377ee854b3db10492a84315614798fff0048dacd","schema_version":"1.0","event_id":"sha256:8b602b3914ede7c0264217f8377ee854b3db10492a84315614798fff0048dacd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQZ3SAGO4UIJPQXEWVTPJSLZ75/bundle.json","state_url":"https://pith.science/pith/CQZ3SAGO4UIJPQXEWVTPJSLZ75/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQZ3SAGO4UIJPQXEWVTPJSLZ75/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-08-04T11:49:51Z","links":{"resolver":"https://pith.science/pith/CQZ3SAGO4UIJPQXEWVTPJSLZ75","bundle":"https://pith.science/pith/CQZ3SAGO4UIJPQXEWVTPJSLZ75/bundle.json","state":"https://pith.science/pith/CQZ3SAGO4UIJPQXEWVTPJSLZ75/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQZ3SAGO4UIJPQXEWVTPJSLZ75/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CQZ3SAGO4UIJPQXEWVTPJSLZ75","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":"ea8ab571313b7e2d8959746f786742fec15694a1716044b98918854309a59434","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T10:50:45Z","title_canon_sha256":"45a086d9599f4f1f7cde4828ad54e828778f8859a26a062d310910d40239f274"},"schema_version":"1.0","source":{"id":"2606.13182","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13182","created_at":"2026-06-12T01:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13182v1","created_at":"2026-06-12T01:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13182","created_at":"2026-06-12T01:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"CQZ3SAGO4UIJ","created_at":"2026-06-12T01:09:45Z"},{"alias_kind":"pith_short_16","alias_value":"CQZ3SAGO4UIJPQXE","created_at":"2026-06-12T01:09:45Z"},{"alias_kind":"pith_short_8","alias_value":"CQZ3SAGO","created_at":"2026-06-12T01:09:45Z"}],"graph_snapshots":[{"event_id":"sha256:8b602b3914ede7c0264217f8377ee854b3db10492a84315614798fff0048dacd","target":"graph","created_at":"2026-06-12T01:09:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.13182/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work we settle the complexity of three sketching problems. (i) We show that sketching vertex neighborhood sizes in graphs requires $\\Omega(n^2)$ bits, standing in sharp contrast to the $\\tilde{O}(n)$ complexity of sketching edge cuts. (ii) We obtain tight lower and upper bounds of $\\tilde{\\Theta}(n^2)$ for sketching coverage functions with additive and multiplicative errors. (iii) We prove an $\\Omega(n^2)$ lower bound for sketching Random Utility Models under the $\\ell_\\infty$-norm, improving upon the previous $\\Omega(n \\log n)$ bound and matching a known upper bound to within logarith","authors_text":"Alessandro Panconesi, Andrew Tomkins, Erasmo Tani, Flavio Chierichetti, Mirko Giacchini, Ravi Kumar","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13182","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:1a511c484fdbab60340ec49131853e6619c133563b474f22891462f7258e80c8","target":"record","created_at":"2026-06-12T01:09:45Z","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":"ea8ab571313b7e2d8959746f786742fec15694a1716044b98918854309a59434","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T10:50:45Z","title_canon_sha256":"45a086d9599f4f1f7cde4828ad54e828778f8859a26a062d310910d40239f274"},"schema_version":"1.0","source":{"id":"2606.13182","kind":"arxiv","version":1}},"canonical_sha256":"1433b900cee51097c2e4b566f4c979ff40ac08004278bd298ac49ffa9446bf80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1433b900cee51097c2e4b566f4c979ff40ac08004278bd298ac49ffa9446bf80","first_computed_at":"2026-06-12T01:09:45.543902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:45.543902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hWPrSKNz9DMS82WfyM3Z1xmbQNKKCC1zaf757Igw7w1mlv4gMB1yKSGUC1j0UcGmo8JufiHZz4TsOe1Uq/Z2CQ==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:45.544731Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.13182","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a511c484fdbab60340ec49131853e6619c133563b474f22891462f7258e80c8","sha256:8b602b3914ede7c0264217f8377ee854b3db10492a84315614798fff0048dacd"],"state_sha256":"17654cf22293c5e6802a774e599d24edd605490625c3106a7095ba4b76af990a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m5W2+305Y6Ww6JynzcfMyRibX6f0BQL7d0zelYU5w4IVJLOTz6SqbD3jl1zoRDRcoU2nCKloSWRb4pOYil2JAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T11:49:51.825158Z","bundle_sha256":"38b10ec8b33300f9c0161b0026726f6eabdb7f11b10e5d86c0d77333e5152dd8"}}