{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GNPCCDTIEOJ5FLQCCZMCPB5FSP","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":"f7cf1f1ff86e9b962c349fddcce7b4043251efca6470e56030bb1ce3db10f155","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-02T23:13:28Z","title_canon_sha256":"2b3484f733c82173a93621666165d6a760ceedeeb439792996825974f5954c8d"},"schema_version":"1.0","source":{"id":"1705.01199","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01199","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01199v3","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01199","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"pith_short_12","alias_value":"GNPCCDTIEOJ5","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GNPCCDTIEOJ5FLQC","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GNPCCDTI","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:7afaeb01f557466b30693f99c0e008d9a82abd2b2cd6c2f6989fc4418e97a268","target":"graph","created_at":"2026-05-18T00:29: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":"We prove an ear-decomposition theorem for $4$-edge-connected graphs and use it to prove that for every $4$-edge-connected graph $G$ and every $r\\in V(G)$, there is a set of four spanning trees of $G$ with the following property. For every vertex in $G$, the unique paths back to $r$ in each tree are edge-disjoint. Our proof implies a polynomial-time algorithm for constructing the trees.","authors_text":"Alexander Hoyer, Robin Thomas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-02T23:13:28Z","title":"Four Edge-Independent Spanning Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01199","kind":"arxiv","version":3},"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:b7a66803f7cb1575146721009e28ed5c25f4acbd22d67339786f1e0d8fc6869b","target":"record","created_at":"2026-05-18T00:29: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":"f7cf1f1ff86e9b962c349fddcce7b4043251efca6470e56030bb1ce3db10f155","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-02T23:13:28Z","title_canon_sha256":"2b3484f733c82173a93621666165d6a760ceedeeb439792996825974f5954c8d"},"schema_version":"1.0","source":{"id":"1705.01199","kind":"arxiv","version":3}},"canonical_sha256":"335e210e682393d2ae0216582787a593c861a61cf372aeb74c7421d911f48b98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"335e210e682393d2ae0216582787a593c861a61cf372aeb74c7421d911f48b98","first_computed_at":"2026-05-18T00:29:51.671048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:51.671048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kclOg+wHTbohgNbiZe/0VeDTXB9GLqmNAuzUvDphB/9CWKFPcrgn16bL8iOMwRAHEezKBsmJt5RL++GHcz1kDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:51.671668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.01199","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7a66803f7cb1575146721009e28ed5c25f4acbd22d67339786f1e0d8fc6869b","sha256:7afaeb01f557466b30693f99c0e008d9a82abd2b2cd6c2f6989fc4418e97a268"],"state_sha256":"0b55c42bed083cd06182d890a0e81a399e41edf4eda7caa8ffb1a25374424ba7"}