{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FBEPOSXXYKGOI5NRD544OLACZV","short_pith_number":"pith:FBEPOSXX","canonical_record":{"source":{"id":"2607.27004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-29T15:00:04Z","cross_cats_sorted":[],"title_canon_sha256":"bd7e21d79d097e837a47b318448a31add1f57b0fc3517d029548b57d644d61c6","abstract_canon_sha256":"5553faffb2d9e5b620273f82435bf122496df519022e461c728fdc2fd0b5e056"},"schema_version":"1.0"},"canonical_sha256":"2848f74af7c28ce475b11f79c72c02cd5fe987869a0cb4905f91dea13b2068f4","source":{"kind":"arxiv","id":"2607.27004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27004","created_at":"2026-07-30T01:23:18Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27004v1","created_at":"2026-07-30T01:23:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27004","created_at":"2026-07-30T01:23:18Z"},{"alias_kind":"pith_short_12","alias_value":"FBEPOSXXYKGO","created_at":"2026-07-30T01:23:18Z"},{"alias_kind":"pith_short_16","alias_value":"FBEPOSXXYKGOI5NR","created_at":"2026-07-30T01:23:18Z"},{"alias_kind":"pith_short_8","alias_value":"FBEPOSXX","created_at":"2026-07-30T01:23:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FBEPOSXXYKGOI5NRD544OLACZV","target":"record","payload":{"canonical_record":{"source":{"id":"2607.27004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-29T15:00:04Z","cross_cats_sorted":[],"title_canon_sha256":"bd7e21d79d097e837a47b318448a31add1f57b0fc3517d029548b57d644d61c6","abstract_canon_sha256":"5553faffb2d9e5b620273f82435bf122496df519022e461c728fdc2fd0b5e056"},"schema_version":"1.0"},"canonical_sha256":"2848f74af7c28ce475b11f79c72c02cd5fe987869a0cb4905f91dea13b2068f4","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2848f74af7c28ce475b11f79c72c02cd5fe987869a0cb4905f91dea13b2068f4","last_reissued_at":"2026-07-30T01:23:18.605939Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:23:18.605939Z"},"source_kind":"arxiv","source_id":"2607.27004","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-07-30T01:23:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DypgRVwZhFN47Fkl8W/G/QC7mxBn4vb+PE85DT5Q1U8nPz+JeXDAE4JMKHIGJP2MG4oaw0+wbufsiB2KF+hAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T23:03:29.363460Z"},"content_sha256":"46d290ecc2ed6510698a0d97006d929961ddacd90607821d93fd7a423fc9e312","schema_version":"1.0","event_id":"sha256:46d290ecc2ed6510698a0d97006d929961ddacd90607821d93fd7a423fc9e312"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FBEPOSXXYKGOI5NRD544OLACZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Fair Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hossein Shokouhi, Ramin Javadi","submitted_at":"2026-07-29T15:00:04Z","abstract_excerpt":"Given a graph $G=(V,E)$, a (proper) $k$-coloring for $G$ is a vertex coloring with $k$ colors such that every two adjacent vertices receive different colors. Suppose that the vertex set $V$ is partitioned into some groups, a proper coloring is called fair if for every color class, the difference between the number of vertices in any two groups does not exceed a given threshold. In this paper, we investigate the parameterized complexity of the fair coloring problem with respect to the structural parameters of the input graph. In particular, we prove that the problem is W[1]-hard with respect to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27004","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.27004/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-30T01:23:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7awiZ8LSufbxEPx+BKCpeKXGW4E76o6X/js8xB8UIIgf3Xg0lxW7zKgOiQiS3L4k3qZrSx4gNPfIXXDRqoUyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T23:03:29.363974Z"},"content_sha256":"35c904607987017074ee0eba6eb492c3c289615b85055b5dbe54d5ac7447f98b","schema_version":"1.0","event_id":"sha256:35c904607987017074ee0eba6eb492c3c289615b85055b5dbe54d5ac7447f98b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBEPOSXXYKGOI5NRD544OLACZV/bundle.json","state_url":"https://pith.science/pith/FBEPOSXXYKGOI5NRD544OLACZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBEPOSXXYKGOI5NRD544OLACZV/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-18T23:03:29Z","links":{"resolver":"https://pith.science/pith/FBEPOSXXYKGOI5NRD544OLACZV","bundle":"https://pith.science/pith/FBEPOSXXYKGOI5NRD544OLACZV/bundle.json","state":"https://pith.science/pith/FBEPOSXXYKGOI5NRD544OLACZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBEPOSXXYKGOI5NRD544OLACZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FBEPOSXXYKGOI5NRD544OLACZV","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":"5553faffb2d9e5b620273f82435bf122496df519022e461c728fdc2fd0b5e056","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-29T15:00:04Z","title_canon_sha256":"bd7e21d79d097e837a47b318448a31add1f57b0fc3517d029548b57d644d61c6"},"schema_version":"1.0","source":{"id":"2607.27004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27004","created_at":"2026-07-30T01:23:18Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27004v1","created_at":"2026-07-30T01:23:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27004","created_at":"2026-07-30T01:23:18Z"},{"alias_kind":"pith_short_12","alias_value":"FBEPOSXXYKGO","created_at":"2026-07-30T01:23:18Z"},{"alias_kind":"pith_short_16","alias_value":"FBEPOSXXYKGOI5NR","created_at":"2026-07-30T01:23:18Z"},{"alias_kind":"pith_short_8","alias_value":"FBEPOSXX","created_at":"2026-07-30T01:23:18Z"}],"graph_snapshots":[{"event_id":"sha256:35c904607987017074ee0eba6eb492c3c289615b85055b5dbe54d5ac7447f98b","target":"graph","created_at":"2026-07-30T01:23:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.27004/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph $G=(V,E)$, a (proper) $k$-coloring for $G$ is a vertex coloring with $k$ colors such that every two adjacent vertices receive different colors. Suppose that the vertex set $V$ is partitioned into some groups, a proper coloring is called fair if for every color class, the difference between the number of vertices in any two groups does not exceed a given threshold. In this paper, we investigate the parameterized complexity of the fair coloring problem with respect to the structural parameters of the input graph. In particular, we prove that the problem is W[1]-hard with respect to","authors_text":"Hossein Shokouhi, Ramin Javadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27004","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:46d290ecc2ed6510698a0d97006d929961ddacd90607821d93fd7a423fc9e312","target":"record","created_at":"2026-07-30T01:23:18Z","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":"5553faffb2d9e5b620273f82435bf122496df519022e461c728fdc2fd0b5e056","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-29T15:00:04Z","title_canon_sha256":"bd7e21d79d097e837a47b318448a31add1f57b0fc3517d029548b57d644d61c6"},"schema_version":"1.0","source":{"id":"2607.27004","kind":"arxiv","version":1}},"canonical_sha256":"2848f74af7c28ce475b11f79c72c02cd5fe987869a0cb4905f91dea13b2068f4","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2848f74af7c28ce475b11f79c72c02cd5fe987869a0cb4905f91dea13b2068f4","first_computed_at":"2026-07-30T01:23:18.605939Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:23:18.605939Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46d290ecc2ed6510698a0d97006d929961ddacd90607821d93fd7a423fc9e312","sha256:35c904607987017074ee0eba6eb492c3c289615b85055b5dbe54d5ac7447f98b"],"state_sha256":"9af3ac5063cb44956075d235c38614d390278ba9b7c31c5a120c61878a62344d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhESm2dfenwxbDETUaDpgoXgvIBjWXGEtUEhI3VKoNM3+DTwwwP6DUjSH0z4z0MalFrnjxfjI1Qy0TVbyOLaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T23:03:29.367486Z","bundle_sha256":"29e9254e198a4b861262178a4e6bb403cfcfe8326cba1942322c57861892d415"}}