{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YHUZDGJU5RCESLD4JRH5VTGUMM","short_pith_number":"pith:YHUZDGJU","schema_version":"1.0","canonical_sha256":"c1e9919934ec44492c7c4c4fdaccd46313f9219d54f978014d3a6f2577dc7b1f","source":{"kind":"arxiv","id":"1303.0728","version":2},"attestation_state":"computed","paper":{"title":"Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Carola Doerr, G. Ramakrishna, Jens M. Schmidt","submitted_at":"2013-03-04T15:24:22Z","abstract_excerpt":"We present a linear time algorithm for computing an implicit linear space representation of a minimum cycle basis (MCB) in weighted partial 2-trees, i.e., graphs of treewidth two. The implicit representation can be made explicit in a running time that is proportional to the size of the MCB.\n  Our algorithm improves the result of Borradaile, Sankowski, and Wulff-Nilsen [Min $st$-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time, FOCS 2010]---which computes for all planar graphs an implicit $O(n \\log n)$ space representation of an MCB in $O(n \\log^5 n)$ time---by a polylog factor "},"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":"1303.0728","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-04T15:24:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0664191c8dcf36e5dc4686226919fe88e99dabb115b63b9e8036312308172196","abstract_canon_sha256":"c9ce3eaf6ba615e95a3d724569eddade85e9a9479dfb1075ddec852116f8aaf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:47.053717Z","signature_b64":"9nv5uH65OhdQ9aRO4dgP2jjO67OyjR1Smj3i/I2+VUqyyRQefvXurdwxJ/JtTdZj9ydBb3vHyYpMhVJjisoKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1e9919934ec44492c7c4c4fdaccd46313f9219d54f978014d3a6f2577dc7b1f","last_reissued_at":"2026-05-18T03:02:47.052947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:47.052947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Carola Doerr, G. Ramakrishna, Jens M. Schmidt","submitted_at":"2013-03-04T15:24:22Z","abstract_excerpt":"We present a linear time algorithm for computing an implicit linear space representation of a minimum cycle basis (MCB) in weighted partial 2-trees, i.e., graphs of treewidth two. The implicit representation can be made explicit in a running time that is proportional to the size of the MCB.\n  Our algorithm improves the result of Borradaile, Sankowski, and Wulff-Nilsen [Min $st$-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time, FOCS 2010]---which computes for all planar graphs an implicit $O(n \\log n)$ space representation of an MCB in $O(n \\log^5 n)$ time---by a polylog factor "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0728","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1303.0728","created_at":"2026-05-18T03:02:47.053061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.0728v2","created_at":"2026-05-18T03:02:47.053061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0728","created_at":"2026-05-18T03:02:47.053061+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHUZDGJU5RCE","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHUZDGJU5RCESLD4","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHUZDGJU","created_at":"2026-05-18T12:28:06.772260+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/YHUZDGJU5RCESLD4JRH5VTGUMM","json":"https://pith.science/pith/YHUZDGJU5RCESLD4JRH5VTGUMM.json","graph_json":"https://pith.science/api/pith-number/YHUZDGJU5RCESLD4JRH5VTGUMM/graph.json","events_json":"https://pith.science/api/pith-number/YHUZDGJU5RCESLD4JRH5VTGUMM/events.json","paper":"https://pith.science/paper/YHUZDGJU"},"agent_actions":{"view_html":"https://pith.science/pith/YHUZDGJU5RCESLD4JRH5VTGUMM","download_json":"https://pith.science/pith/YHUZDGJU5RCESLD4JRH5VTGUMM.json","view_paper":"https://pith.science/paper/YHUZDGJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.0728&json=true","fetch_graph":"https://pith.science/api/pith-number/YHUZDGJU5RCESLD4JRH5VTGUMM/graph.json","fetch_events":"https://pith.science/api/pith-number/YHUZDGJU5RCESLD4JRH5VTGUMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHUZDGJU5RCESLD4JRH5VTGUMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHUZDGJU5RCESLD4JRH5VTGUMM/action/storage_attestation","attest_author":"https://pith.science/pith/YHUZDGJU5RCESLD4JRH5VTGUMM/action/author_attestation","sign_citation":"https://pith.science/pith/YHUZDGJU5RCESLD4JRH5VTGUMM/action/citation_signature","submit_replication":"https://pith.science/pith/YHUZDGJU5RCESLD4JRH5VTGUMM/action/replication_record"}},"created_at":"2026-05-18T03:02:47.053061+00:00","updated_at":"2026-05-18T03:02:47.053061+00:00"}