{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FULQAVMC5BFGQDWWJZ2BXBBJ32","short_pith_number":"pith:FULQAVMC","canonical_record":{"source":{"id":"1107.0056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-06-30T20:45:34Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"81026f70ff2813dc5dbba9e7c39e4b631bf7430c16ac60fec7c2effc701bb8ff","abstract_canon_sha256":"06231f127198cd591891f3ecb3826787241b76966f7b56dd444a50ece31aa5cf"},"schema_version":"1.0"},"canonical_sha256":"2d17005582e84a680ed64e741b8429de855283cb861f83b9d41cc7b84529ca56","source":{"kind":"arxiv","id":"1107.0056","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0056","created_at":"2026-05-18T04:13:15Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0056v2","created_at":"2026-05-18T04:13:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0056","created_at":"2026-05-18T04:13:15Z"},{"alias_kind":"pith_short_12","alias_value":"FULQAVMC5BFG","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FULQAVMC5BFGQDWW","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FULQAVMC","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FULQAVMC5BFGQDWWJZ2BXBBJ32","target":"record","payload":{"canonical_record":{"source":{"id":"1107.0056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-06-30T20:45:34Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"81026f70ff2813dc5dbba9e7c39e4b631bf7430c16ac60fec7c2effc701bb8ff","abstract_canon_sha256":"06231f127198cd591891f3ecb3826787241b76966f7b56dd444a50ece31aa5cf"},"schema_version":"1.0"},"canonical_sha256":"2d17005582e84a680ed64e741b8429de855283cb861f83b9d41cc7b84529ca56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:15.747196Z","signature_b64":"M95fgq3zEOXRQxYN4ohn5h23l2Rnx1duvZ2Rc25oaFT11XlGyHmRCzrZy4aPCFJcvc+qWM3bKoG6KXyPkIlkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d17005582e84a680ed64e741b8429de855283cb861f83b9d41cc7b84529ca56","last_reissued_at":"2026-05-18T04:13:15.746672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:15.746672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.0056","source_version":2,"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-18T04:13:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovFiE+lM2tbbQvdk3+ERQwNWDzjLc9w82zfoWi5PI6e+K6WZwnMgjC3dYZ3ItCyj+/3T+WHFZJJMk8yFEomNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:31:52.153498Z"},"content_sha256":"62224ef9970cef8ebd93ce86e8e1ff81d60cb0f7cc46237a844640f88f4d7b50","schema_version":"1.0","event_id":"sha256:62224ef9970cef8ebd93ce86e8e1ff81d60cb0f7cc46237a844640f88f4d7b50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FULQAVMC5BFGQDWWJZ2BXBBJ32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fixed parameter algorithms for restricted coloring problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Ana Karolinna Maia, Cl\\'audia Linhares-Sales, Nicolas Martins, Rudini Menezes Sampaio, Victor Campos","submitted_at":"2011-06-30T20:45:34Z","abstract_excerpt":"In this paper, we obtain polynomial time algorithms to determine the acyclic chromatic number, the star chromatic number, the Thue chromatic number, the harmonious chromatic number and the clique chromatic number of $P_4$-tidy graphs and $(q,q-4)$-graphs, for every fixed $q$. These classes include cographs, $P_4$-sparse and $P_4$-lite graphs. All these coloring problems are known to be NP-hard for general graphs. These algorithms are fixed parameter tractable on the parameter $q(G)$, which is the minimum $q$ such that $G$ is a $(q,q-4)$-graph. We also prove that every connected $(q,q-4)$-graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0056","kind":"arxiv","version":2},"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-18T04:13:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/1tNtliD8Ft569xTqxHJRajxZkdZxtBqTJuJfXG36O09+NHP9mThoN9SxJ9rAYGKZUW3fGckNO5wy+Xa3OtQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:31:52.153957Z"},"content_sha256":"d85bcae31465607d5a208a739523ce4a694d6ab66c35f044d4c310412bde785d","schema_version":"1.0","event_id":"sha256:d85bcae31465607d5a208a739523ce4a694d6ab66c35f044d4c310412bde785d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FULQAVMC5BFGQDWWJZ2BXBBJ32/bundle.json","state_url":"https://pith.science/pith/FULQAVMC5BFGQDWWJZ2BXBBJ32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FULQAVMC5BFGQDWWJZ2BXBBJ32/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-06T22:31:52Z","links":{"resolver":"https://pith.science/pith/FULQAVMC5BFGQDWWJZ2BXBBJ32","bundle":"https://pith.science/pith/FULQAVMC5BFGQDWWJZ2BXBBJ32/bundle.json","state":"https://pith.science/pith/FULQAVMC5BFGQDWWJZ2BXBBJ32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FULQAVMC5BFGQDWWJZ2BXBBJ32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FULQAVMC5BFGQDWWJZ2BXBBJ32","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":"06231f127198cd591891f3ecb3826787241b76966f7b56dd444a50ece31aa5cf","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-06-30T20:45:34Z","title_canon_sha256":"81026f70ff2813dc5dbba9e7c39e4b631bf7430c16ac60fec7c2effc701bb8ff"},"schema_version":"1.0","source":{"id":"1107.0056","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0056","created_at":"2026-05-18T04:13:15Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0056v2","created_at":"2026-05-18T04:13:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0056","created_at":"2026-05-18T04:13:15Z"},{"alias_kind":"pith_short_12","alias_value":"FULQAVMC5BFG","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FULQAVMC5BFGQDWW","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FULQAVMC","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:d85bcae31465607d5a208a739523ce4a694d6ab66c35f044d4c310412bde785d","target":"graph","created_at":"2026-05-18T04:13:15Z","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":"In this paper, we obtain polynomial time algorithms to determine the acyclic chromatic number, the star chromatic number, the Thue chromatic number, the harmonious chromatic number and the clique chromatic number of $P_4$-tidy graphs and $(q,q-4)$-graphs, for every fixed $q$. These classes include cographs, $P_4$-sparse and $P_4$-lite graphs. All these coloring problems are known to be NP-hard for general graphs. These algorithms are fixed parameter tractable on the parameter $q(G)$, which is the minimum $q$ such that $G$ is a $(q,q-4)$-graph. We also prove that every connected $(q,q-4)$-graph","authors_text":"Ana Karolinna Maia, Cl\\'audia Linhares-Sales, Nicolas Martins, Rudini Menezes Sampaio, Victor Campos","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-06-30T20:45:34Z","title":"Fixed parameter algorithms for restricted coloring problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0056","kind":"arxiv","version":2},"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:62224ef9970cef8ebd93ce86e8e1ff81d60cb0f7cc46237a844640f88f4d7b50","target":"record","created_at":"2026-05-18T04:13:15Z","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":"06231f127198cd591891f3ecb3826787241b76966f7b56dd444a50ece31aa5cf","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-06-30T20:45:34Z","title_canon_sha256":"81026f70ff2813dc5dbba9e7c39e4b631bf7430c16ac60fec7c2effc701bb8ff"},"schema_version":"1.0","source":{"id":"1107.0056","kind":"arxiv","version":2}},"canonical_sha256":"2d17005582e84a680ed64e741b8429de855283cb861f83b9d41cc7b84529ca56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d17005582e84a680ed64e741b8429de855283cb861f83b9d41cc7b84529ca56","first_computed_at":"2026-05-18T04:13:15.746672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:15.746672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M95fgq3zEOXRQxYN4ohn5h23l2Rnx1duvZ2Rc25oaFT11XlGyHmRCzrZy4aPCFJcvc+qWM3bKoG6KXyPkIlkBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:15.747196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.0056","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62224ef9970cef8ebd93ce86e8e1ff81d60cb0f7cc46237a844640f88f4d7b50","sha256:d85bcae31465607d5a208a739523ce4a694d6ab66c35f044d4c310412bde785d"],"state_sha256":"35332c1bcf43ff808a4affd4717fb87693249bbeee97a6af86b8cacf17832dca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LJBNzp1JQ30zPAH/+KnRL+hngHliWnH6yXpyTMLtLWlwqPMzUWtQK7OKom1VCd/aS+C+8sFa1SBhAImPCpJJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T22:31:52.157487Z","bundle_sha256":"ffe1fc1b7b9f56438587cb2c4b51b2a4d44507e838fa7dc29cb7742b377b83ab"}}