{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EPUSNU4GCMYC3J4TIN5RNH3J7Y","short_pith_number":"pith:EPUSNU4G","canonical_record":{"source":{"id":"1803.06768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-19T00:50:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3ca1d0bf1f163fbeabcbe0f93b6e414221e2b45013b49804092dcf9a96c2012a","abstract_canon_sha256":"6b49209efc88d5dddfd2b26c957ce2f73c2436892f1d218951d45db3d49c6605"},"schema_version":"1.0"},"canonical_sha256":"23e926d38613302da793437b169f69fe36a81042b6a292c6d37108f0f8c46b0f","source":{"kind":"arxiv","id":"1803.06768","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06768","created_at":"2026-05-18T00:20:43Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06768v1","created_at":"2026-05-18T00:20:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06768","created_at":"2026-05-18T00:20:43Z"},{"alias_kind":"pith_short_12","alias_value":"EPUSNU4GCMYC","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EPUSNU4GCMYC3J4T","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EPUSNU4G","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EPUSNU4GCMYC3J4TIN5RNH3J7Y","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-19T00:50:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3ca1d0bf1f163fbeabcbe0f93b6e414221e2b45013b49804092dcf9a96c2012a","abstract_canon_sha256":"6b49209efc88d5dddfd2b26c957ce2f73c2436892f1d218951d45db3d49c6605"},"schema_version":"1.0"},"canonical_sha256":"23e926d38613302da793437b169f69fe36a81042b6a292c6d37108f0f8c46b0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:43.809163Z","signature_b64":"GjPDxfkcfYluFcjMhIzkxOtLAuTm8/uv4wOu4dlKdwnHX3nH4HqIuS+sAypoc8km1R2iajCzGL/nmnlTqEvPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23e926d38613302da793437b169f69fe36a81042b6a292c6d37108f0f8c46b0f","last_reissued_at":"2026-05-18T00:20:43.808485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:43.808485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06768","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-18T00:20:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wjZfEKbLlJJSPa5LWIT8htdG9zAp2v7a4fjEvSdXRi5YiRnUY8XROgPSIWIzyriSYwXWeF+oP1zTQFKHAzx3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:33:49.106970Z"},"content_sha256":"63171d9b3d85cb7afda6e7e070f79b896fb4a58ff9d32ef9ba778f14d09bb9d2","schema_version":"1.0","event_id":"sha256:63171d9b3d85cb7afda6e7e070f79b896fb4a58ff9d32ef9ba778f14d09bb9d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EPUSNU4GCMYC3J4TIN5RNH3J7Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gallai's path decomposition conjecture for triangle-free planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrea Jim\\'enez, F\\'abio Botler, Maycon Sambinelli","submitted_at":"2018-03-19T00:50:50Z","abstract_excerpt":"A path decomposition of a graph $G$ is a collection of edge-disjoint paths of $G$ that covers the edge set of $G$. Gallai (1968) conjectured that every connected graph on $n$ vertices admits a path decomposition of cardinality at most $\\lfloor (n+1)/2\\rfloor$. Gallai's Conjecture has been verified for many classes of graphs. In particular, Lov\\'asz (1968) verified this conjecture for graphs with at most one vertex with even degree, and Pyber (1996) verified it for graphs in which every cycle contains a vertex with odd degree. Recently, Bonamy and Perrett (2016) verified Gallai's Conjecture for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06768","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-18T00:20:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E3JW/ixSY4ZgnA9dBR4wx8AC9Ui+rRLChIBdD0qs9mrDpCDImxPMFe29YGVbQEvEecW4i+vTO8bK8xWNuPzXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:33:49.107483Z"},"content_sha256":"78384396ce79b9e2b6b3f52952e07370375e68ba347a8cb70d394382dbd76117","schema_version":"1.0","event_id":"sha256:78384396ce79b9e2b6b3f52952e07370375e68ba347a8cb70d394382dbd76117"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EPUSNU4GCMYC3J4TIN5RNH3J7Y/bundle.json","state_url":"https://pith.science/pith/EPUSNU4GCMYC3J4TIN5RNH3J7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EPUSNU4GCMYC3J4TIN5RNH3J7Y/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-05-30T06:33:49Z","links":{"resolver":"https://pith.science/pith/EPUSNU4GCMYC3J4TIN5RNH3J7Y","bundle":"https://pith.science/pith/EPUSNU4GCMYC3J4TIN5RNH3J7Y/bundle.json","state":"https://pith.science/pith/EPUSNU4GCMYC3J4TIN5RNH3J7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EPUSNU4GCMYC3J4TIN5RNH3J7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EPUSNU4GCMYC3J4TIN5RNH3J7Y","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":"6b49209efc88d5dddfd2b26c957ce2f73c2436892f1d218951d45db3d49c6605","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-19T00:50:50Z","title_canon_sha256":"3ca1d0bf1f163fbeabcbe0f93b6e414221e2b45013b49804092dcf9a96c2012a"},"schema_version":"1.0","source":{"id":"1803.06768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06768","created_at":"2026-05-18T00:20:43Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06768v1","created_at":"2026-05-18T00:20:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06768","created_at":"2026-05-18T00:20:43Z"},{"alias_kind":"pith_short_12","alias_value":"EPUSNU4GCMYC","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EPUSNU4GCMYC3J4T","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EPUSNU4G","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:78384396ce79b9e2b6b3f52952e07370375e68ba347a8cb70d394382dbd76117","target":"graph","created_at":"2026-05-18T00:20:43Z","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":"A path decomposition of a graph $G$ is a collection of edge-disjoint paths of $G$ that covers the edge set of $G$. Gallai (1968) conjectured that every connected graph on $n$ vertices admits a path decomposition of cardinality at most $\\lfloor (n+1)/2\\rfloor$. Gallai's Conjecture has been verified for many classes of graphs. In particular, Lov\\'asz (1968) verified this conjecture for graphs with at most one vertex with even degree, and Pyber (1996) verified it for graphs in which every cycle contains a vertex with odd degree. Recently, Bonamy and Perrett (2016) verified Gallai's Conjecture for","authors_text":"Andrea Jim\\'enez, F\\'abio Botler, Maycon Sambinelli","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-19T00:50:50Z","title":"Gallai's path decomposition conjecture for triangle-free planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06768","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:63171d9b3d85cb7afda6e7e070f79b896fb4a58ff9d32ef9ba778f14d09bb9d2","target":"record","created_at":"2026-05-18T00:20:43Z","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":"6b49209efc88d5dddfd2b26c957ce2f73c2436892f1d218951d45db3d49c6605","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-19T00:50:50Z","title_canon_sha256":"3ca1d0bf1f163fbeabcbe0f93b6e414221e2b45013b49804092dcf9a96c2012a"},"schema_version":"1.0","source":{"id":"1803.06768","kind":"arxiv","version":1}},"canonical_sha256":"23e926d38613302da793437b169f69fe36a81042b6a292c6d37108f0f8c46b0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23e926d38613302da793437b169f69fe36a81042b6a292c6d37108f0f8c46b0f","first_computed_at":"2026-05-18T00:20:43.808485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:43.808485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GjPDxfkcfYluFcjMhIzkxOtLAuTm8/uv4wOu4dlKdwnHX3nH4HqIuS+sAypoc8km1R2iajCzGL/nmnlTqEvPDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:43.809163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63171d9b3d85cb7afda6e7e070f79b896fb4a58ff9d32ef9ba778f14d09bb9d2","sha256:78384396ce79b9e2b6b3f52952e07370375e68ba347a8cb70d394382dbd76117"],"state_sha256":"939c8f47d4d01dc0dcd2b4eb6f7f1e21fbca4eda450849869f6616969e046dbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h4+U0sUU38irTTVsmefmQU2D73J+cUJlHOMQi8LiKrbiG99XxzYNxhtgA96NvieiCPwxcWJWN6Rc+uCiBL4fDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:33:49.111190Z","bundle_sha256":"e1aaefd7a4552b81c43972b04c37e7f713b5ee9d2d7d4140b818627a0c6b1d18"}}