{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SRY4T3WML7Z544KRG7CFWCZ6D3","short_pith_number":"pith:SRY4T3WM","canonical_record":{"source":{"id":"1309.1559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-06T08:02:41Z","cross_cats_sorted":[],"title_canon_sha256":"00488ef5742909dbf0eb97feadff6edc4dc941453d6b75d404b14b63e86056b7","abstract_canon_sha256":"9df21b4be36e0fd1789e0e736d3132931795a269c68517d49808630551316b0d"},"schema_version":"1.0"},"canonical_sha256":"9471c9eecc5ff3de715137c45b0b3e1ec0f4e71428a64e2a7addb3b82708a8fd","source":{"kind":"arxiv","id":"1309.1559","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1559","created_at":"2026-05-18T03:13:59Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1559v1","created_at":"2026-05-18T03:13:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1559","created_at":"2026-05-18T03:13:59Z"},{"alias_kind":"pith_short_12","alias_value":"SRY4T3WML7Z5","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SRY4T3WML7Z544KR","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SRY4T3WM","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SRY4T3WML7Z544KRG7CFWCZ6D3","target":"record","payload":{"canonical_record":{"source":{"id":"1309.1559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-06T08:02:41Z","cross_cats_sorted":[],"title_canon_sha256":"00488ef5742909dbf0eb97feadff6edc4dc941453d6b75d404b14b63e86056b7","abstract_canon_sha256":"9df21b4be36e0fd1789e0e736d3132931795a269c68517d49808630551316b0d"},"schema_version":"1.0"},"canonical_sha256":"9471c9eecc5ff3de715137c45b0b3e1ec0f4e71428a64e2a7addb3b82708a8fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:59.154175Z","signature_b64":"oejGKbndXyfQx92YjMdUnuSooAnxGAMvHvo3HrFfykhAcWV0PV0Q39H5WVeVMhLtQVfIU1vqIA6qgXMsGw5hAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9471c9eecc5ff3de715137c45b0b3e1ec0f4e71428a64e2a7addb3b82708a8fd","last_reissued_at":"2026-05-18T03:13:59.153582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:59.153582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.1559","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:13:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uL5MhLTXR5hRb8J3YP7kKsUPT+nHGIbJ5i2kP/ZiCniTFBTB+5IUnrRxe4RckfAPtr/w/qMfIQxiVp7RRuhvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:44:57.096615Z"},"content_sha256":"d6acff258c59f7977995a9063381bbc2207d58481daf28376a320f083582ffc1","schema_version":"1.0","event_id":"sha256:d6acff258c59f7977995a9063381bbc2207d58481daf28376a320f083582ffc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SRY4T3WML7Z544KRG7CFWCZ6D3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large induced subgraphs via triangulations and CMSO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor Fomin, Ioan Todinca, Yngve Villanger","submitted_at":"2013-09-06T08:02:41Z","abstract_excerpt":"We obtain an algorithmic meta-theorem for the following optimization problem. Let \\phi\\ be a Counting Monadic Second Order Logic (CMSO) formula and t be an integer. For a given graph G, the task is to maximize |X| subject to the following: there is a set of vertices F of G, containing X, such that the subgraph G[F] induced by F is of treewidth at most t, and structure (G[F],X) models \\phi.\n  Some special cases of this optimization problem are the following generic examples. Each of these cases contains various problems as a special subcase:\n  1) \"Maximum induced subgraph with at most l copies "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1559","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:13:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eG1fmxAwSezt3OzESApsrEQlLqsI/FAFZIi52VoI4+ld+Ni6YFmj2tsVWCVsI74N1Z0RHSEGMxsYDYWXTspTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:44:57.096961Z"},"content_sha256":"d436022d8c16767c3c9654a23507d5638b7c8696d8cd2ba4ca4459e4631f2b74","schema_version":"1.0","event_id":"sha256:d436022d8c16767c3c9654a23507d5638b7c8696d8cd2ba4ca4459e4631f2b74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SRY4T3WML7Z544KRG7CFWCZ6D3/bundle.json","state_url":"https://pith.science/pith/SRY4T3WML7Z544KRG7CFWCZ6D3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SRY4T3WML7Z544KRG7CFWCZ6D3/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-01T14:44:57Z","links":{"resolver":"https://pith.science/pith/SRY4T3WML7Z544KRG7CFWCZ6D3","bundle":"https://pith.science/pith/SRY4T3WML7Z544KRG7CFWCZ6D3/bundle.json","state":"https://pith.science/pith/SRY4T3WML7Z544KRG7CFWCZ6D3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SRY4T3WML7Z544KRG7CFWCZ6D3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SRY4T3WML7Z544KRG7CFWCZ6D3","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":"9df21b4be36e0fd1789e0e736d3132931795a269c68517d49808630551316b0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-06T08:02:41Z","title_canon_sha256":"00488ef5742909dbf0eb97feadff6edc4dc941453d6b75d404b14b63e86056b7"},"schema_version":"1.0","source":{"id":"1309.1559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1559","created_at":"2026-05-18T03:13:59Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1559v1","created_at":"2026-05-18T03:13:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1559","created_at":"2026-05-18T03:13:59Z"},{"alias_kind":"pith_short_12","alias_value":"SRY4T3WML7Z5","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SRY4T3WML7Z544KR","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SRY4T3WM","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:d436022d8c16767c3c9654a23507d5638b7c8696d8cd2ba4ca4459e4631f2b74","target":"graph","created_at":"2026-05-18T03:13:59Z","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 obtain an algorithmic meta-theorem for the following optimization problem. Let \\phi\\ be a Counting Monadic Second Order Logic (CMSO) formula and t be an integer. For a given graph G, the task is to maximize |X| subject to the following: there is a set of vertices F of G, containing X, such that the subgraph G[F] induced by F is of treewidth at most t, and structure (G[F],X) models \\phi.\n  Some special cases of this optimization problem are the following generic examples. Each of these cases contains various problems as a special subcase:\n  1) \"Maximum induced subgraph with at most l copies ","authors_text":"Fedor Fomin, Ioan Todinca, Yngve Villanger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-06T08:02:41Z","title":"Large induced subgraphs via triangulations and CMSO"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1559","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:d6acff258c59f7977995a9063381bbc2207d58481daf28376a320f083582ffc1","target":"record","created_at":"2026-05-18T03:13:59Z","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":"9df21b4be36e0fd1789e0e736d3132931795a269c68517d49808630551316b0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-06T08:02:41Z","title_canon_sha256":"00488ef5742909dbf0eb97feadff6edc4dc941453d6b75d404b14b63e86056b7"},"schema_version":"1.0","source":{"id":"1309.1559","kind":"arxiv","version":1}},"canonical_sha256":"9471c9eecc5ff3de715137c45b0b3e1ec0f4e71428a64e2a7addb3b82708a8fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9471c9eecc5ff3de715137c45b0b3e1ec0f4e71428a64e2a7addb3b82708a8fd","first_computed_at":"2026-05-18T03:13:59.153582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:59.153582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oejGKbndXyfQx92YjMdUnuSooAnxGAMvHvo3HrFfykhAcWV0PV0Q39H5WVeVMhLtQVfIU1vqIA6qgXMsGw5hAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:59.154175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6acff258c59f7977995a9063381bbc2207d58481daf28376a320f083582ffc1","sha256:d436022d8c16767c3c9654a23507d5638b7c8696d8cd2ba4ca4459e4631f2b74"],"state_sha256":"30b60e116f578ff17b0fe5b41c4b576fdcbfd137d169c363d71c4b01964c9461"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mRnmgj1sDwah+l8LR2i+QqmlYF8AEHrJxS4Oo0MbwlcpEFqR9k91plV2MJEaEcoQHMRI2oi404vLaoS1LVV0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:44:57.098862Z","bundle_sha256":"5a1901c57aa6b3f66e16ce0a3c0a8e8293b2d2da2f2f6e4dcbd88d7f83d331d6"}}