{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YHUZDGJU5RCESLD4JRH5VTGUMM","short_pith_number":"pith:YHUZDGJU","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"},"canonical_sha256":"c1e9919934ec44492c7c4c4fdaccd46313f9219d54f978014d3a6f2577dc7b1f","source":{"kind":"arxiv","id":"1303.0728","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0728","created_at":"2026-05-18T03:02:47Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0728v2","created_at":"2026-05-18T03:02:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0728","created_at":"2026-05-18T03:02:47Z"},{"alias_kind":"pith_short_12","alias_value":"YHUZDGJU5RCE","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YHUZDGJU5RCESLD4","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YHUZDGJU","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YHUZDGJU5RCESLD4JRH5VTGUMM","target":"record","payload":{"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"},"canonical_sha256":"c1e9919934ec44492c7c4c4fdaccd46313f9219d54f978014d3a6f2577dc7b1f","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"},"source_kind":"arxiv","source_id":"1303.0728","source_version":2,"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-05-18T03:02:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vcrdYYMdEGv4sHBST5MlT86/lc0qLO4Qbfuao+ySZnSFMX8EAiAUk1S6dBlEh+yxpw1Ycfo9RV4E/k3oeEDdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:29:12.974768Z"},"content_sha256":"5cc88a09b0d6b4bb0240803406f0b4bf0d9a11c1f296efc08ec170776716d55f","schema_version":"1.0","event_id":"sha256:5cc88a09b0d6b4bb0240803406f0b4bf0d9a11c1f296efc08ec170776716d55f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YHUZDGJU5RCESLD4JRH5VTGUMM","target":"graph","payload":{"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"},"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-05-18T03:02:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2KvNkk+PPS8KMg/dOfNCaonECc3VL3z7HiebeMPkIQiQgYwAtrDR4jDYIa6BMzCzAzEcy5M6O6zrsC2D3MbkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:29:12.975350Z"},"content_sha256":"0a372d03c92a8724233584fca5a28b42a916fcea6e614ea66e0a99be8ff2e946","schema_version":"1.0","event_id":"sha256:0a372d03c92a8724233584fca5a28b42a916fcea6e614ea66e0a99be8ff2e946"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHUZDGJU5RCESLD4JRH5VTGUMM/bundle.json","state_url":"https://pith.science/pith/YHUZDGJU5RCESLD4JRH5VTGUMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHUZDGJU5RCESLD4JRH5VTGUMM/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-06-09T09:29:12Z","links":{"resolver":"https://pith.science/pith/YHUZDGJU5RCESLD4JRH5VTGUMM","bundle":"https://pith.science/pith/YHUZDGJU5RCESLD4JRH5VTGUMM/bundle.json","state":"https://pith.science/pith/YHUZDGJU5RCESLD4JRH5VTGUMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHUZDGJU5RCESLD4JRH5VTGUMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YHUZDGJU5RCESLD4JRH5VTGUMM","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":"c9ce3eaf6ba615e95a3d724569eddade85e9a9479dfb1075ddec852116f8aaf2","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-04T15:24:22Z","title_canon_sha256":"0664191c8dcf36e5dc4686226919fe88e99dabb115b63b9e8036312308172196"},"schema_version":"1.0","source":{"id":"1303.0728","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0728","created_at":"2026-05-18T03:02:47Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0728v2","created_at":"2026-05-18T03:02:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0728","created_at":"2026-05-18T03:02:47Z"},{"alias_kind":"pith_short_12","alias_value":"YHUZDGJU5RCE","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YHUZDGJU5RCESLD4","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YHUZDGJU","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:0a372d03c92a8724233584fca5a28b42a916fcea6e614ea66e0a99be8ff2e946","target":"graph","created_at":"2026-05-18T03:02:47Z","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"},"paper":{"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 ","authors_text":"Carola Doerr, G. Ramakrishna, Jens M. Schmidt","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-04T15:24:22Z","title":"Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0728","kind":"arxiv","version":2},"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:5cc88a09b0d6b4bb0240803406f0b4bf0d9a11c1f296efc08ec170776716d55f","target":"record","created_at":"2026-05-18T03:02:47Z","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":"c9ce3eaf6ba615e95a3d724569eddade85e9a9479dfb1075ddec852116f8aaf2","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-04T15:24:22Z","title_canon_sha256":"0664191c8dcf36e5dc4686226919fe88e99dabb115b63b9e8036312308172196"},"schema_version":"1.0","source":{"id":"1303.0728","kind":"arxiv","version":2}},"canonical_sha256":"c1e9919934ec44492c7c4c4fdaccd46313f9219d54f978014d3a6f2577dc7b1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1e9919934ec44492c7c4c4fdaccd46313f9219d54f978014d3a6f2577dc7b1f","first_computed_at":"2026-05-18T03:02:47.052947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:47.052947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9nv5uH65OhdQ9aRO4dgP2jjO67OyjR1Smj3i/I2+VUqyyRQefvXurdwxJ/JtTdZj9ydBb3vHyYpMhVJjisoKBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:47.053717Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0728","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cc88a09b0d6b4bb0240803406f0b4bf0d9a11c1f296efc08ec170776716d55f","sha256:0a372d03c92a8724233584fca5a28b42a916fcea6e614ea66e0a99be8ff2e946"],"state_sha256":"06403ab544e73f95e2772b2640def269a8b43e74d82c64ad41496df9eeaec521"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0gWmnLPuBrhNiYmu46srIn4+1/d13h7aBE1TlmEwkACIhXgLo48R+8VqRglMc4xD+g2DcK2O7Zq8eu+LA/5VBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:29:12.978268Z","bundle_sha256":"e55ec8bf37daf10a698ab99dafa0e59315205b645a882a3adaed8fd404d083b0"}}