{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZJ65NTOIEQBLH7X2CID4WHKPCK","short_pith_number":"pith:ZJ65NTOI","canonical_record":{"source":{"id":"1706.04334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-14T07:03:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b49064463979d97fb84a68c5d2f10e9267e3aa30b302bf081c05b2d82478c902","abstract_canon_sha256":"75ad6c3a06b526de4379d1dbb081f9c9c3b6a84235126c5fa417e362f2d8d0d3"},"schema_version":"1.0"},"canonical_sha256":"ca7dd6cdc82402b3fefa1207cb1d4f128c1bb7d106b0350bb8ba3ae4bace1196","source":{"kind":"arxiv","id":"1706.04334","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04334","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04334v1","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04334","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZJ65NTOIEQBL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZJ65NTOIEQBLH7X2","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZJ65NTOI","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZJ65NTOIEQBLH7X2CID4WHKPCK","target":"record","payload":{"canonical_record":{"source":{"id":"1706.04334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-14T07:03:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b49064463979d97fb84a68c5d2f10e9267e3aa30b302bf081c05b2d82478c902","abstract_canon_sha256":"75ad6c3a06b526de4379d1dbb081f9c9c3b6a84235126c5fa417e362f2d8d0d3"},"schema_version":"1.0"},"canonical_sha256":"ca7dd6cdc82402b3fefa1207cb1d4f128c1bb7d106b0350bb8ba3ae4bace1196","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:22.959524Z","signature_b64":"UTGfhGgyIJ8/WbOZzG0UCiM1ZEdDmgyP1snHUtd6N01EcmI8doUhsw7+wCP/FU1vrQSg4mUKd/Vb1l0Yg4aHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca7dd6cdc82402b3fefa1207cb1d4f128c1bb7d106b0350bb8ba3ae4bace1196","last_reissued_at":"2026-05-18T00:42:22.958964Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:22.958964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.04334","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:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19eK0Jd0hojh5ZXXhrFOYWHfr8RHtpxujFtvouxFYP7VRcpgr+DZgpqymGLitCji9X/UYy3UQgCd6rxTGJ4XDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T13:21:28.098285Z"},"content_sha256":"7c02777087b4cc5a5342b29e27be8c0e9537973c80fb6e0e62e9a9edff525edd","schema_version":"1.0","event_id":"sha256:7c02777087b4cc5a5342b29e27be8c0e9537973c80fb6e0e62e9a9edff525edd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZJ65NTOIEQBLH7X2CID4WHKPCK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Gallai's and Haj\\'os' Conjectures for graphs with treewidth at most 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"F\\'abio Botler, Maycon Sambinelli, Orlando Lee, Rafael S. Coelho","submitted_at":"2017-06-14T07:03:06Z","abstract_excerpt":"A path (resp. cycle) decomposition of a graph $G$ is a set of edge-disjoint paths (resp. cycles) of $G$ that covers the edge set of $G$. Gallai (1966) conjectured that every graph on $n$ vertices admits a path decomposition of size at most $\\lfloor (n+1)/2\\rfloor$, and Haj\\'os (1968) conjectured that every Eulerian graph on $n$ vertices admits a cycle decomposition of size at most $\\lfloor (n-1)/2\\rfloor$. Gallai's Conjecture was verified for many classes of graphs. In particular, Lov\\'asz (1968) verified this conjecture for graphs with at most one vertex of even degree, and Pyber (1996) verif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04334","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:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sAN2WinlaeYR6hwlLpP1+B1D+1JojY+Yy3wPJxhcgW8mnhGasTKFIJ7yRk7FMoxFVNQq/d9mN9qrYlBMjkwLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T13:21:28.099108Z"},"content_sha256":"328e1199e86b71acf61c2806bbdaa213d751a776f3be17be345793cb020aad7c","schema_version":"1.0","event_id":"sha256:328e1199e86b71acf61c2806bbdaa213d751a776f3be17be345793cb020aad7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJ65NTOIEQBLH7X2CID4WHKPCK/bundle.json","state_url":"https://pith.science/pith/ZJ65NTOIEQBLH7X2CID4WHKPCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJ65NTOIEQBLH7X2CID4WHKPCK/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-22T13:21:28Z","links":{"resolver":"https://pith.science/pith/ZJ65NTOIEQBLH7X2CID4WHKPCK","bundle":"https://pith.science/pith/ZJ65NTOIEQBLH7X2CID4WHKPCK/bundle.json","state":"https://pith.science/pith/ZJ65NTOIEQBLH7X2CID4WHKPCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJ65NTOIEQBLH7X2CID4WHKPCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZJ65NTOIEQBLH7X2CID4WHKPCK","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":"75ad6c3a06b526de4379d1dbb081f9c9c3b6a84235126c5fa417e362f2d8d0d3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-14T07:03:06Z","title_canon_sha256":"b49064463979d97fb84a68c5d2f10e9267e3aa30b302bf081c05b2d82478c902"},"schema_version":"1.0","source":{"id":"1706.04334","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04334","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04334v1","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04334","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZJ65NTOIEQBL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZJ65NTOIEQBLH7X2","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZJ65NTOI","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:328e1199e86b71acf61c2806bbdaa213d751a776f3be17be345793cb020aad7c","target":"graph","created_at":"2026-05-18T00:42:22Z","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 (resp. cycle) decomposition of a graph $G$ is a set of edge-disjoint paths (resp. cycles) of $G$ that covers the edge set of $G$. Gallai (1966) conjectured that every graph on $n$ vertices admits a path decomposition of size at most $\\lfloor (n+1)/2\\rfloor$, and Haj\\'os (1968) conjectured that every Eulerian graph on $n$ vertices admits a cycle decomposition of size at most $\\lfloor (n-1)/2\\rfloor$. Gallai's Conjecture was verified for many classes of graphs. In particular, Lov\\'asz (1968) verified this conjecture for graphs with at most one vertex of even degree, and Pyber (1996) verif","authors_text":"F\\'abio Botler, Maycon Sambinelli, Orlando Lee, Rafael S. Coelho","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-14T07:03:06Z","title":"On Gallai's and Haj\\'os' Conjectures for graphs with treewidth at most 3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04334","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:7c02777087b4cc5a5342b29e27be8c0e9537973c80fb6e0e62e9a9edff525edd","target":"record","created_at":"2026-05-18T00:42:22Z","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":"75ad6c3a06b526de4379d1dbb081f9c9c3b6a84235126c5fa417e362f2d8d0d3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-14T07:03:06Z","title_canon_sha256":"b49064463979d97fb84a68c5d2f10e9267e3aa30b302bf081c05b2d82478c902"},"schema_version":"1.0","source":{"id":"1706.04334","kind":"arxiv","version":1}},"canonical_sha256":"ca7dd6cdc82402b3fefa1207cb1d4f128c1bb7d106b0350bb8ba3ae4bace1196","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca7dd6cdc82402b3fefa1207cb1d4f128c1bb7d106b0350bb8ba3ae4bace1196","first_computed_at":"2026-05-18T00:42:22.958964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:22.958964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UTGfhGgyIJ8/WbOZzG0UCiM1ZEdDmgyP1snHUtd6N01EcmI8doUhsw7+wCP/FU1vrQSg4mUKd/Vb1l0Yg4aHCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:22.959524Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04334","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c02777087b4cc5a5342b29e27be8c0e9537973c80fb6e0e62e9a9edff525edd","sha256:328e1199e86b71acf61c2806bbdaa213d751a776f3be17be345793cb020aad7c"],"state_sha256":"064ebb91a12f6dc08a23a8ade24fd3ea08495995874b6ce8044cddc24a4670ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tufs/kZjgXKTM20fx16Gi5fQizxkz3kEaUmtm2C2Sk2RkZGkp66Td5EtSbYal10cAFlhW6hbTPYQ+zn5Fx/LBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T13:21:28.103636Z","bundle_sha256":"4f5955c6e03ea85d224953e2179c6789df6b97a549d875539e42462783ba2f9c"}}