{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FHOGNIAPJHZ7GJEELAZPTCSMZU","short_pith_number":"pith:FHOGNIAP","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"},"canonical_sha256":"29dc66a00f49f3f324845832f98a4ccd3fe3859d4f62ae53f8ed94082290f93c","source":{"kind":"arxiv","id":"2507.15598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.15598","created_at":"2026-07-05T11:40:39Z"},{"alias_kind":"arxiv_version","alias_value":"2507.15598v1","created_at":"2026-07-05T11:40:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15598","created_at":"2026-07-05T11:40:39Z"},{"alias_kind":"pith_short_12","alias_value":"FHOGNIAPJHZ7","created_at":"2026-07-05T11:40:39Z"},{"alias_kind":"pith_short_16","alias_value":"FHOGNIAPJHZ7GJEE","created_at":"2026-07-05T11:40:39Z"},{"alias_kind":"pith_short_8","alias_value":"FHOGNIAP","created_at":"2026-07-05T11:40:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FHOGNIAPJHZ7GJEELAZPTCSMZU","target":"record","payload":{"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"},"canonical_sha256":"29dc66a00f49f3f324845832f98a4ccd3fe3859d4f62ae53f8ed94082290f93c","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"},"source_kind":"arxiv","source_id":"2507.15598","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:40:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mVdD+YJjDw2t8NjJyJLc2Myfux9y1Ya1BK6bZ52FQg0SeJscJho5I3eyVb3/3vM4pnabz/8ZJ8j1HaYOwP++Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:47:23.495869Z"},"content_sha256":"e93366ffa65ac9d8243bfa17cfe849e65f885813a67112ee345720649f1af22a","schema_version":"1.0","event_id":"sha256:e93366ffa65ac9d8243bfa17cfe849e65f885813a67112ee345720649f1af22a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FHOGNIAPJHZ7GJEELAZPTCSMZU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:40:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CKcFykfClhrIabrE7lVcpQCvNdGq0D6p57PqRGyNcQaIBqfxE9EXAj/F2zMtNq6X2MH0SKOtieIgSye90bWZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:47:23.496246Z"},"content_sha256":"96bcd8e5063adc414161694c85fac31ab1464d79b32bbee202f4eec3e3cc8a26","schema_version":"1.0","event_id":"sha256:96bcd8e5063adc414161694c85fac31ab1464d79b32bbee202f4eec3e3cc8a26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FHOGNIAPJHZ7GJEELAZPTCSMZU/bundle.json","state_url":"https://pith.science/pith/FHOGNIAPJHZ7GJEELAZPTCSMZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FHOGNIAPJHZ7GJEELAZPTCSMZU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T10:47:23Z","links":{"resolver":"https://pith.science/pith/FHOGNIAPJHZ7GJEELAZPTCSMZU","bundle":"https://pith.science/pith/FHOGNIAPJHZ7GJEELAZPTCSMZU/bundle.json","state":"https://pith.science/pith/FHOGNIAPJHZ7GJEELAZPTCSMZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FHOGNIAPJHZ7GJEELAZPTCSMZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FHOGNIAPJHZ7GJEELAZPTCSMZU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"707b1899cb2b59f794c83fb412cf95c0935a4ddb59368ec6b3fa659611428b9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-21T13:19:11Z","title_canon_sha256":"d0f2bb7c60139eb43e6403b5136010e99c326733fe1528fcebc4ec5051685878"},"schema_version":"1.0","source":{"id":"2507.15598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.15598","created_at":"2026-07-05T11:40:39Z"},{"alias_kind":"arxiv_version","alias_value":"2507.15598v1","created_at":"2026-07-05T11:40:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15598","created_at":"2026-07-05T11:40:39Z"},{"alias_kind":"pith_short_12","alias_value":"FHOGNIAPJHZ7","created_at":"2026-07-05T11:40:39Z"},{"alias_kind":"pith_short_16","alias_value":"FHOGNIAPJHZ7GJEE","created_at":"2026-07-05T11:40:39Z"},{"alias_kind":"pith_short_8","alias_value":"FHOGNIAP","created_at":"2026-07-05T11:40:39Z"}],"graph_snapshots":[{"event_id":"sha256:96bcd8e5063adc414161694c85fac31ab1464d79b32bbee202f4eec3e3cc8a26","target":"graph","created_at":"2026-07-05T11:40:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.15598/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Debmalya Panigrahi, George Z. Li, Henry Fleischmann, Jason Li, Ruoxu Cen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-21T13:19:11Z","title":"Fast Algorithms for Graph Arboricity and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15598","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e93366ffa65ac9d8243bfa17cfe849e65f885813a67112ee345720649f1af22a","target":"record","created_at":"2026-07-05T11:40:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"707b1899cb2b59f794c83fb412cf95c0935a4ddb59368ec6b3fa659611428b9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-21T13:19:11Z","title_canon_sha256":"d0f2bb7c60139eb43e6403b5136010e99c326733fe1528fcebc4ec5051685878"},"schema_version":"1.0","source":{"id":"2507.15598","kind":"arxiv","version":1}},"canonical_sha256":"29dc66a00f49f3f324845832f98a4ccd3fe3859d4f62ae53f8ed94082290f93c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29dc66a00f49f3f324845832f98a4ccd3fe3859d4f62ae53f8ed94082290f93c","first_computed_at":"2026-07-05T11:40:39.803491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:40:39.803491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/5s8DoYyQss52sU+7GmiD3Lvhp0ep9PF4rojbN0Z/iwviW88DgNtoDxLgIVbkRGPjZxL5yHfQC0X9t4lcdWcAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:40:39.803945Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.15598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e93366ffa65ac9d8243bfa17cfe849e65f885813a67112ee345720649f1af22a","sha256:96bcd8e5063adc414161694c85fac31ab1464d79b32bbee202f4eec3e3cc8a26"],"state_sha256":"156f0a4345670d6ce8f24f4df3ff886eb068e5aca69ae09eb5e8bf374dfdd310"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iwcx+Exe17tldpjss1ivlJZGnqmBa0/UoTCNFot+CD+Lo0NjwTrAid46YnKd06AUrobHDweCy4PpcBr3KRkqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T10:47:23.498204Z","bundle_sha256":"55cea10fffdf6c7d2e0a2e446c4e57968606b42895a2fd3e7cbb1f5ea1dfd0ab"}}