{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NWO6MD7WOYPRYZQVKSI2KEMGAI","short_pith_number":"pith:NWO6MD7W","canonical_record":{"source":{"id":"1412.3023","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-09T17:08:13Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"78a2392a00cc9c452f0a3a63dab6e8dc834b8ad3be13e68879661223a5dd5c8a","abstract_canon_sha256":"4f6592e747a76426198b945f89c60025967915ffdd2ac9878928ff08bea3c743"},"schema_version":"1.0"},"canonical_sha256":"6d9de60ff6761f1c66155491a511860211c2f29103ad58de8afcf44c5efc5eb1","source":{"kind":"arxiv","id":"1412.3023","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3023","created_at":"2026-05-18T02:31:01Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3023v2","created_at":"2026-05-18T02:31:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3023","created_at":"2026-05-18T02:31:01Z"},{"alias_kind":"pith_short_12","alias_value":"NWO6MD7WOYPR","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NWO6MD7WOYPRYZQV","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NWO6MD7W","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NWO6MD7WOYPRYZQVKSI2KEMGAI","target":"record","payload":{"canonical_record":{"source":{"id":"1412.3023","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-09T17:08:13Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"78a2392a00cc9c452f0a3a63dab6e8dc834b8ad3be13e68879661223a5dd5c8a","abstract_canon_sha256":"4f6592e747a76426198b945f89c60025967915ffdd2ac9878928ff08bea3c743"},"schema_version":"1.0"},"canonical_sha256":"6d9de60ff6761f1c66155491a511860211c2f29103ad58de8afcf44c5efc5eb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:01.950375Z","signature_b64":"YLT8jNcogUo7b/g2Ljf1m3223nG82UU0CqlH6uuEE2izZJuWxzY5DBNNlyJjuGITdYZ1852ztu2V7zB+4nrXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d9de60ff6761f1c66155491a511860211c2f29103ad58de8afcf44c5efc5eb1","last_reissued_at":"2026-05-18T02:31:01.949911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:01.949911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.3023","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-18T02:31:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gGFlChUrW2kESnUleCd+S5Kh3SZUhP1mAL27BRwImIxTwnqB/tT5wvXEJvPkfOl+g9cIFsK84xz3ZL9ojrsBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:01:14.635302Z"},"content_sha256":"d309fdbc96f09a6a5fbca411d1563f6d451b68910b4c719b260669b4ee3f54bf","schema_version":"1.0","event_id":"sha256:d309fdbc96f09a6a5fbca411d1563f6d451b68910b4c719b260669b4ee3f54bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NWO6MD7WOYPRYZQVKSI2KEMGAI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized and Approximation Algorithms for the Load Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"B. Sheng, F. Barbero, G. Gutin, M. Jones","submitted_at":"2014-12-09T17:08:13Z","abstract_excerpt":"Let $c, k$ be two positive integers and let $G=(V,E)$ be a graph. The $(c,k)$-Load Coloring Problem (denoted $(c,k)$-LCP) asks whether there is a $c$-coloring $\\varphi: V \\rightarrow [c]$ such that for every $i \\in [c]$, there are at least $k$ edges with both endvertices colored $i$. Gutin and Jones (IPL 2014) studied this problem with $c=2$. They showed $(2,k)$-LCP to be fixed parameter tractable (FPT) with parameter $k$ by obtaining a kernel with at most $7k$ vertices. In this paper, we extend the study to any fixed $c$ by giving both a linear-vertex and a linear-edge kernel. In the particul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3023","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-18T02:31:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jsinPDPfgM9fYDvVXWb4/3MxDuHWgm9DQeI3VNC99B58aCxF+BR2GReqpxHfPujWicZGoYG913+eHD4cAjzSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:01:14.635918Z"},"content_sha256":"d38baa7060895151b0ccf9fb00640ff8eb5e34a0df64a3e3968761adb23b6981","schema_version":"1.0","event_id":"sha256:d38baa7060895151b0ccf9fb00640ff8eb5e34a0df64a3e3968761adb23b6981"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWO6MD7WOYPRYZQVKSI2KEMGAI/bundle.json","state_url":"https://pith.science/pith/NWO6MD7WOYPRYZQVKSI2KEMGAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWO6MD7WOYPRYZQVKSI2KEMGAI/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-28T02:01:14Z","links":{"resolver":"https://pith.science/pith/NWO6MD7WOYPRYZQVKSI2KEMGAI","bundle":"https://pith.science/pith/NWO6MD7WOYPRYZQVKSI2KEMGAI/bundle.json","state":"https://pith.science/pith/NWO6MD7WOYPRYZQVKSI2KEMGAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWO6MD7WOYPRYZQVKSI2KEMGAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NWO6MD7WOYPRYZQVKSI2KEMGAI","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":"4f6592e747a76426198b945f89c60025967915ffdd2ac9878928ff08bea3c743","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-09T17:08:13Z","title_canon_sha256":"78a2392a00cc9c452f0a3a63dab6e8dc834b8ad3be13e68879661223a5dd5c8a"},"schema_version":"1.0","source":{"id":"1412.3023","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3023","created_at":"2026-05-18T02:31:01Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3023v2","created_at":"2026-05-18T02:31:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3023","created_at":"2026-05-18T02:31:01Z"},{"alias_kind":"pith_short_12","alias_value":"NWO6MD7WOYPR","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NWO6MD7WOYPRYZQV","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NWO6MD7W","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:d38baa7060895151b0ccf9fb00640ff8eb5e34a0df64a3e3968761adb23b6981","target":"graph","created_at":"2026-05-18T02:31:01Z","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 $c, k$ be two positive integers and let $G=(V,E)$ be a graph. The $(c,k)$-Load Coloring Problem (denoted $(c,k)$-LCP) asks whether there is a $c$-coloring $\\varphi: V \\rightarrow [c]$ such that for every $i \\in [c]$, there are at least $k$ edges with both endvertices colored $i$. Gutin and Jones (IPL 2014) studied this problem with $c=2$. They showed $(2,k)$-LCP to be fixed parameter tractable (FPT) with parameter $k$ by obtaining a kernel with at most $7k$ vertices. In this paper, we extend the study to any fixed $c$ by giving both a linear-vertex and a linear-edge kernel. In the particul","authors_text":"B. Sheng, F. Barbero, G. Gutin, M. Jones","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-09T17:08:13Z","title":"Parameterized and Approximation Algorithms for the Load Coloring Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3023","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:d309fdbc96f09a6a5fbca411d1563f6d451b68910b4c719b260669b4ee3f54bf","target":"record","created_at":"2026-05-18T02:31:01Z","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":"4f6592e747a76426198b945f89c60025967915ffdd2ac9878928ff08bea3c743","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-09T17:08:13Z","title_canon_sha256":"78a2392a00cc9c452f0a3a63dab6e8dc834b8ad3be13e68879661223a5dd5c8a"},"schema_version":"1.0","source":{"id":"1412.3023","kind":"arxiv","version":2}},"canonical_sha256":"6d9de60ff6761f1c66155491a511860211c2f29103ad58de8afcf44c5efc5eb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d9de60ff6761f1c66155491a511860211c2f29103ad58de8afcf44c5efc5eb1","first_computed_at":"2026-05-18T02:31:01.949911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:01.949911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YLT8jNcogUo7b/g2Ljf1m3223nG82UU0CqlH6uuEE2izZJuWxzY5DBNNlyJjuGITdYZ1852ztu2V7zB+4nrXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:01.950375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3023","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d309fdbc96f09a6a5fbca411d1563f6d451b68910b4c719b260669b4ee3f54bf","sha256:d38baa7060895151b0ccf9fb00640ff8eb5e34a0df64a3e3968761adb23b6981"],"state_sha256":"881a6ccc0928a0f3e004c9b6b7f6f25fe75f76ec36592a17fbd8a63148bd3162"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mGg74En9GYRdeXEzEeSF9nMxwl6D2RA7wy/zxoHFBevxL+YpP2/YtgNHwmtj+u+NdDXBgQ34HkQmy4SaXI+3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:01:14.638688Z","bundle_sha256":"3c2e7e23d58eb788dae3d86111a330c8be66229018f382b4a43f25538258885a"}}