{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CIITG3CGE6G6OLQHXQUGPZYUJI","short_pith_number":"pith:CIITG3CG","canonical_record":{"source":{"id":"1409.8524","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-30T12:51:57Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"c879bc0def570d235eeb5f4ccbc60d5ddab323bdcf1c3182293cdd9def3b1859","abstract_canon_sha256":"0a78b2865a91e45c3a9705a3e2ed72b16235b89b9df57d766bb4c0bfbb5728a6"},"schema_version":"1.0"},"canonical_sha256":"1211336c46278de72e07bc2867e7144a2411edc8f583ecda7da2e398c1dc1f48","source":{"kind":"arxiv","id":"1409.8524","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8524","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8524v2","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8524","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"pith_short_12","alias_value":"CIITG3CGE6G6","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CIITG3CGE6G6OLQH","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CIITG3CG","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CIITG3CGE6G6OLQHXQUGPZYUJI","target":"record","payload":{"canonical_record":{"source":{"id":"1409.8524","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-30T12:51:57Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"c879bc0def570d235eeb5f4ccbc60d5ddab323bdcf1c3182293cdd9def3b1859","abstract_canon_sha256":"0a78b2865a91e45c3a9705a3e2ed72b16235b89b9df57d766bb4c0bfbb5728a6"},"schema_version":"1.0"},"canonical_sha256":"1211336c46278de72e07bc2867e7144a2411edc8f583ecda7da2e398c1dc1f48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:03.315363Z","signature_b64":"Ig6EhBXxl28IL9k3mrUM1T2XtH40qUW03wyqWkhI5WQicQ7vMEhA3dp9ipHpcQDpUVXBC87YS6p7Pc/RUWdJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1211336c46278de72e07bc2867e7144a2411edc8f583ecda7da2e398c1dc1f48","last_reissued_at":"2026-05-18T00:32:03.314844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:03.314844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.8524","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-18T00:32:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pT14At9kBvw0sLsWvjeSKxxGsgITglux5SCu9+YEIL3EZzybuGDaYRyYWn5ENMtjItUjwcerNtcenosSXkfGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:15:11.321541Z"},"content_sha256":"ec975ddb42591fe0e5b37a5655f7a0ad71ac57f90fd4ef8245064d9f8e49a417","schema_version":"1.0","event_id":"sha256:ec975ddb42591fe0e5b37a5655f7a0ad71ac57f90fd4ef8245064d9f8e49a417"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CIITG3CGE6G6OLQHXQUGPZYUJI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Minimum Feasible Tileset problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"Manuel Sorge, Stefan Kratsch, Yann Disser","submitted_at":"2014-09-30T12:51:57Z","abstract_excerpt":"We introduce and study the Minimum Feasible Tileset problem: Given a set of symbols and subsets of these symbols (scenarios), find a smallest possible number of pairs of symbols (tiles) such that each scenario can be formed by selecting at most one symbol from each tile. We show that this problem is APX-hard and that it is NP-hard even if each scenario contains at most three symbols. Our main result is a 4/3-approximation algorithm for the general case. In addition, we show that the Minimum Feasible Tileset problem is fixed-parameter tractable both when parameterized with the number of scenari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8524","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-18T00:32:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/AP5THEqVna8oPY5Ng2x9ejqcqkbDvUs9ie8nKiWL1I8i5t7ZgFI9t2/SGWME5k/B1HOxilGgssnBbFH2G8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:15:11.322198Z"},"content_sha256":"392462e05892f12d5b98add190b9b624ceacd4534ee3ef240330347b3b1c90d2","schema_version":"1.0","event_id":"sha256:392462e05892f12d5b98add190b9b624ceacd4534ee3ef240330347b3b1c90d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CIITG3CGE6G6OLQHXQUGPZYUJI/bundle.json","state_url":"https://pith.science/pith/CIITG3CGE6G6OLQHXQUGPZYUJI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CIITG3CGE6G6OLQHXQUGPZYUJI/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-06-07T09:15:11Z","links":{"resolver":"https://pith.science/pith/CIITG3CGE6G6OLQHXQUGPZYUJI","bundle":"https://pith.science/pith/CIITG3CGE6G6OLQHXQUGPZYUJI/bundle.json","state":"https://pith.science/pith/CIITG3CGE6G6OLQHXQUGPZYUJI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CIITG3CGE6G6OLQHXQUGPZYUJI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CIITG3CGE6G6OLQHXQUGPZYUJI","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":"0a78b2865a91e45c3a9705a3e2ed72b16235b89b9df57d766bb4c0bfbb5728a6","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-30T12:51:57Z","title_canon_sha256":"c879bc0def570d235eeb5f4ccbc60d5ddab323bdcf1c3182293cdd9def3b1859"},"schema_version":"1.0","source":{"id":"1409.8524","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8524","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8524v2","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8524","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"pith_short_12","alias_value":"CIITG3CGE6G6","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CIITG3CGE6G6OLQH","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CIITG3CG","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:392462e05892f12d5b98add190b9b624ceacd4534ee3ef240330347b3b1c90d2","target":"graph","created_at":"2026-05-18T00:32:03Z","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":"We introduce and study the Minimum Feasible Tileset problem: Given a set of symbols and subsets of these symbols (scenarios), find a smallest possible number of pairs of symbols (tiles) such that each scenario can be formed by selecting at most one symbol from each tile. We show that this problem is APX-hard and that it is NP-hard even if each scenario contains at most three symbols. Our main result is a 4/3-approximation algorithm for the general case. In addition, we show that the Minimum Feasible Tileset problem is fixed-parameter tractable both when parameterized with the number of scenari","authors_text":"Manuel Sorge, Stefan Kratsch, Yann Disser","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-30T12:51:57Z","title":"The Minimum Feasible Tileset problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8524","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:ec975ddb42591fe0e5b37a5655f7a0ad71ac57f90fd4ef8245064d9f8e49a417","target":"record","created_at":"2026-05-18T00:32:03Z","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":"0a78b2865a91e45c3a9705a3e2ed72b16235b89b9df57d766bb4c0bfbb5728a6","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-30T12:51:57Z","title_canon_sha256":"c879bc0def570d235eeb5f4ccbc60d5ddab323bdcf1c3182293cdd9def3b1859"},"schema_version":"1.0","source":{"id":"1409.8524","kind":"arxiv","version":2}},"canonical_sha256":"1211336c46278de72e07bc2867e7144a2411edc8f583ecda7da2e398c1dc1f48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1211336c46278de72e07bc2867e7144a2411edc8f583ecda7da2e398c1dc1f48","first_computed_at":"2026-05-18T00:32:03.314844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:03.314844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ig6EhBXxl28IL9k3mrUM1T2XtH40qUW03wyqWkhI5WQicQ7vMEhA3dp9ipHpcQDpUVXBC87YS6p7Pc/RUWdJAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:03.315363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.8524","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec975ddb42591fe0e5b37a5655f7a0ad71ac57f90fd4ef8245064d9f8e49a417","sha256:392462e05892f12d5b98add190b9b624ceacd4534ee3ef240330347b3b1c90d2"],"state_sha256":"8a084a86a47d7b6ce7decf9ebeab461bcd5ea3172dbbb63c764b160382abbba9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RceG0uKFuS9udMFRk4otJzvV3RFyqoVzmN2SnQXqR9eIZhy7aVOZupoKz7CqBFjcfhFH2eO4088ZjT1WzmRnCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:15:11.325572Z","bundle_sha256":"2c373f2a3a9270af763b2baf9ebdad7216fdfbcaf2f47aaac417269267402c84"}}