{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:57GMFY4LCLZDB2D3CCPXMSSBKH","short_pith_number":"pith:57GMFY4L","schema_version":"1.0","canonical_sha256":"efccc2e38b12f230e87b109f764a4151dfd50b4abf3ea21524dc059ae7e2bea9","source":{"kind":"arxiv","id":"2008.05648","version":3},"attestation_state":"computed","paper":{"title":"Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.PR"],"primary_cat":"cs.DS","authors_text":"Antares Chen, Jonathan Shi, Luca Trevisan","submitted_at":"2020-08-13T02:18:34Z","abstract_excerpt":"We prove that a random $d$-regular graph, with high probability, is a cut sparsifier of the clique with approximation error at most $\\left(2\\sqrt{\\frac 2 \\pi} + o_{n,d}(1)\\right)/\\sqrt d$, where $2\\sqrt{\\frac 2 \\pi} = 1.595\\ldots$ and $o_{n,d}(1)$ denotes an error term that depends on $n$ and $d$ and goes to zero if we first take the limit $n\\rightarrow \\infty$ and then the limit $d \\rightarrow \\infty$.\n  This is established by analyzing linear-size cuts using techniques of Jagannath and Sen derived from ideas in statistical physics, and analyzing small cuts via martingale inequalities.\n  We a"},"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":"2008.05648","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-13T02:18:34Z","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"title_canon_sha256":"a16ea1c54c993d81435535d08f112a85c5bb2095624059ae5436c299a104a828","abstract_canon_sha256":"345499cd7c2615929bdeb276f5cd56a644586284ce3c752981bca58af9926c5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:27:26.297868Z","signature_b64":"7TCGFVirvGcH1JjAGD1h7/RaWUGGYfUZ16hABinDOwfQn43Z42ABsTcqEifNLXEYyJOrvM37YPkYwfUWfW7yBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efccc2e38b12f230e87b109f764a4151dfd50b4abf3ea21524dc059ae7e2bea9","last_reissued_at":"2026-07-05T03:27:26.297311Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:27:26.297311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.PR"],"primary_cat":"cs.DS","authors_text":"Antares Chen, Jonathan Shi, Luca Trevisan","submitted_at":"2020-08-13T02:18:34Z","abstract_excerpt":"We prove that a random $d$-regular graph, with high probability, is a cut sparsifier of the clique with approximation error at most $\\left(2\\sqrt{\\frac 2 \\pi} + o_{n,d}(1)\\right)/\\sqrt d$, where $2\\sqrt{\\frac 2 \\pi} = 1.595\\ldots$ and $o_{n,d}(1)$ denotes an error term that depends on $n$ and $d$ and goes to zero if we first take the limit $n\\rightarrow \\infty$ and then the limit $d \\rightarrow \\infty$.\n  This is established by analyzing linear-size cuts using techniques of Jagannath and Sen derived from ideas in statistical physics, and analyzing small cuts via martingale inequalities.\n  We a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.05648","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/2008.05648/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":"2008.05648","created_at":"2026-07-05T03:27:26.297386+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.05648v3","created_at":"2026-07-05T03:27:26.297386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.05648","created_at":"2026-07-05T03:27:26.297386+00:00"},{"alias_kind":"pith_short_12","alias_value":"57GMFY4LCLZD","created_at":"2026-07-05T03:27:26.297386+00:00"},{"alias_kind":"pith_short_16","alias_value":"57GMFY4LCLZDB2D3","created_at":"2026-07-05T03:27:26.297386+00:00"},{"alias_kind":"pith_short_8","alias_value":"57GMFY4L","created_at":"2026-07-05T03:27:26.297386+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08160","citing_title":"Weak Poincar\\'e Inequalities via Approximate Stochastic Localization: Application to Sampling the Sherrington-Kirkpatrick Model","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/57GMFY4LCLZDB2D3CCPXMSSBKH","json":"https://pith.science/pith/57GMFY4LCLZDB2D3CCPXMSSBKH.json","graph_json":"https://pith.science/api/pith-number/57GMFY4LCLZDB2D3CCPXMSSBKH/graph.json","events_json":"https://pith.science/api/pith-number/57GMFY4LCLZDB2D3CCPXMSSBKH/events.json","paper":"https://pith.science/paper/57GMFY4L"},"agent_actions":{"view_html":"https://pith.science/pith/57GMFY4LCLZDB2D3CCPXMSSBKH","download_json":"https://pith.science/pith/57GMFY4LCLZDB2D3CCPXMSSBKH.json","view_paper":"https://pith.science/paper/57GMFY4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.05648&json=true","fetch_graph":"https://pith.science/api/pith-number/57GMFY4LCLZDB2D3CCPXMSSBKH/graph.json","fetch_events":"https://pith.science/api/pith-number/57GMFY4LCLZDB2D3CCPXMSSBKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57GMFY4LCLZDB2D3CCPXMSSBKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57GMFY4LCLZDB2D3CCPXMSSBKH/action/storage_attestation","attest_author":"https://pith.science/pith/57GMFY4LCLZDB2D3CCPXMSSBKH/action/author_attestation","sign_citation":"https://pith.science/pith/57GMFY4LCLZDB2D3CCPXMSSBKH/action/citation_signature","submit_replication":"https://pith.science/pith/57GMFY4LCLZDB2D3CCPXMSSBKH/action/replication_record"}},"created_at":"2026-07-05T03:27:26.297386+00:00","updated_at":"2026-07-05T03:27:26.297386+00:00"}