{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OFPHK7HOGSRZS7FPWULR4HT4GQ","short_pith_number":"pith:OFPHK7HO","canonical_record":{"source":{"id":"1808.05256","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-08-15T19:02:39Z","cross_cats_sorted":[],"title_canon_sha256":"0cf21c219dac29c1d78c4d318028e848c07a8d14c4629375f8698458a92fc554","abstract_canon_sha256":"6f23ed1e54de801cda32e3cacab1ed5329dcc8c717d4c6bea82cf3d3283b9a13"},"schema_version":"1.0"},"canonical_sha256":"715e757cee34a3997cafb5171e1e7c3420f66a2a67f46d331921f01bca74d1c4","source":{"kind":"arxiv","id":"1808.05256","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05256","created_at":"2026-05-17T23:59:51Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05256v2","created_at":"2026-05-17T23:59:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05256","created_at":"2026-05-17T23:59:51Z"},{"alias_kind":"pith_short_12","alias_value":"OFPHK7HOGSRZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OFPHK7HOGSRZS7FP","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OFPHK7HO","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OFPHK7HOGSRZS7FPWULR4HT4GQ","target":"record","payload":{"canonical_record":{"source":{"id":"1808.05256","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-08-15T19:02:39Z","cross_cats_sorted":[],"title_canon_sha256":"0cf21c219dac29c1d78c4d318028e848c07a8d14c4629375f8698458a92fc554","abstract_canon_sha256":"6f23ed1e54de801cda32e3cacab1ed5329dcc8c717d4c6bea82cf3d3283b9a13"},"schema_version":"1.0"},"canonical_sha256":"715e757cee34a3997cafb5171e1e7c3420f66a2a67f46d331921f01bca74d1c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:51.871801Z","signature_b64":"P2q2un2X8AOQQimxW/t0lvsSvp13gzmH0ZeuTRGIDYvWG5DvC0BWNNk2QxzVhsQjbmeYxFPulDKEGsqC7kiECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"715e757cee34a3997cafb5171e1e7c3420f66a2a67f46d331921f01bca74d1c4","last_reissued_at":"2026-05-17T23:59:51.871312Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:51.871312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.05256","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-17T23:59:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"twvRUlhe+IxbnPQ7fdZm4mcEBdItxAr/GAQIC4pCSgHviMYIDk3TSXR3KISqX4WJvrU1gTnmVtxhU9UqthcnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:58:08.062596Z"},"content_sha256":"7009c6a0d6c828602b07d39745c8ef7160403ca51d2f9e132f6abae518454500","schema_version":"1.0","event_id":"sha256:7009c6a0d6c828602b07d39745c8ef7160403ca51d2f9e132f6abae518454500"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OFPHK7HOGSRZS7FPWULR4HT4GQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge Disjoint Spanning Trees in an Undirected Graph with E=2(V-1)","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hemant Malik, Ovidiu Daescu, Ramaswamy Chandrasekaran","submitted_at":"2018-08-15T19:02:39Z","abstract_excerpt":"Given a connected undirected graph G = [V; E] where |E| =2(|V| -1), we present two algorithms to check if G can be decomposed into two edge disjoint spanning trees, and provide such a decomposition when it exists. Unlike previous algorithms for finding edge disjoint spanning trees in general undirected graphs, based on matroids and complex in description, our algorithms are based on simple graph reduction techniques and thus easy to describe and implement. Moreover, the running time for our solutions is asymptotically faster. Specifically, ours are the first algorithms to achieve a running tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05256","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-17T23:59:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ppI5AtI6CjyTqp0fDPbD8MOBvnNc2g/NpCCYn3qIvi2NoATBMAdgCVo4u7no/1ZnaKCcmtFVEvLjJUfViEyuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:58:08.063191Z"},"content_sha256":"b0db63352180e494b61e95a7e79b84e31c88ea609cb04b25bd5cf2cf021ee96b","schema_version":"1.0","event_id":"sha256:b0db63352180e494b61e95a7e79b84e31c88ea609cb04b25bd5cf2cf021ee96b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFPHK7HOGSRZS7FPWULR4HT4GQ/bundle.json","state_url":"https://pith.science/pith/OFPHK7HOGSRZS7FPWULR4HT4GQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFPHK7HOGSRZS7FPWULR4HT4GQ/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-03T19:58:08Z","links":{"resolver":"https://pith.science/pith/OFPHK7HOGSRZS7FPWULR4HT4GQ","bundle":"https://pith.science/pith/OFPHK7HOGSRZS7FPWULR4HT4GQ/bundle.json","state":"https://pith.science/pith/OFPHK7HOGSRZS7FPWULR4HT4GQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFPHK7HOGSRZS7FPWULR4HT4GQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OFPHK7HOGSRZS7FPWULR4HT4GQ","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":"6f23ed1e54de801cda32e3cacab1ed5329dcc8c717d4c6bea82cf3d3283b9a13","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-08-15T19:02:39Z","title_canon_sha256":"0cf21c219dac29c1d78c4d318028e848c07a8d14c4629375f8698458a92fc554"},"schema_version":"1.0","source":{"id":"1808.05256","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05256","created_at":"2026-05-17T23:59:51Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05256v2","created_at":"2026-05-17T23:59:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05256","created_at":"2026-05-17T23:59:51Z"},{"alias_kind":"pith_short_12","alias_value":"OFPHK7HOGSRZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OFPHK7HOGSRZS7FP","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OFPHK7HO","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:b0db63352180e494b61e95a7e79b84e31c88ea609cb04b25bd5cf2cf021ee96b","target":"graph","created_at":"2026-05-17T23:59:51Z","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":"Given a connected undirected graph G = [V; E] where |E| =2(|V| -1), we present two algorithms to check if G can be decomposed into two edge disjoint spanning trees, and provide such a decomposition when it exists. Unlike previous algorithms for finding edge disjoint spanning trees in general undirected graphs, based on matroids and complex in description, our algorithms are based on simple graph reduction techniques and thus easy to describe and implement. Moreover, the running time for our solutions is asymptotically faster. Specifically, ours are the first algorithms to achieve a running tim","authors_text":"Hemant Malik, Ovidiu Daescu, Ramaswamy Chandrasekaran","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-08-15T19:02:39Z","title":"Edge Disjoint Spanning Trees in an Undirected Graph with E=2(V-1)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05256","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:7009c6a0d6c828602b07d39745c8ef7160403ca51d2f9e132f6abae518454500","target":"record","created_at":"2026-05-17T23:59:51Z","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":"6f23ed1e54de801cda32e3cacab1ed5329dcc8c717d4c6bea82cf3d3283b9a13","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-08-15T19:02:39Z","title_canon_sha256":"0cf21c219dac29c1d78c4d318028e848c07a8d14c4629375f8698458a92fc554"},"schema_version":"1.0","source":{"id":"1808.05256","kind":"arxiv","version":2}},"canonical_sha256":"715e757cee34a3997cafb5171e1e7c3420f66a2a67f46d331921f01bca74d1c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"715e757cee34a3997cafb5171e1e7c3420f66a2a67f46d331921f01bca74d1c4","first_computed_at":"2026-05-17T23:59:51.871312Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:51.871312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P2q2un2X8AOQQimxW/t0lvsSvp13gzmH0ZeuTRGIDYvWG5DvC0BWNNk2QxzVhsQjbmeYxFPulDKEGsqC7kiECA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:51.871801Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.05256","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7009c6a0d6c828602b07d39745c8ef7160403ca51d2f9e132f6abae518454500","sha256:b0db63352180e494b61e95a7e79b84e31c88ea609cb04b25bd5cf2cf021ee96b"],"state_sha256":"bd55eb8bdf185bbd52fc32ed3496d722dfad9867a0dd78254ac70cad039be04e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UTKS33q/0+xbY8Ard14y/MleafHmRl73DJD3gyd0++dDHy2LQp6vDblvGRi8jMovNlqGuUa4In7jI50rNXSgAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:58:08.065981Z","bundle_sha256":"4e092d13e7d780220b92e72a88fa721bd533da10bdd5de92319d334828c1d7b2"}}