{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:3OQLUX43Q6FH52K6DTL7YDKKCK","short_pith_number":"pith:3OQLUX43","canonical_record":{"source":{"id":"2302.00630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-01T17:49:50Z","cross_cats_sorted":[],"title_canon_sha256":"886d544c0eff75c5dd0637a4de2761e36255d04dbfb1ce2c8bc801e31ee17eee","abstract_canon_sha256":"9a01a7d68cb48e43c07e1bb21a8cf4db19b60c2d8ba0659a4a07c9b2e8cb8d0f"},"schema_version":"1.0"},"canonical_sha256":"dba0ba5f9b878a7ee95e1cd7fc0d4a128f886cdf5cbe8af32591974d2bdb9b48","source":{"kind":"arxiv","id":"2302.00630","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.00630","created_at":"2026-07-05T05:38:05Z"},{"alias_kind":"arxiv_version","alias_value":"2302.00630v1","created_at":"2026-07-05T05:38:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.00630","created_at":"2026-07-05T05:38:05Z"},{"alias_kind":"pith_short_12","alias_value":"3OQLUX43Q6FH","created_at":"2026-07-05T05:38:05Z"},{"alias_kind":"pith_short_16","alias_value":"3OQLUX43Q6FH52K6","created_at":"2026-07-05T05:38:05Z"},{"alias_kind":"pith_short_8","alias_value":"3OQLUX43","created_at":"2026-07-05T05:38:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:3OQLUX43Q6FH52K6DTL7YDKKCK","target":"record","payload":{"canonical_record":{"source":{"id":"2302.00630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-01T17:49:50Z","cross_cats_sorted":[],"title_canon_sha256":"886d544c0eff75c5dd0637a4de2761e36255d04dbfb1ce2c8bc801e31ee17eee","abstract_canon_sha256":"9a01a7d68cb48e43c07e1bb21a8cf4db19b60c2d8ba0659a4a07c9b2e8cb8d0f"},"schema_version":"1.0"},"canonical_sha256":"dba0ba5f9b878a7ee95e1cd7fc0d4a128f886cdf5cbe8af32591974d2bdb9b48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:05.493030Z","signature_b64":"Ab5UlwtOIOLlcOPfZL/bI7MnpxdS3JCuJDC1qLNuiALQSonY3wmhu803Nl8c20wJYtzYaagsP3CeaDTEx6hvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dba0ba5f9b878a7ee95e1cd7fc0d4a128f886cdf5cbe8af32591974d2bdb9b48","last_reissued_at":"2026-07-05T05:38:05.492484Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:05.492484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.00630","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-05T05:38:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"de4u9XLrOtHS3qXoTllMO9eVmlKyY9Dsqaq8HJDVRAIFg54RWX0PDXL29YFF9hrnfCFOVTU4aSm87LXqrfADAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:52:54.026698Z"},"content_sha256":"437008f7b60e4c817144c3872414790086f1ed5f126871696abbbc9a593f4e5b","schema_version":"1.0","event_id":"sha256:437008f7b60e4c817144c3872414790086f1ed5f126871696abbbc9a593f4e5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:3OQLUX43Q6FH52K6DTL7YDKKCK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Algorithms for Colored Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Leon Kellerhals, Pascal Kunz, Rolf Niedermeier, Tomohiro Koana","submitted_at":"2023-02-01T17:49:50Z","abstract_excerpt":"In the Colored Clustering problem, one is asked to cluster edge-colored (hyper-)graphs whose colors represent interaction types. More specifically, the goal is to select as many edges as possible without choosing two edges that share an endpoint and are colored differently. Equivalently, the goal can also be described as assigning colors to the vertices in a way that fits the edge-coloring as well as possible. As this problem is NP-hard, we build on previous work by studying its parameterized complexity. We give a $2^{\\mathcal O(k)} \\cdot n^{\\mathcal O(1)}$-time algorithm where $k$ is the numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.00630","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/2302.00630/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-05T05:38:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VWqAK5vY1x39/vyyVIZZrjJ+blwscHVdOXcox3ZN0X21WlUD5Fv26Jq7RNwLKKk7m8Co1S2DQ4dD3SoSabHiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:52:54.027298Z"},"content_sha256":"9857b9c660db4310c776fa30de9949b8470039c437513f4aa312c670a0eb18a8","schema_version":"1.0","event_id":"sha256:9857b9c660db4310c776fa30de9949b8470039c437513f4aa312c670a0eb18a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3OQLUX43Q6FH52K6DTL7YDKKCK/bundle.json","state_url":"https://pith.science/pith/3OQLUX43Q6FH52K6DTL7YDKKCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3OQLUX43Q6FH52K6DTL7YDKKCK/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-07-07T03:52:54Z","links":{"resolver":"https://pith.science/pith/3OQLUX43Q6FH52K6DTL7YDKKCK","bundle":"https://pith.science/pith/3OQLUX43Q6FH52K6DTL7YDKKCK/bundle.json","state":"https://pith.science/pith/3OQLUX43Q6FH52K6DTL7YDKKCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3OQLUX43Q6FH52K6DTL7YDKKCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:3OQLUX43Q6FH52K6DTL7YDKKCK","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":"9a01a7d68cb48e43c07e1bb21a8cf4db19b60c2d8ba0659a4a07c9b2e8cb8d0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-01T17:49:50Z","title_canon_sha256":"886d544c0eff75c5dd0637a4de2761e36255d04dbfb1ce2c8bc801e31ee17eee"},"schema_version":"1.0","source":{"id":"2302.00630","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.00630","created_at":"2026-07-05T05:38:05Z"},{"alias_kind":"arxiv_version","alias_value":"2302.00630v1","created_at":"2026-07-05T05:38:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.00630","created_at":"2026-07-05T05:38:05Z"},{"alias_kind":"pith_short_12","alias_value":"3OQLUX43Q6FH","created_at":"2026-07-05T05:38:05Z"},{"alias_kind":"pith_short_16","alias_value":"3OQLUX43Q6FH52K6","created_at":"2026-07-05T05:38:05Z"},{"alias_kind":"pith_short_8","alias_value":"3OQLUX43","created_at":"2026-07-05T05:38:05Z"}],"graph_snapshots":[{"event_id":"sha256:9857b9c660db4310c776fa30de9949b8470039c437513f4aa312c670a0eb18a8","target":"graph","created_at":"2026-07-05T05:38:05Z","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/2302.00630/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the Colored Clustering problem, one is asked to cluster edge-colored (hyper-)graphs whose colors represent interaction types. More specifically, the goal is to select as many edges as possible without choosing two edges that share an endpoint and are colored differently. Equivalently, the goal can also be described as assigning colors to the vertices in a way that fits the edge-coloring as well as possible. As this problem is NP-hard, we build on previous work by studying its parameterized complexity. We give a $2^{\\mathcal O(k)} \\cdot n^{\\mathcal O(1)}$-time algorithm where $k$ is the numb","authors_text":"Leon Kellerhals, Pascal Kunz, Rolf Niedermeier, Tomohiro Koana","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-01T17:49:50Z","title":"Parameterized Algorithms for Colored Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.00630","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:437008f7b60e4c817144c3872414790086f1ed5f126871696abbbc9a593f4e5b","target":"record","created_at":"2026-07-05T05:38:05Z","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":"9a01a7d68cb48e43c07e1bb21a8cf4db19b60c2d8ba0659a4a07c9b2e8cb8d0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-01T17:49:50Z","title_canon_sha256":"886d544c0eff75c5dd0637a4de2761e36255d04dbfb1ce2c8bc801e31ee17eee"},"schema_version":"1.0","source":{"id":"2302.00630","kind":"arxiv","version":1}},"canonical_sha256":"dba0ba5f9b878a7ee95e1cd7fc0d4a128f886cdf5cbe8af32591974d2bdb9b48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dba0ba5f9b878a7ee95e1cd7fc0d4a128f886cdf5cbe8af32591974d2bdb9b48","first_computed_at":"2026-07-05T05:38:05.492484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:38:05.492484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ab5UlwtOIOLlcOPfZL/bI7MnpxdS3JCuJDC1qLNuiALQSonY3wmhu803Nl8c20wJYtzYaagsP3CeaDTEx6hvAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:38:05.493030Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.00630","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:437008f7b60e4c817144c3872414790086f1ed5f126871696abbbc9a593f4e5b","sha256:9857b9c660db4310c776fa30de9949b8470039c437513f4aa312c670a0eb18a8"],"state_sha256":"016815823a354f37bf2d2c2dc517af0a6bca928156925cb55e58d0a4b7e14cad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CYSvlx262MT7+iIbHOAfnTbTwbzEVhbd6MJ5uBcwPMVmxghiW+5gCXw9nEaTkcHGL9ITDDTY2egqTkGDWvSBDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T03:52:54.030000Z","bundle_sha256":"e1a0a82d772fb83fa403f403b9da4b4d6b00c62010840da8a1826e2cfa1f7544"}}