{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GNPCCDTIEOJ5FLQCCZMCPB5FSP","short_pith_number":"pith:GNPCCDTI","schema_version":"1.0","canonical_sha256":"335e210e682393d2ae0216582787a593c861a61cf372aeb74c7421d911f48b98","source":{"kind":"arxiv","id":"1705.01199","version":3},"attestation_state":"computed","paper":{"title":"Four Edge-Independent Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Hoyer, Robin Thomas","submitted_at":"2017-05-02T23:13:28Z","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."},"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":"1705.01199","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-02T23:13:28Z","cross_cats_sorted":[],"title_canon_sha256":"2b3484f733c82173a93621666165d6a760ceedeeb439792996825974f5954c8d","abstract_canon_sha256":"f7cf1f1ff86e9b962c349fddcce7b4043251efca6470e56030bb1ce3db10f155"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:51.671668Z","signature_b64":"kclOg+wHTbohgNbiZe/0VeDTXB9GLqmNAuzUvDphB/9CWKFPcrgn16bL8iOMwRAHEezKBsmJt5RL++GHcz1kDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"335e210e682393d2ae0216582787a593c861a61cf372aeb74c7421d911f48b98","last_reissued_at":"2026-05-18T00:29:51.671048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:51.671048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Four Edge-Independent Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Hoyer, Robin Thomas","submitted_at":"2017-05-02T23:13:28Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01199","kind":"arxiv","version":3},"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":"1705.01199","created_at":"2026-05-18T00:29:51.671140+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01199v3","created_at":"2026-05-18T00:29:51.671140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01199","created_at":"2026-05-18T00:29:51.671140+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNPCCDTIEOJ5","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNPCCDTIEOJ5FLQC","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNPCCDTI","created_at":"2026-05-18T12:31:18.294218+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/GNPCCDTIEOJ5FLQCCZMCPB5FSP","json":"https://pith.science/pith/GNPCCDTIEOJ5FLQCCZMCPB5FSP.json","graph_json":"https://pith.science/api/pith-number/GNPCCDTIEOJ5FLQCCZMCPB5FSP/graph.json","events_json":"https://pith.science/api/pith-number/GNPCCDTIEOJ5FLQCCZMCPB5FSP/events.json","paper":"https://pith.science/paper/GNPCCDTI"},"agent_actions":{"view_html":"https://pith.science/pith/GNPCCDTIEOJ5FLQCCZMCPB5FSP","download_json":"https://pith.science/pith/GNPCCDTIEOJ5FLQCCZMCPB5FSP.json","view_paper":"https://pith.science/paper/GNPCCDTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01199&json=true","fetch_graph":"https://pith.science/api/pith-number/GNPCCDTIEOJ5FLQCCZMCPB5FSP/graph.json","fetch_events":"https://pith.science/api/pith-number/GNPCCDTIEOJ5FLQCCZMCPB5FSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNPCCDTIEOJ5FLQCCZMCPB5FSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNPCCDTIEOJ5FLQCCZMCPB5FSP/action/storage_attestation","attest_author":"https://pith.science/pith/GNPCCDTIEOJ5FLQCCZMCPB5FSP/action/author_attestation","sign_citation":"https://pith.science/pith/GNPCCDTIEOJ5FLQCCZMCPB5FSP/action/citation_signature","submit_replication":"https://pith.science/pith/GNPCCDTIEOJ5FLQCCZMCPB5FSP/action/replication_record"}},"created_at":"2026-05-18T00:29:51.671140+00:00","updated_at":"2026-05-18T00:29:51.671140+00:00"}