{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SRY4T3WML7Z544KRG7CFWCZ6D3","short_pith_number":"pith:SRY4T3WM","schema_version":"1.0","canonical_sha256":"9471c9eecc5ff3de715137c45b0b3e1ec0f4e71428a64e2a7addb3b82708a8fd","source":{"kind":"arxiv","id":"1309.1559","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.1559","created_at":"2026-05-18T03:13:59.153653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1559v1","created_at":"2026-05-18T03:13:59.153653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1559","created_at":"2026-05-18T03:13:59.153653+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRY4T3WML7Z5","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRY4T3WML7Z544KR","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRY4T3WM","created_at":"2026-05-18T12:27:59.945178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SRY4T3WML7Z544KRG7CFWCZ6D3","json":"https://pith.science/pith/SRY4T3WML7Z544KRG7CFWCZ6D3.json","graph_json":"https://pith.science/api/pith-number/SRY4T3WML7Z544KRG7CFWCZ6D3/graph.json","events_json":"https://pith.science/api/pith-number/SRY4T3WML7Z544KRG7CFWCZ6D3/events.json","paper":"https://pith.science/paper/SRY4T3WM"},"agent_actions":{"view_html":"https://pith.science/pith/SRY4T3WML7Z544KRG7CFWCZ6D3","download_json":"https://pith.science/pith/SRY4T3WML7Z544KRG7CFWCZ6D3.json","view_paper":"https://pith.science/paper/SRY4T3WM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1559&json=true","fetch_graph":"https://pith.science/api/pith-number/SRY4T3WML7Z544KRG7CFWCZ6D3/graph.json","fetch_events":"https://pith.science/api/pith-number/SRY4T3WML7Z544KRG7CFWCZ6D3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRY4T3WML7Z544KRG7CFWCZ6D3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRY4T3WML7Z544KRG7CFWCZ6D3/action/storage_attestation","attest_author":"https://pith.science/pith/SRY4T3WML7Z544KRG7CFWCZ6D3/action/author_attestation","sign_citation":"https://pith.science/pith/SRY4T3WML7Z544KRG7CFWCZ6D3/action/citation_signature","submit_replication":"https://pith.science/pith/SRY4T3WML7Z544KRG7CFWCZ6D3/action/replication_record"}},"created_at":"2026-05-18T03:13:59.153653+00:00","updated_at":"2026-05-18T03:13:59.153653+00:00"}