{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ANRVYEJR76F5OD7MWP2SN67KF3","short_pith_number":"pith:ANRVYEJR","schema_version":"1.0","canonical_sha256":"03635c1131ff8bd70fecb3f526fbea2ec2d9b18d23964d22c59af0493cb56acf","source":{"kind":"arxiv","id":"2209.04539","version":3},"attestation_state":"computed","paper":{"title":"Spectral hypergraph sparsification via chaining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"math.PR","authors_text":"James R. Lee","submitted_at":"2022-09-09T22:07:25Z","abstract_excerpt":"In a hypergraph on $n$ vertices where $D$ is the maximum size of a hyperedge, there is a weighted hypergraph spectral $\\varepsilon$-sparsifier with at most $O(\\varepsilon^{-2} \\log(D) \\cdot n \\log n)$ hyperedges. This improves over the bound of Kapralov, Krauthgamer, Tardos and Yoshida (2021) who achieve $O(\\varepsilon^{-4} n (\\log n)^3)$, as well as the bound $O(\\varepsilon^{-2} D^3 n \\log n)$ obtained by Bansal, Svensson, and Trevisan (2019). The same sparsification result was obtained independently by Jambulapati, Liu, and Sidford (2022)."},"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":"2209.04539","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2022-09-09T22:07:25Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"9990327e6d084889599f0fb47f485bb05eb3e9caa073b7697cb14bb934cf81c0","abstract_canon_sha256":"8cba35280bad8e139872dade0b813039d668dbbc795417ae617813c929aa5543"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:00:27.449343Z","signature_b64":"GpELJNJmKU3+Qga+3AB2OlJH+OrLIzdB5C79ndL21KJNGT0g4yQZYGXBLMxdJOFt1AXcYEHGtTo20u1X9G5/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03635c1131ff8bd70fecb3f526fbea2ec2d9b18d23964d22c59af0493cb56acf","last_reissued_at":"2026-07-05T05:00:27.448809Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:00:27.448809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral hypergraph sparsification via chaining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"math.PR","authors_text":"James R. Lee","submitted_at":"2022-09-09T22:07:25Z","abstract_excerpt":"In a hypergraph on $n$ vertices where $D$ is the maximum size of a hyperedge, there is a weighted hypergraph spectral $\\varepsilon$-sparsifier with at most $O(\\varepsilon^{-2} \\log(D) \\cdot n \\log n)$ hyperedges. This improves over the bound of Kapralov, Krauthgamer, Tardos and Yoshida (2021) who achieve $O(\\varepsilon^{-4} n (\\log n)^3)$, as well as the bound $O(\\varepsilon^{-2} D^3 n \\log n)$ obtained by Bansal, Svensson, and Trevisan (2019). The same sparsification result was obtained independently by Jambulapati, Liu, and Sidford (2022)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.04539","kind":"arxiv","version":3},"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/2209.04539/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":"2209.04539","created_at":"2026-07-05T05:00:27.448871+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.04539v3","created_at":"2026-07-05T05:00:27.448871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.04539","created_at":"2026-07-05T05:00:27.448871+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANRVYEJR76F5","created_at":"2026-07-05T05:00:27.448871+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANRVYEJR76F5OD7M","created_at":"2026-07-05T05:00:27.448871+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANRVYEJR","created_at":"2026-07-05T05:00:27.448871+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.16270","citing_title":"A Geometric Approach to Problems in Optimization and Data Science","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ANRVYEJR76F5OD7MWP2SN67KF3","json":"https://pith.science/pith/ANRVYEJR76F5OD7MWP2SN67KF3.json","graph_json":"https://pith.science/api/pith-number/ANRVYEJR76F5OD7MWP2SN67KF3/graph.json","events_json":"https://pith.science/api/pith-number/ANRVYEJR76F5OD7MWP2SN67KF3/events.json","paper":"https://pith.science/paper/ANRVYEJR"},"agent_actions":{"view_html":"https://pith.science/pith/ANRVYEJR76F5OD7MWP2SN67KF3","download_json":"https://pith.science/pith/ANRVYEJR76F5OD7MWP2SN67KF3.json","view_paper":"https://pith.science/paper/ANRVYEJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.04539&json=true","fetch_graph":"https://pith.science/api/pith-number/ANRVYEJR76F5OD7MWP2SN67KF3/graph.json","fetch_events":"https://pith.science/api/pith-number/ANRVYEJR76F5OD7MWP2SN67KF3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANRVYEJR76F5OD7MWP2SN67KF3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANRVYEJR76F5OD7MWP2SN67KF3/action/storage_attestation","attest_author":"https://pith.science/pith/ANRVYEJR76F5OD7MWP2SN67KF3/action/author_attestation","sign_citation":"https://pith.science/pith/ANRVYEJR76F5OD7MWP2SN67KF3/action/citation_signature","submit_replication":"https://pith.science/pith/ANRVYEJR76F5OD7MWP2SN67KF3/action/replication_record"}},"created_at":"2026-07-05T05:00:27.448871+00:00","updated_at":"2026-07-05T05:00:27.448871+00:00"}