{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2HX2F5B3OZQDCQ2IY5ZGGTPPBB","short_pith_number":"pith:2HX2F5B3","canonical_record":{"source":{"id":"1310.0340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-28T19:34:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"25055dc75c35198bc4f65395c60e50c5b88597a178cf2d12e63679499c39996f","abstract_canon_sha256":"3ec9e1b30b58a1a7cc12df07e0b77037580264eac40ff0ad64cb53397e94adab"},"schema_version":"1.0"},"canonical_sha256":"d1efa2f43b7660314348c772634def086511b83bacc089945006ca5958f1c257","source":{"kind":"arxiv","id":"1310.0340","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0340","created_at":"2026-05-18T03:11:36Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0340v1","created_at":"2026-05-18T03:11:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0340","created_at":"2026-05-18T03:11:36Z"},{"alias_kind":"pith_short_12","alias_value":"2HX2F5B3OZQD","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2HX2F5B3OZQDCQ2I","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2HX2F5B3","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2HX2F5B3OZQDCQ2IY5ZGGTPPBB","target":"record","payload":{"canonical_record":{"source":{"id":"1310.0340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-28T19:34:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"25055dc75c35198bc4f65395c60e50c5b88597a178cf2d12e63679499c39996f","abstract_canon_sha256":"3ec9e1b30b58a1a7cc12df07e0b77037580264eac40ff0ad64cb53397e94adab"},"schema_version":"1.0"},"canonical_sha256":"d1efa2f43b7660314348c772634def086511b83bacc089945006ca5958f1c257","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:36.550103Z","signature_b64":"7NZw7+OaDUNX25rv1G/3mfYd+CeDc1+0S9uoSAE2Q7A7HTjlELpaOvQgyIp8b0qwsMNKI4I7nFp0R62KTSekAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1efa2f43b7660314348c772634def086511b83bacc089945006ca5958f1c257","last_reissued_at":"2026-05-18T03:11:36.549552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:36.549552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.0340","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-18T03:11:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocmOct9nJDRMJbLV2NlOytt8HJ8//zKs2Y4U96qpr2n0EJu62Cbf3BdRblV0Zvc5+EbqrtY26//KaCLXZxwDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:47:37.735020Z"},"content_sha256":"756c50210a9929d0e5588834730e8bfc421b2b87f94a0228f6067b6936f87867","schema_version":"1.0","event_id":"sha256:756c50210a9929d0e5588834730e8bfc421b2b87f94a0228f6067b6936f87867"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2HX2F5B3OZQDCQ2IY5ZGGTPPBB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Coloring Graphs without Paths and Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Pavol Hell, Shenwei Huang","submitted_at":"2013-09-28T19:34:49Z","abstract_excerpt":"Let $P_t$ and $C_\\ell$ denote a path on $t$ vertices and a cycle on $\\ell$ vertices, respectively. In this paper we study the $k$-coloring problem for $(P_t,C_\\ell)$-free graphs. Maffray and Morel, and Bruce, Hoang and Sawada, have proved that 3-colorability of $P_5$-free graphs has a finite forbidden induced subgraphs characterization, while Hoang, Moore, Recoskie, Sawada, and Vatshelle have shown that $k$-colorability of $P_5$-free graphs for $k \\geq 4$ does not. These authors have also shown, aided by a computer search, that 4-colorability of $(P_5,C_5)$-free graphs does have a finite forbi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0340","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-18T03:11:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jzOVDgLNQzYh3gdhojORRBVD1PUucv6h04KP0jhXfoJjk+8xn1ZWPvZKZVKXebeXa3ufxniDAvi92B6JRjeXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:47:37.735404Z"},"content_sha256":"fda3d0fa815d5ca16e785a70955531f3014b3169b3c4904d43842332c8b7e7c1","schema_version":"1.0","event_id":"sha256:fda3d0fa815d5ca16e785a70955531f3014b3169b3c4904d43842332c8b7e7c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HX2F5B3OZQDCQ2IY5ZGGTPPBB/bundle.json","state_url":"https://pith.science/pith/2HX2F5B3OZQDCQ2IY5ZGGTPPBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HX2F5B3OZQDCQ2IY5ZGGTPPBB/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-06-02T15:47:37Z","links":{"resolver":"https://pith.science/pith/2HX2F5B3OZQDCQ2IY5ZGGTPPBB","bundle":"https://pith.science/pith/2HX2F5B3OZQDCQ2IY5ZGGTPPBB/bundle.json","state":"https://pith.science/pith/2HX2F5B3OZQDCQ2IY5ZGGTPPBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HX2F5B3OZQDCQ2IY5ZGGTPPBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2HX2F5B3OZQDCQ2IY5ZGGTPPBB","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":"3ec9e1b30b58a1a7cc12df07e0b77037580264eac40ff0ad64cb53397e94adab","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-28T19:34:49Z","title_canon_sha256":"25055dc75c35198bc4f65395c60e50c5b88597a178cf2d12e63679499c39996f"},"schema_version":"1.0","source":{"id":"1310.0340","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0340","created_at":"2026-05-18T03:11:36Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0340v1","created_at":"2026-05-18T03:11:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0340","created_at":"2026-05-18T03:11:36Z"},{"alias_kind":"pith_short_12","alias_value":"2HX2F5B3OZQD","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2HX2F5B3OZQDCQ2I","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2HX2F5B3","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:fda3d0fa815d5ca16e785a70955531f3014b3169b3c4904d43842332c8b7e7c1","target":"graph","created_at":"2026-05-18T03:11:36Z","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":"Let $P_t$ and $C_\\ell$ denote a path on $t$ vertices and a cycle on $\\ell$ vertices, respectively. In this paper we study the $k$-coloring problem for $(P_t,C_\\ell)$-free graphs. Maffray and Morel, and Bruce, Hoang and Sawada, have proved that 3-colorability of $P_5$-free graphs has a finite forbidden induced subgraphs characterization, while Hoang, Moore, Recoskie, Sawada, and Vatshelle have shown that $k$-colorability of $P_5$-free graphs for $k \\geq 4$ does not. These authors have also shown, aided by a computer search, that 4-colorability of $(P_5,C_5)$-free graphs does have a finite forbi","authors_text":"Pavol Hell, Shenwei Huang","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-28T19:34:49Z","title":"Complexity of Coloring Graphs without Paths and Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0340","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:756c50210a9929d0e5588834730e8bfc421b2b87f94a0228f6067b6936f87867","target":"record","created_at":"2026-05-18T03:11:36Z","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":"3ec9e1b30b58a1a7cc12df07e0b77037580264eac40ff0ad64cb53397e94adab","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-28T19:34:49Z","title_canon_sha256":"25055dc75c35198bc4f65395c60e50c5b88597a178cf2d12e63679499c39996f"},"schema_version":"1.0","source":{"id":"1310.0340","kind":"arxiv","version":1}},"canonical_sha256":"d1efa2f43b7660314348c772634def086511b83bacc089945006ca5958f1c257","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1efa2f43b7660314348c772634def086511b83bacc089945006ca5958f1c257","first_computed_at":"2026-05-18T03:11:36.549552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:36.549552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7NZw7+OaDUNX25rv1G/3mfYd+CeDc1+0S9uoSAE2Q7A7HTjlELpaOvQgyIp8b0qwsMNKI4I7nFp0R62KTSekAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:36.550103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.0340","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:756c50210a9929d0e5588834730e8bfc421b2b87f94a0228f6067b6936f87867","sha256:fda3d0fa815d5ca16e785a70955531f3014b3169b3c4904d43842332c8b7e7c1"],"state_sha256":"3a06c3dbaaf1cea6b799fbfc996b4a4ca1d034b31f25288eedd5768d8729eeb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6dmaxvB29Xzy1gFZRpV5/Q93RYl5On3G7jDFi/H6AO9Hw2veEGl6oCyWH++RyKa6JtBiFTCLJH7mJkTAHb6BBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:47:37.737454Z","bundle_sha256":"dada2637ffe3ede23e47c3a4bc7bd8a5ddaac984050c9419d6fa19a5929a74a5"}}