{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FHOGNIAPJHZ7GJEELAZPTCSMZU","short_pith_number":"pith:FHOGNIAP","schema_version":"1.0","canonical_sha256":"29dc66a00f49f3f324845832f98a4ccd3fe3859d4f62ae53f8ed94082290f93c","source":{"kind":"arxiv","id":"2507.15598","version":1},"attestation_state":"computed","paper":{"title":"Fast Algorithms for Graph Arboricity and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debmalya Panigrahi, George Z. Li, Henry Fleischmann, Jason Li, Ruoxu Cen","submitted_at":"2025-07-21T13:19:11Z","abstract_excerpt":"We give an algorithm for finding the arboricity of a weighted, undirected graph, defined as the minimum number of spanning forests that cover all edges of the graph, in $\\sqrt{n} m^{1+o(1)}$ time. This improves on the previous best bound of $\\tilde{O}(nm)$ for weighted graphs and $\\tilde{O}(m^{3/2}) $ for unweighted graphs (Gabow 1995) for this problem. The running time of our algorithm is dominated by a logarithmic number of calls to a directed global minimum cut subroutine -- if the running time of the latter problem improves to $m^{1+o(1)}$ (thereby matching the running time of maximum flow"},"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":"2507.15598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-21T13:19:11Z","cross_cats_sorted":[],"title_canon_sha256":"d0f2bb7c60139eb43e6403b5136010e99c326733fe1528fcebc4ec5051685878","abstract_canon_sha256":"707b1899cb2b59f794c83fb412cf95c0935a4ddb59368ec6b3fa659611428b9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:39.803945Z","signature_b64":"/5s8DoYyQss52sU+7GmiD3Lvhp0ep9PF4rojbN0Z/iwviW88DgNtoDxLgIVbkRGPjZxL5yHfQC0X9t4lcdWcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29dc66a00f49f3f324845832f98a4ccd3fe3859d4f62ae53f8ed94082290f93c","last_reissued_at":"2026-07-05T11:40:39.803491Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:39.803491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Algorithms for Graph Arboricity and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debmalya Panigrahi, George Z. Li, Henry Fleischmann, Jason Li, Ruoxu Cen","submitted_at":"2025-07-21T13:19:11Z","abstract_excerpt":"We give an algorithm for finding the arboricity of a weighted, undirected graph, defined as the minimum number of spanning forests that cover all edges of the graph, in $\\sqrt{n} m^{1+o(1)}$ time. This improves on the previous best bound of $\\tilde{O}(nm)$ for weighted graphs and $\\tilde{O}(m^{3/2}) $ for unweighted graphs (Gabow 1995) for this problem. The running time of our algorithm is dominated by a logarithmic number of calls to a directed global minimum cut subroutine -- if the running time of the latter problem improves to $m^{1+o(1)}$ (thereby matching the running time of maximum flow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15598","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/2507.15598/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":"2507.15598","created_at":"2026-07-05T11:40:39.803544+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.15598v1","created_at":"2026-07-05T11:40:39.803544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15598","created_at":"2026-07-05T11:40:39.803544+00:00"},{"alias_kind":"pith_short_12","alias_value":"FHOGNIAPJHZ7","created_at":"2026-07-05T11:40:39.803544+00:00"},{"alias_kind":"pith_short_16","alias_value":"FHOGNIAPJHZ7GJEE","created_at":"2026-07-05T11:40:39.803544+00:00"},{"alias_kind":"pith_short_8","alias_value":"FHOGNIAP","created_at":"2026-07-05T11:40:39.803544+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/FHOGNIAPJHZ7GJEELAZPTCSMZU","json":"https://pith.science/pith/FHOGNIAPJHZ7GJEELAZPTCSMZU.json","graph_json":"https://pith.science/api/pith-number/FHOGNIAPJHZ7GJEELAZPTCSMZU/graph.json","events_json":"https://pith.science/api/pith-number/FHOGNIAPJHZ7GJEELAZPTCSMZU/events.json","paper":"https://pith.science/paper/FHOGNIAP"},"agent_actions":{"view_html":"https://pith.science/pith/FHOGNIAPJHZ7GJEELAZPTCSMZU","download_json":"https://pith.science/pith/FHOGNIAPJHZ7GJEELAZPTCSMZU.json","view_paper":"https://pith.science/paper/FHOGNIAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.15598&json=true","fetch_graph":"https://pith.science/api/pith-number/FHOGNIAPJHZ7GJEELAZPTCSMZU/graph.json","fetch_events":"https://pith.science/api/pith-number/FHOGNIAPJHZ7GJEELAZPTCSMZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FHOGNIAPJHZ7GJEELAZPTCSMZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FHOGNIAPJHZ7GJEELAZPTCSMZU/action/storage_attestation","attest_author":"https://pith.science/pith/FHOGNIAPJHZ7GJEELAZPTCSMZU/action/author_attestation","sign_citation":"https://pith.science/pith/FHOGNIAPJHZ7GJEELAZPTCSMZU/action/citation_signature","submit_replication":"https://pith.science/pith/FHOGNIAPJHZ7GJEELAZPTCSMZU/action/replication_record"}},"created_at":"2026-07-05T11:40:39.803544+00:00","updated_at":"2026-07-05T11:40:39.803544+00:00"}