{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:25UFFL4ZC22YZZSQSQJF4GWISP","short_pith_number":"pith:25UFFL4Z","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"},"canonical_sha256":"d76852af9916b58ce65094125e1ac893e7d72b98bccdf5d61f22cd4f0f2470e8","source":{"kind":"arxiv","id":"1211.1299","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1299","created_at":"2026-05-18T01:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1299v5","created_at":"2026-05-18T01:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1299","created_at":"2026-05-18T01:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"25UFFL4ZC22Y","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"25UFFL4ZC22YZZSQ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"25UFFL4Z","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:25UFFL4ZC22YZZSQSQJF4GWISP","target":"record","payload":{"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"},"canonical_sha256":"d76852af9916b58ce65094125e1ac893e7d72b98bccdf5d61f22cd4f0f2470e8","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"},"source_kind":"arxiv","source_id":"1211.1299","source_version":5,"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-18T01:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZR1KuRpOt6TXrHfgOKf094H1j4bbcLpzf96VXGaW1TX1EzoqFsNOt79B2al+m1ochRsJxp0V++MwpFS9fD4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:11:55.761375Z"},"content_sha256":"3808c744cb02a7f93dce3571a9a5d823214bba6edd892a105a88d15663da2044","schema_version":"1.0","event_id":"sha256:3808c744cb02a7f93dce3571a9a5d823214bba6edd892a105a88d15663da2044"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:25UFFL4ZC22YZZSQSQJF4GWISP","target":"graph","payload":{"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"},"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-18T01:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qUKJcuZ/FGIlVFUn2xFzr+I7Q7tERK2mTKKNWgfrAwdiwwxwUOw+Zo5xKDhH05aK7C/omtfu8Ck4OtlI4B5pAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:11:55.761732Z"},"content_sha256":"cb48cf67fd2517fd98df37818cb26fa4508fa09a214d095bf74571444d39cb60","schema_version":"1.0","event_id":"sha256:cb48cf67fd2517fd98df37818cb26fa4508fa09a214d095bf74571444d39cb60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25UFFL4ZC22YZZSQSQJF4GWISP/bundle.json","state_url":"https://pith.science/pith/25UFFL4ZC22YZZSQSQJF4GWISP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25UFFL4ZC22YZZSQSQJF4GWISP/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-04T15:11:55Z","links":{"resolver":"https://pith.science/pith/25UFFL4ZC22YZZSQSQJF4GWISP","bundle":"https://pith.science/pith/25UFFL4ZC22YZZSQSQJF4GWISP/bundle.json","state":"https://pith.science/pith/25UFFL4ZC22YZZSQSQJF4GWISP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25UFFL4ZC22YZZSQSQJF4GWISP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:25UFFL4ZC22YZZSQSQJF4GWISP","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":"e7ab243facaab208f780301b2c7e2408f6427887848201ad7b0c565e41a39291","cross_cats_sorted":["cs.DS","cs.FL","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-06T16:36:55Z","title_canon_sha256":"8a88f1ad3397e99a748c28c376cb7f32bb00c02325977766c7d14d61736e34fc"},"schema_version":"1.0","source":{"id":"1211.1299","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1299","created_at":"2026-05-18T01:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1299v5","created_at":"2026-05-18T01:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1299","created_at":"2026-05-18T01:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"25UFFL4ZC22Y","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"25UFFL4ZC22YZZSQ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"25UFFL4Z","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:cb48cf67fd2517fd98df37818cb26fa4508fa09a214d095bf74571444d39cb60","target":"graph","created_at":"2026-05-18T01:23:10Z","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 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","authors_text":"Frances A. Rosamond, Michael R. Fellows, Ren\\'e van Bevern, Rodney G. Downey, Serge Gaspers","cross_cats":["cs.DS","cs.FL","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-06T16:36:55Z","title":"Myhill-Nerode methods for hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1299","kind":"arxiv","version":5},"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:3808c744cb02a7f93dce3571a9a5d823214bba6edd892a105a88d15663da2044","target":"record","created_at":"2026-05-18T01:23:10Z","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":"e7ab243facaab208f780301b2c7e2408f6427887848201ad7b0c565e41a39291","cross_cats_sorted":["cs.DS","cs.FL","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-06T16:36:55Z","title_canon_sha256":"8a88f1ad3397e99a748c28c376cb7f32bb00c02325977766c7d14d61736e34fc"},"schema_version":"1.0","source":{"id":"1211.1299","kind":"arxiv","version":5}},"canonical_sha256":"d76852af9916b58ce65094125e1ac893e7d72b98bccdf5d61f22cd4f0f2470e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d76852af9916b58ce65094125e1ac893e7d72b98bccdf5d61f22cd4f0f2470e8","first_computed_at":"2026-05-18T01:23:10.709102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:10.709102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y/5GhMdw3oc/CGCcnPWbufSOX9DpSXwrH3CrMpXH377JYL0ybgN/GaJWymFNIiqAvvVWZf7EJOhcOZk9Ts9pDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:10.709658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1299","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3808c744cb02a7f93dce3571a9a5d823214bba6edd892a105a88d15663da2044","sha256:cb48cf67fd2517fd98df37818cb26fa4508fa09a214d095bf74571444d39cb60"],"state_sha256":"de5605133f20ff4763fa77747c003b58b39477786f7f0cd077112c36af85cfe4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rvr5PT7jLJXD8mXv+O+Othhq+SCQLmweHHHJQXM1JCKp5VbbEtyhoA+wSm6Zk1yP+yUCIdnBfRu+y4btMo8lCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:11:55.763775Z","bundle_sha256":"3a9cda486bf62e663c976106ebe4d260a6d930abc0f614359a7d18d9fcf47d1d"}}