{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CQZ3SAGO4UIJPQXEWVTPJSLZ75","short_pith_number":"pith:CQZ3SAGO","schema_version":"1.0","canonical_sha256":"1433b900cee51097c2e4b566f4c979ff40ac08004278bd298ac49ffa9446bf80","source":{"kind":"arxiv","id":"2606.13182","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.13182","created_at":"2026-06-12T01:09:45.544035+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.13182v1","created_at":"2026-06-12T01:09:45.544035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13182","created_at":"2026-06-12T01:09:45.544035+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQZ3SAGO4UIJ","created_at":"2026-06-12T01:09:45.544035+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQZ3SAGO4UIJPQXE","created_at":"2026-06-12T01:09:45.544035+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQZ3SAGO","created_at":"2026-06-12T01:09:45.544035+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/CQZ3SAGO4UIJPQXEWVTPJSLZ75","json":"https://pith.science/pith/CQZ3SAGO4UIJPQXEWVTPJSLZ75.json","graph_json":"https://pith.science/api/pith-number/CQZ3SAGO4UIJPQXEWVTPJSLZ75/graph.json","events_json":"https://pith.science/api/pith-number/CQZ3SAGO4UIJPQXEWVTPJSLZ75/events.json","paper":"https://pith.science/paper/CQZ3SAGO"},"agent_actions":{"view_html":"https://pith.science/pith/CQZ3SAGO4UIJPQXEWVTPJSLZ75","download_json":"https://pith.science/pith/CQZ3SAGO4UIJPQXEWVTPJSLZ75.json","view_paper":"https://pith.science/paper/CQZ3SAGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.13182&json=true","fetch_graph":"https://pith.science/api/pith-number/CQZ3SAGO4UIJPQXEWVTPJSLZ75/graph.json","fetch_events":"https://pith.science/api/pith-number/CQZ3SAGO4UIJPQXEWVTPJSLZ75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQZ3SAGO4UIJPQXEWVTPJSLZ75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQZ3SAGO4UIJPQXEWVTPJSLZ75/action/storage_attestation","attest_author":"https://pith.science/pith/CQZ3SAGO4UIJPQXEWVTPJSLZ75/action/author_attestation","sign_citation":"https://pith.science/pith/CQZ3SAGO4UIJPQXEWVTPJSLZ75/action/citation_signature","submit_replication":"https://pith.science/pith/CQZ3SAGO4UIJPQXEWVTPJSLZ75/action/replication_record"}},"created_at":"2026-06-12T01:09:45.544035+00:00","updated_at":"2026-06-12T01:09:45.544035+00:00"}