{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SOZA44L6DRQCO5QATJDPLIR3DI","short_pith_number":"pith:SOZA44L6","schema_version":"1.0","canonical_sha256":"93b20e717e1c602776009a46f5a23b1a248d4fd85a5beba4a46dc7dcf4f12d75","source":{"kind":"arxiv","id":"1505.06508","version":1},"attestation_state":"computed","paper":{"title":"Pattern avoidance is not P-recursive","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL"],"primary_cat":"math.CO","authors_text":"Igor Pak, Scott Garrabrant","submitted_at":"2015-05-25T01:11:09Z","abstract_excerpt":"Let $F \\subset S_k$ be a finite set of permutations and let $C_n(F)$ denote the number of permutations $\\sigma$ in $S_n$ avoiding the set of patterns $F$. The Noonan-Zeilberger conjecture states that the sequence ${C_n(F)}$ is P-recursive. We use Computability Theory to disprove this conjecture."},"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":"1505.06508","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-25T01:11:09Z","cross_cats_sorted":["cs.CC","cs.FL"],"title_canon_sha256":"1620bcab4d273128e27c7e969498587c549794faae6899f94169ce6afd98ac59","abstract_canon_sha256":"53a2598ba1d93bcef7a0c62fd34ac4d3e9e648c7ff26ef47ab71998277350274"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:44.804433Z","signature_b64":"G9wMvGMdo8CJZbSJwUYWkYZnaOjVy8XV9GdQfkTqimr7B3GeVfRH5A3NJwWxdR6EJypr9dv9NxY1OKnCvXZkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93b20e717e1c602776009a46f5a23b1a248d4fd85a5beba4a46dc7dcf4f12d75","last_reissued_at":"2026-05-18T02:03:44.803748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:44.803748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pattern avoidance is not P-recursive","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL"],"primary_cat":"math.CO","authors_text":"Igor Pak, Scott Garrabrant","submitted_at":"2015-05-25T01:11:09Z","abstract_excerpt":"Let $F \\subset S_k$ be a finite set of permutations and let $C_n(F)$ denote the number of permutations $\\sigma$ in $S_n$ avoiding the set of patterns $F$. The Noonan-Zeilberger conjecture states that the sequence ${C_n(F)}$ is P-recursive. We use Computability Theory to disprove this conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06508","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":"1505.06508","created_at":"2026-05-18T02:03:44.803859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06508v1","created_at":"2026-05-18T02:03:44.803859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06508","created_at":"2026-05-18T02:03:44.803859+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOZA44L6DRQC","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOZA44L6DRQCO5QA","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOZA44L6","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2211.12397","citing_title":"Uncountably many enumerations of well-quasi-ordered permutation classes","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SOZA44L6DRQCO5QATJDPLIR3DI","json":"https://pith.science/pith/SOZA44L6DRQCO5QATJDPLIR3DI.json","graph_json":"https://pith.science/api/pith-number/SOZA44L6DRQCO5QATJDPLIR3DI/graph.json","events_json":"https://pith.science/api/pith-number/SOZA44L6DRQCO5QATJDPLIR3DI/events.json","paper":"https://pith.science/paper/SOZA44L6"},"agent_actions":{"view_html":"https://pith.science/pith/SOZA44L6DRQCO5QATJDPLIR3DI","download_json":"https://pith.science/pith/SOZA44L6DRQCO5QATJDPLIR3DI.json","view_paper":"https://pith.science/paper/SOZA44L6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06508&json=true","fetch_graph":"https://pith.science/api/pith-number/SOZA44L6DRQCO5QATJDPLIR3DI/graph.json","fetch_events":"https://pith.science/api/pith-number/SOZA44L6DRQCO5QATJDPLIR3DI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOZA44L6DRQCO5QATJDPLIR3DI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOZA44L6DRQCO5QATJDPLIR3DI/action/storage_attestation","attest_author":"https://pith.science/pith/SOZA44L6DRQCO5QATJDPLIR3DI/action/author_attestation","sign_citation":"https://pith.science/pith/SOZA44L6DRQCO5QATJDPLIR3DI/action/citation_signature","submit_replication":"https://pith.science/pith/SOZA44L6DRQCO5QATJDPLIR3DI/action/replication_record"}},"created_at":"2026-05-18T02:03:44.803859+00:00","updated_at":"2026-05-18T02:03:44.803859+00:00"}