{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:322HOGYITOC637AIIOXM4ND2JX","short_pith_number":"pith:322HOGYI","schema_version":"1.0","canonical_sha256":"deb4771b089b85edfc0843aece347a4de26b00e08f8315b72bb5e3cfab3d6673","source":{"kind":"arxiv","id":"2102.06977","version":1},"attestation_state":"computed","paper":{"title":"Almost-linear-time Weighted $\\ell_p$-norm Solvers in Slightly Dense Graphs via Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Brian Bullins, Deeksha Adil, Rasmus Kyng, Sushant Sachdeva","submitted_at":"2021-02-13T18:29:18Z","abstract_excerpt":"We give almost-linear-time algorithms for constructing sparsifiers with $n\\ poly(\\log n)$ edges that approximately preserve weighted $(\\ell^{2}_2 + \\ell^{p}_p)$ flow or voltage objectives on graphs. For flow objectives, this is the first sparsifier construction for such mixed objectives beyond unit $\\ell_p$ weights, and is based on expander decompositions. For voltage objectives, we give the first sparsifier construction for these objectives, which we build using graph spanners and leverage score sampling. Together with the iterative refinement framework of [Adil et al, SODA 2019], and a new m"},"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":"2102.06977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-02-13T18:29:18Z","cross_cats_sorted":[],"title_canon_sha256":"36701792165927e93e4570a3cd315925678e26e83a2b84578d2b19779d535922","abstract_canon_sha256":"abbedd6ca8934e41d4a113a27159362d063c8df1d0422c1b18686fb23254112e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:15:00.279858Z","signature_b64":"zBEkRDc5TcjQvsBWqptFSd70iEFFIRZV3zn/AgCk9CI1ZFpCGacfDZaUlHuEnkQnavpS2Cr0vevTxtHKXOXGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deb4771b089b85edfc0843aece347a4de26b00e08f8315b72bb5e3cfab3d6673","last_reissued_at":"2026-07-05T02:15:00.279413Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:15:00.279413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost-linear-time Weighted $\\ell_p$-norm Solvers in Slightly Dense Graphs via Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Brian Bullins, Deeksha Adil, Rasmus Kyng, Sushant Sachdeva","submitted_at":"2021-02-13T18:29:18Z","abstract_excerpt":"We give almost-linear-time algorithms for constructing sparsifiers with $n\\ poly(\\log n)$ edges that approximately preserve weighted $(\\ell^{2}_2 + \\ell^{p}_p)$ flow or voltage objectives on graphs. For flow objectives, this is the first sparsifier construction for such mixed objectives beyond unit $\\ell_p$ weights, and is based on expander decompositions. For voltage objectives, we give the first sparsifier construction for these objectives, which we build using graph spanners and leverage score sampling. Together with the iterative refinement framework of [Adil et al, SODA 2019], and a new m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.06977","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/2102.06977/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":"2102.06977","created_at":"2026-07-05T02:15:00.279468+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.06977v1","created_at":"2026-07-05T02:15:00.279468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.06977","created_at":"2026-07-05T02:15:00.279468+00:00"},{"alias_kind":"pith_short_12","alias_value":"322HOGYITOC6","created_at":"2026-07-05T02:15:00.279468+00:00"},{"alias_kind":"pith_short_16","alias_value":"322HOGYITOC637AI","created_at":"2026-07-05T02:15:00.279468+00:00"},{"alias_kind":"pith_short_8","alias_value":"322HOGYI","created_at":"2026-07-05T02:15:00.279468+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/322HOGYITOC637AIIOXM4ND2JX","json":"https://pith.science/pith/322HOGYITOC637AIIOXM4ND2JX.json","graph_json":"https://pith.science/api/pith-number/322HOGYITOC637AIIOXM4ND2JX/graph.json","events_json":"https://pith.science/api/pith-number/322HOGYITOC637AIIOXM4ND2JX/events.json","paper":"https://pith.science/paper/322HOGYI"},"agent_actions":{"view_html":"https://pith.science/pith/322HOGYITOC637AIIOXM4ND2JX","download_json":"https://pith.science/pith/322HOGYITOC637AIIOXM4ND2JX.json","view_paper":"https://pith.science/paper/322HOGYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.06977&json=true","fetch_graph":"https://pith.science/api/pith-number/322HOGYITOC637AIIOXM4ND2JX/graph.json","fetch_events":"https://pith.science/api/pith-number/322HOGYITOC637AIIOXM4ND2JX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/322HOGYITOC637AIIOXM4ND2JX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/322HOGYITOC637AIIOXM4ND2JX/action/storage_attestation","attest_author":"https://pith.science/pith/322HOGYITOC637AIIOXM4ND2JX/action/author_attestation","sign_citation":"https://pith.science/pith/322HOGYITOC637AIIOXM4ND2JX/action/citation_signature","submit_replication":"https://pith.science/pith/322HOGYITOC637AIIOXM4ND2JX/action/replication_record"}},"created_at":"2026-07-05T02:15:00.279468+00:00","updated_at":"2026-07-05T02:15:00.279468+00:00"}