{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:X5WM7KB5WXDBTCCB3NPEZTBNXX","short_pith_number":"pith:X5WM7KB5","canonical_record":{"source":{"id":"1308.1820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-08T11:41:30Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"96b85811c704d5f68551bc3ca8ecba718683b82978b242d0443512f8c53609a3","abstract_canon_sha256":"d4c74d6c2a1440e12e799ce3883e45ff23aaa1abe98cf197b89ba2d74a0b19a7"},"schema_version":"1.0"},"canonical_sha256":"bf6ccfa83db5c6198841db5e4ccc2dbdf1622087da0d24e159dd9abfded031ca","source":{"kind":"arxiv","id":"1308.1820","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1820","created_at":"2026-05-18T02:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1820v2","created_at":"2026-05-18T02:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1820","created_at":"2026-05-18T02:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"X5WM7KB5WXDB","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X5WM7KB5WXDBTCCB","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X5WM7KB5","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:X5WM7KB5WXDBTCCB3NPEZTBNXX","target":"record","payload":{"canonical_record":{"source":{"id":"1308.1820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-08T11:41:30Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"96b85811c704d5f68551bc3ca8ecba718683b82978b242d0443512f8c53609a3","abstract_canon_sha256":"d4c74d6c2a1440e12e799ce3883e45ff23aaa1abe98cf197b89ba2d74a0b19a7"},"schema_version":"1.0"},"canonical_sha256":"bf6ccfa83db5c6198841db5e4ccc2dbdf1622087da0d24e159dd9abfded031ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:18.378757Z","signature_b64":"iPW8bFXJEVoLgOlbzXgqcW14Lhrj+sNjIdppenAuXot2GnoyP98/6rnP8Vi/eqjWFO09RVuyJ3cP1DTzuJ9yDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf6ccfa83db5c6198841db5e4ccc2dbdf1622087da0d24e159dd9abfded031ca","last_reissued_at":"2026-05-18T02:55:18.378371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:18.378371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.1820","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:55:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qWPIj+8SM0wPdBPQ0fp4iL6EREf3fsLDiBVLh9x9S21WAhr+3BdrQuwN+CkA7/votwgs5DQyOfDFaNWANachDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:56:41.102870Z"},"content_sha256":"265e364a69988b938600ca96ebd3a34768353fcf4f672ccfbc8bcc31fe6afe99","schema_version":"1.0","event_id":"sha256:265e364a69988b938600ca96ebd3a34768353fcf4f672ccfbc8bcc31fe6afe99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:X5WM7KB5WXDBTCCB3NPEZTBNXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Algorithms for Load Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Gregory Gutin, Mark Jones","submitted_at":"2013-08-08T11:41:30Z","abstract_excerpt":"One way to state the Load Coloring Problem (LCP) is as follows. Let $G=(V,E)$ be graph and let $f:V\\rightarrow \\{{\\rm red}, {\\rm blue}\\}$ be a 2-coloring. An edge $e\\in E$ is called red (blue) if both end-vertices of $e$ are red (blue). For a 2-coloring $f$, let $r'_f$ and $b'_f$ be the number of red and blue edges and let $\\mu_f(G)=\\min\\{r'_f,b'_f\\}$. Let $\\mu(G)$ be the maximum of $\\mu_f(G)$ over all 2-colorings.\n  We introduce the parameterized problem $k$-LCP of deciding whether $\\mu(G)\\ge k$, where $k$ is the parameter. We prove that this problem admits a kernel with at most $7k$. Ahuja e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1820","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:55:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J7SS0WpqEWaQkOiavsJAz4pQhHdA7XgVS7Dv9jN5IlNMDrqz9bCr9RJ9Ss8BVYZTw9TRXHAm8nn9eWX4YNCgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:56:41.103477Z"},"content_sha256":"2a122a05c0384b55143f779df864f2b7fc264fcc6800542cef11725d1cadc4c3","schema_version":"1.0","event_id":"sha256:2a122a05c0384b55143f779df864f2b7fc264fcc6800542cef11725d1cadc4c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5WM7KB5WXDBTCCB3NPEZTBNXX/bundle.json","state_url":"https://pith.science/pith/X5WM7KB5WXDBTCCB3NPEZTBNXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5WM7KB5WXDBTCCB3NPEZTBNXX/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-30T08:56:41Z","links":{"resolver":"https://pith.science/pith/X5WM7KB5WXDBTCCB3NPEZTBNXX","bundle":"https://pith.science/pith/X5WM7KB5WXDBTCCB3NPEZTBNXX/bundle.json","state":"https://pith.science/pith/X5WM7KB5WXDBTCCB3NPEZTBNXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5WM7KB5WXDBTCCB3NPEZTBNXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:X5WM7KB5WXDBTCCB3NPEZTBNXX","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":"d4c74d6c2a1440e12e799ce3883e45ff23aaa1abe98cf197b89ba2d74a0b19a7","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-08T11:41:30Z","title_canon_sha256":"96b85811c704d5f68551bc3ca8ecba718683b82978b242d0443512f8c53609a3"},"schema_version":"1.0","source":{"id":"1308.1820","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1820","created_at":"2026-05-18T02:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1820v2","created_at":"2026-05-18T02:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1820","created_at":"2026-05-18T02:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"X5WM7KB5WXDB","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X5WM7KB5WXDBTCCB","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X5WM7KB5","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:2a122a05c0384b55143f779df864f2b7fc264fcc6800542cef11725d1cadc4c3","target":"graph","created_at":"2026-05-18T02:55: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"},"paper":{"abstract_excerpt":"One way to state the Load Coloring Problem (LCP) is as follows. Let $G=(V,E)$ be graph and let $f:V\\rightarrow \\{{\\rm red}, {\\rm blue}\\}$ be a 2-coloring. An edge $e\\in E$ is called red (blue) if both end-vertices of $e$ are red (blue). For a 2-coloring $f$, let $r'_f$ and $b'_f$ be the number of red and blue edges and let $\\mu_f(G)=\\min\\{r'_f,b'_f\\}$. Let $\\mu(G)$ be the maximum of $\\mu_f(G)$ over all 2-colorings.\n  We introduce the parameterized problem $k$-LCP of deciding whether $\\mu(G)\\ge k$, where $k$ is the parameter. We prove that this problem admits a kernel with at most $7k$. Ahuja e","authors_text":"Gregory Gutin, Mark Jones","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-08T11:41:30Z","title":"Parameterized Algorithms for Load Coloring Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1820","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:265e364a69988b938600ca96ebd3a34768353fcf4f672ccfbc8bcc31fe6afe99","target":"record","created_at":"2026-05-18T02:55: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":"d4c74d6c2a1440e12e799ce3883e45ff23aaa1abe98cf197b89ba2d74a0b19a7","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-08T11:41:30Z","title_canon_sha256":"96b85811c704d5f68551bc3ca8ecba718683b82978b242d0443512f8c53609a3"},"schema_version":"1.0","source":{"id":"1308.1820","kind":"arxiv","version":2}},"canonical_sha256":"bf6ccfa83db5c6198841db5e4ccc2dbdf1622087da0d24e159dd9abfded031ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf6ccfa83db5c6198841db5e4ccc2dbdf1622087da0d24e159dd9abfded031ca","first_computed_at":"2026-05-18T02:55:18.378371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:18.378371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iPW8bFXJEVoLgOlbzXgqcW14Lhrj+sNjIdppenAuXot2GnoyP98/6rnP8Vi/eqjWFO09RVuyJ3cP1DTzuJ9yDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:18.378757Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1820","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:265e364a69988b938600ca96ebd3a34768353fcf4f672ccfbc8bcc31fe6afe99","sha256:2a122a05c0384b55143f779df864f2b7fc264fcc6800542cef11725d1cadc4c3"],"state_sha256":"4a97b9b6961da6b0edd38980a5d36b40ba3d3e5848b0dbd25441ca5848bf0048"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sO3HlOazSFvsDm9V80amRBMCmYnX9+9IsCD903jlAgx2xDxTP4aBw863cmSyl5O0+8P8TWufiv5OqTvsTU0wCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:56:41.106692Z","bundle_sha256":"dca2e4cbd0e9615751e3ac8b7ab36cde897be0934a52a065d5b9217831aac48f"}}