{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PQMQOPZ5PVB3OFL4APCYI7OAJW","short_pith_number":"pith:PQMQOPZ5","canonical_record":{"source":{"id":"1311.1298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-06T06:57:25Z","cross_cats_sorted":[],"title_canon_sha256":"b22d98b7e077b8109199a29a9745f36fae55c6090ccb7ebfaa59eb7e98f5edd6","abstract_canon_sha256":"7bdce56c813586719c3c04ae266d5f6b100572b68e241410cb321ed06b89ae0b"},"schema_version":"1.0"},"canonical_sha256":"7c19073f3d7d43b7157c03c5847dc04da0b0bcc350c23b9a4bc9c5a02fd48272","source":{"kind":"arxiv","id":"1311.1298","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1298","created_at":"2026-05-18T03:07:53Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1298v1","created_at":"2026-05-18T03:07:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1298","created_at":"2026-05-18T03:07:53Z"},{"alias_kind":"pith_short_12","alias_value":"PQMQOPZ5PVB3","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PQMQOPZ5PVB3OFL4","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PQMQOPZ5","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PQMQOPZ5PVB3OFL4APCYI7OAJW","target":"record","payload":{"canonical_record":{"source":{"id":"1311.1298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-06T06:57:25Z","cross_cats_sorted":[],"title_canon_sha256":"b22d98b7e077b8109199a29a9745f36fae55c6090ccb7ebfaa59eb7e98f5edd6","abstract_canon_sha256":"7bdce56c813586719c3c04ae266d5f6b100572b68e241410cb321ed06b89ae0b"},"schema_version":"1.0"},"canonical_sha256":"7c19073f3d7d43b7157c03c5847dc04da0b0bcc350c23b9a4bc9c5a02fd48272","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:53.770906Z","signature_b64":"NAvvkcoZDB5Bg+Xg4qu0WVkfxsvyRWvJMkdQlsdCJRq0TDVGPCC1M0H6ZEsvdgL+MeijmBObTR/8y9F143RCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c19073f3d7d43b7157c03c5847dc04da0b0bcc350c23b9a4bc9c5a02fd48272","last_reissued_at":"2026-05-18T03:07:53.770071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:53.770071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.1298","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-05-18T03:07:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Qdh6TspsdF+usEEYRkPyQtg7oy7lSyEVLGYg1cUHMD1bbdSpWB2XAa2L7NBjOz0vhYFp4E6IgMNr519aAi1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T17:08:33.982381Z"},"content_sha256":"ab07d4d950163fa37ae64a381b27cf7f5eb0476ddc710b2c44a0ad8b7c753346","schema_version":"1.0","event_id":"sha256:ab07d4d950163fa37ae64a381b27cf7f5eb0476ddc710b2c44a0ad8b7c753346"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PQMQOPZ5PVB3OFL4APCYI7OAJW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic and Hardness Results for the Colorful Components Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru Popa, Anna Adamaszek","submitted_at":"2013-11-06T06:57:25Z","abstract_excerpt":"In this paper we investigate the colorful components framework, motivated by applications emerging from comparative genomics. The general goal is to remove a collection of edges from an undirected vertex-colored graph $G$ such that in the resulting graph $G'$ all the connected components are colorful (i.e., any two vertices of the same color belong to different connected components). We want $G'$ to optimize an objective function, the selection of this function being specific to each problem in the framework.\n  We analyze three objective functions, and thus, three different problems, which are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1298","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":""},"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-18T03:07:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qpnVihSI65TVvZniBa0horOy6Vb1/3n40e8DWf5DzJYXA7jz7AFZwpqBcjOsfDyK7FlEuqmznQV5nNzOamsaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T17:08:33.982726Z"},"content_sha256":"0fcb3dfa5b64bba86fec9d780553b9d687766866847c02c53250bf8f43c6fbca","schema_version":"1.0","event_id":"sha256:0fcb3dfa5b64bba86fec9d780553b9d687766866847c02c53250bf8f43c6fbca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PQMQOPZ5PVB3OFL4APCYI7OAJW/bundle.json","state_url":"https://pith.science/pith/PQMQOPZ5PVB3OFL4APCYI7OAJW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PQMQOPZ5PVB3OFL4APCYI7OAJW/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-03T17:08:33Z","links":{"resolver":"https://pith.science/pith/PQMQOPZ5PVB3OFL4APCYI7OAJW","bundle":"https://pith.science/pith/PQMQOPZ5PVB3OFL4APCYI7OAJW/bundle.json","state":"https://pith.science/pith/PQMQOPZ5PVB3OFL4APCYI7OAJW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PQMQOPZ5PVB3OFL4APCYI7OAJW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PQMQOPZ5PVB3OFL4APCYI7OAJW","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":"7bdce56c813586719c3c04ae266d5f6b100572b68e241410cb321ed06b89ae0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-06T06:57:25Z","title_canon_sha256":"b22d98b7e077b8109199a29a9745f36fae55c6090ccb7ebfaa59eb7e98f5edd6"},"schema_version":"1.0","source":{"id":"1311.1298","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1298","created_at":"2026-05-18T03:07:53Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1298v1","created_at":"2026-05-18T03:07:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1298","created_at":"2026-05-18T03:07:53Z"},{"alias_kind":"pith_short_12","alias_value":"PQMQOPZ5PVB3","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PQMQOPZ5PVB3OFL4","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PQMQOPZ5","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:0fcb3dfa5b64bba86fec9d780553b9d687766866847c02c53250bf8f43c6fbca","target":"graph","created_at":"2026-05-18T03:07:53Z","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 investigate the colorful components framework, motivated by applications emerging from comparative genomics. The general goal is to remove a collection of edges from an undirected vertex-colored graph $G$ such that in the resulting graph $G'$ all the connected components are colorful (i.e., any two vertices of the same color belong to different connected components). We want $G'$ to optimize an objective function, the selection of this function being specific to each problem in the framework.\n  We analyze three objective functions, and thus, three different problems, which are","authors_text":"Alexandru Popa, Anna Adamaszek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-06T06:57:25Z","title":"Algorithmic and Hardness Results for the Colorful Components Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1298","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:ab07d4d950163fa37ae64a381b27cf7f5eb0476ddc710b2c44a0ad8b7c753346","target":"record","created_at":"2026-05-18T03:07:53Z","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":"7bdce56c813586719c3c04ae266d5f6b100572b68e241410cb321ed06b89ae0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-06T06:57:25Z","title_canon_sha256":"b22d98b7e077b8109199a29a9745f36fae55c6090ccb7ebfaa59eb7e98f5edd6"},"schema_version":"1.0","source":{"id":"1311.1298","kind":"arxiv","version":1}},"canonical_sha256":"7c19073f3d7d43b7157c03c5847dc04da0b0bcc350c23b9a4bc9c5a02fd48272","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c19073f3d7d43b7157c03c5847dc04da0b0bcc350c23b9a4bc9c5a02fd48272","first_computed_at":"2026-05-18T03:07:53.770071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:53.770071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NAvvkcoZDB5Bg+Xg4qu0WVkfxsvyRWvJMkdQlsdCJRq0TDVGPCC1M0H6ZEsvdgL+MeijmBObTR/8y9F143RCAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:53.770906Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.1298","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab07d4d950163fa37ae64a381b27cf7f5eb0476ddc710b2c44a0ad8b7c753346","sha256:0fcb3dfa5b64bba86fec9d780553b9d687766866847c02c53250bf8f43c6fbca"],"state_sha256":"de1adbce140567671e985e2aff2bec2febbcaa1116594b9c21a28af3875a133d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I/DrYyWsjSNWUV797sdEU/ANOn56v8W/XDnS+F6/gG4y6ZjA9TeuMSm1cskQWZ/bff+AEjD0n7JhkYqMZfUeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T17:08:33.984574Z","bundle_sha256":"a40a36a39dd6070249ec3da827cf1dbc7ee3b12678756580e96fc0fb22a92870"}}