{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3Z772IMUJ6X7IOVKOU5KWZ236G","short_pith_number":"pith:3Z772IMU","schema_version":"1.0","canonical_sha256":"de7ffd21944faff43aaa753aab675bf19a743a14e7e8089f0e281da21715571b","source":{"kind":"arxiv","id":"1907.11600","version":1},"attestation_state":"computed","paper":{"title":"Edge-partitioning 3-edge-connected graphs into paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"St\\'ephan Thomass\\'e, Tereza Klimo\\v{s}ov\\'a","submitted_at":"2019-07-26T14:44:17Z","abstract_excerpt":"We show that for every l, there exists d_l such that every 3-edge-connected graph with minimum degree d_l can be edge-partitioned into paths of length l (provided that its number of edges is divisible by l). This improves a result asserting that 24-edge-connectivity and high minimum degree provides such a partition. This is best possible as 3-edge-connectivity cannot be replaced by 2-edge connectivity."},"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":"1907.11600","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-26T14:44:17Z","cross_cats_sorted":[],"title_canon_sha256":"1dfa6dc815dcd62ae65bd586c4e64e45d99325823fc887b5eac9ede895c35a99","abstract_canon_sha256":"b8cd11919772dbac11663bf7bbd993554e4f0827e018d68051c82f4260ced963"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:28.583077Z","signature_b64":"qiqkyLiPFSQ2UjQsiGVnZbU8MTAg53rIK9nBAPDcnWZ++ZMfjqtzx5DXzsKuUxiiLwGK/aky9TmkLF+h5mu0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de7ffd21944faff43aaa753aab675bf19a743a14e7e8089f0e281da21715571b","last_reissued_at":"2026-05-17T23:39:28.582475Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:28.582475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge-partitioning 3-edge-connected graphs into paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"St\\'ephan Thomass\\'e, Tereza Klimo\\v{s}ov\\'a","submitted_at":"2019-07-26T14:44:17Z","abstract_excerpt":"We show that for every l, there exists d_l such that every 3-edge-connected graph with minimum degree d_l can be edge-partitioned into paths of length l (provided that its number of edges is divisible by l). This improves a result asserting that 24-edge-connectivity and high minimum degree provides such a partition. This is best possible as 3-edge-connectivity cannot be replaced by 2-edge connectivity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11600","kind":"arxiv","version":1},"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":"1907.11600","created_at":"2026-05-17T23:39:28.582566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.11600v1","created_at":"2026-05-17T23:39:28.582566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11600","created_at":"2026-05-17T23:39:28.582566+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Z772IMUJ6X7","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Z772IMUJ6X7IOVK","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Z772IMU","created_at":"2026-05-18T12:33:10.108867+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/3Z772IMUJ6X7IOVKOU5KWZ236G","json":"https://pith.science/pith/3Z772IMUJ6X7IOVKOU5KWZ236G.json","graph_json":"https://pith.science/api/pith-number/3Z772IMUJ6X7IOVKOU5KWZ236G/graph.json","events_json":"https://pith.science/api/pith-number/3Z772IMUJ6X7IOVKOU5KWZ236G/events.json","paper":"https://pith.science/paper/3Z772IMU"},"agent_actions":{"view_html":"https://pith.science/pith/3Z772IMUJ6X7IOVKOU5KWZ236G","download_json":"https://pith.science/pith/3Z772IMUJ6X7IOVKOU5KWZ236G.json","view_paper":"https://pith.science/paper/3Z772IMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.11600&json=true","fetch_graph":"https://pith.science/api/pith-number/3Z772IMUJ6X7IOVKOU5KWZ236G/graph.json","fetch_events":"https://pith.science/api/pith-number/3Z772IMUJ6X7IOVKOU5KWZ236G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Z772IMUJ6X7IOVKOU5KWZ236G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Z772IMUJ6X7IOVKOU5KWZ236G/action/storage_attestation","attest_author":"https://pith.science/pith/3Z772IMUJ6X7IOVKOU5KWZ236G/action/author_attestation","sign_citation":"https://pith.science/pith/3Z772IMUJ6X7IOVKOU5KWZ236G/action/citation_signature","submit_replication":"https://pith.science/pith/3Z772IMUJ6X7IOVKOU5KWZ236G/action/replication_record"}},"created_at":"2026-05-17T23:39:28.582566+00:00","updated_at":"2026-05-17T23:39:28.582566+00:00"}