{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:25UFFL4ZC22YZZSQSQJF4GWISP","short_pith_number":"pith:25UFFL4Z","schema_version":"1.0","canonical_sha256":"d76852af9916b58ce65094125e1ac893e7d72b98bccdf5d61f22cd4f0f2470e8","source":{"kind":"arxiv","id":"1211.1299","version":5},"attestation_state":"computed","paper":{"title":"Myhill-Nerode methods for hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.FL","math.CO"],"primary_cat":"cs.DM","authors_text":"Frances A. Rosamond, Michael R. Fellows, Ren\\'e van Bevern, Rodney G. Downey, Serge Gaspers","submitted_at":"2012-11-06T16:36:55Z","abstract_excerpt":"We give an analog of the Myhill-Nerode methods from formal language theory for hypergraphs and use it to derive the following results for two NP-hard hypergraph problems:\n  * We provide an algorithm for testing whether a hypergraph has cutwidth at most k that runs in linear time for constant k. In terms of parameterized complexity theory, the problem is fixed-parameter linear parameterized by k.\n  * We show that it is not expressible in monadic second-order logic whether a hypergraph has bounded (fractional, generalized) hypertree width. The proof leads us to conjecture that, in terms of param"},"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":"1211.1299","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-06T16:36:55Z","cross_cats_sorted":["cs.DS","cs.FL","math.CO"],"title_canon_sha256":"8a88f1ad3397e99a748c28c376cb7f32bb00c02325977766c7d14d61736e34fc","abstract_canon_sha256":"e7ab243facaab208f780301b2c7e2408f6427887848201ad7b0c565e41a39291"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:10.709658Z","signature_b64":"Y/5GhMdw3oc/CGCcnPWbufSOX9DpSXwrH3CrMpXH377JYL0ybgN/GaJWymFNIiqAvvVWZf7EJOhcOZk9Ts9pDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d76852af9916b58ce65094125e1ac893e7d72b98bccdf5d61f22cd4f0f2470e8","last_reissued_at":"2026-05-18T01:23:10.709102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:10.709102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Myhill-Nerode methods for hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.FL","math.CO"],"primary_cat":"cs.DM","authors_text":"Frances A. Rosamond, Michael R. Fellows, Ren\\'e van Bevern, Rodney G. Downey, Serge Gaspers","submitted_at":"2012-11-06T16:36:55Z","abstract_excerpt":"We give an analog of the Myhill-Nerode methods from formal language theory for hypergraphs and use it to derive the following results for two NP-hard hypergraph problems:\n  * We provide an algorithm for testing whether a hypergraph has cutwidth at most k that runs in linear time for constant k. In terms of parameterized complexity theory, the problem is fixed-parameter linear parameterized by k.\n  * We show that it is not expressible in monadic second-order logic whether a hypergraph has bounded (fractional, generalized) hypertree width. The proof leads us to conjecture that, in terms of param"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1299","kind":"arxiv","version":5},"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":"1211.1299","created_at":"2026-05-18T01:23:10.709181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1299v5","created_at":"2026-05-18T01:23:10.709181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1299","created_at":"2026-05-18T01:23:10.709181+00:00"},{"alias_kind":"pith_short_12","alias_value":"25UFFL4ZC22Y","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"25UFFL4ZC22YZZSQ","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"25UFFL4Z","created_at":"2026-05-18T12:26:50.516681+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/25UFFL4ZC22YZZSQSQJF4GWISP","json":"https://pith.science/pith/25UFFL4ZC22YZZSQSQJF4GWISP.json","graph_json":"https://pith.science/api/pith-number/25UFFL4ZC22YZZSQSQJF4GWISP/graph.json","events_json":"https://pith.science/api/pith-number/25UFFL4ZC22YZZSQSQJF4GWISP/events.json","paper":"https://pith.science/paper/25UFFL4Z"},"agent_actions":{"view_html":"https://pith.science/pith/25UFFL4ZC22YZZSQSQJF4GWISP","download_json":"https://pith.science/pith/25UFFL4ZC22YZZSQSQJF4GWISP.json","view_paper":"https://pith.science/paper/25UFFL4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1299&json=true","fetch_graph":"https://pith.science/api/pith-number/25UFFL4ZC22YZZSQSQJF4GWISP/graph.json","fetch_events":"https://pith.science/api/pith-number/25UFFL4ZC22YZZSQSQJF4GWISP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25UFFL4ZC22YZZSQSQJF4GWISP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25UFFL4ZC22YZZSQSQJF4GWISP/action/storage_attestation","attest_author":"https://pith.science/pith/25UFFL4ZC22YZZSQSQJF4GWISP/action/author_attestation","sign_citation":"https://pith.science/pith/25UFFL4ZC22YZZSQSQJF4GWISP/action/citation_signature","submit_replication":"https://pith.science/pith/25UFFL4ZC22YZZSQSQJF4GWISP/action/replication_record"}},"created_at":"2026-05-18T01:23:10.709181+00:00","updated_at":"2026-05-18T01:23:10.709181+00:00"}