{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3Z772IMUJ6X7IOVKOU5KWZ236G","short_pith_number":"pith:3Z772IMU","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"},"canonical_sha256":"de7ffd21944faff43aaa753aab675bf19a743a14e7e8089f0e281da21715571b","source":{"kind":"arxiv","id":"1907.11600","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11600","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11600v1","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11600","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"pith_short_12","alias_value":"3Z772IMUJ6X7","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3Z772IMUJ6X7IOVK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3Z772IMU","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3Z772IMUJ6X7IOVKOU5KWZ236G","target":"record","payload":{"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"},"canonical_sha256":"de7ffd21944faff43aaa753aab675bf19a743a14e7e8089f0e281da21715571b","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"},"source_kind":"arxiv","source_id":"1907.11600","source_version":1,"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:39:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Meovr6aHKSWS7DPbpLMzitIJdEAd49QmM9qpXKWpap8XMQPxgUamQ4X85j+Y/z1Ser3Nq2eDZyYhbQAAzLGrDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T14:52:55.368033Z"},"content_sha256":"3d9070759332a1ee6794e91d9c7f5ce335881a984ec584533a4766b9474e52fe","schema_version":"1.0","event_id":"sha256:3d9070759332a1ee6794e91d9c7f5ce335881a984ec584533a4766b9474e52fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3Z772IMUJ6X7IOVKOU5KWZ236G","target":"graph","payload":{"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"},"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:39:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DMlKe2rymEExNqxz/f0KdGPyPowUB094SJ7g7GdCfpTMhUcDui9jg9ZxXlUiHaNMSYEI8af7BuU3/ssBwYMCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T14:52:55.368839Z"},"content_sha256":"89de6917ccf18f956dc4ba4a55e0e8f4e69bf113ace7be85d8eef83a9c7620c3","schema_version":"1.0","event_id":"sha256:89de6917ccf18f956dc4ba4a55e0e8f4e69bf113ace7be85d8eef83a9c7620c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3Z772IMUJ6X7IOVKOU5KWZ236G/bundle.json","state_url":"https://pith.science/pith/3Z772IMUJ6X7IOVKOU5KWZ236G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3Z772IMUJ6X7IOVKOU5KWZ236G/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-08-22T14:52:55Z","links":{"resolver":"https://pith.science/pith/3Z772IMUJ6X7IOVKOU5KWZ236G","bundle":"https://pith.science/pith/3Z772IMUJ6X7IOVKOU5KWZ236G/bundle.json","state":"https://pith.science/pith/3Z772IMUJ6X7IOVKOU5KWZ236G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3Z772IMUJ6X7IOVKOU5KWZ236G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3Z772IMUJ6X7IOVKOU5KWZ236G","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":"b8cd11919772dbac11663bf7bbd993554e4f0827e018d68051c82f4260ced963","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-26T14:44:17Z","title_canon_sha256":"1dfa6dc815dcd62ae65bd586c4e64e45d99325823fc887b5eac9ede895c35a99"},"schema_version":"1.0","source":{"id":"1907.11600","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11600","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11600v1","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11600","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"pith_short_12","alias_value":"3Z772IMUJ6X7","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3Z772IMUJ6X7IOVK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3Z772IMU","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:89de6917ccf18f956dc4ba4a55e0e8f4e69bf113ace7be85d8eef83a9c7620c3","target":"graph","created_at":"2026-05-17T23:39:28Z","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 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.","authors_text":"St\\'ephan Thomass\\'e, Tereza Klimo\\v{s}ov\\'a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-26T14:44:17Z","title":"Edge-partitioning 3-edge-connected graphs into paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11600","kind":"arxiv","version":1},"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:3d9070759332a1ee6794e91d9c7f5ce335881a984ec584533a4766b9474e52fe","target":"record","created_at":"2026-05-17T23:39:28Z","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":"b8cd11919772dbac11663bf7bbd993554e4f0827e018d68051c82f4260ced963","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-26T14:44:17Z","title_canon_sha256":"1dfa6dc815dcd62ae65bd586c4e64e45d99325823fc887b5eac9ede895c35a99"},"schema_version":"1.0","source":{"id":"1907.11600","kind":"arxiv","version":1}},"canonical_sha256":"de7ffd21944faff43aaa753aab675bf19a743a14e7e8089f0e281da21715571b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de7ffd21944faff43aaa753aab675bf19a743a14e7e8089f0e281da21715571b","first_computed_at":"2026-05-17T23:39:28.582475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:28.582475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qiqkyLiPFSQ2UjQsiGVnZbU8MTAg53rIK9nBAPDcnWZ++ZMfjqtzx5DXzsKuUxiiLwGK/aky9TmkLF+h5mu0Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:28.583077Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11600","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d9070759332a1ee6794e91d9c7f5ce335881a984ec584533a4766b9474e52fe","sha256:89de6917ccf18f956dc4ba4a55e0e8f4e69bf113ace7be85d8eef83a9c7620c3"],"state_sha256":"610f4ce311823207ba086497056de5e2611684de009e37baffb34fe6a1dc9fd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DloiVpqgez+LibH52u6Y+tZj6O5AGpl1ky1+AjYBjiaE5dDSQzptrA5/4rqE6naSxQbEqUYf2HyZ4+B8bz58Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T14:52:55.375378Z","bundle_sha256":"dcb4791046f35340e8b2d554a44e059f033be668316a4b4cb195db8062a9b525"}}