{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:L6N2VLZPQODV6ZU2MZMAABZRDK","short_pith_number":"pith:L6N2VLZP","schema_version":"1.0","canonical_sha256":"5f9baaaf2f83875f669a66580007311a8e2319068003263d01b72fe6a3276b47","source":{"kind":"arxiv","id":"1309.7117","version":1},"attestation_state":"computed","paper":{"title":"Using functional equations to enumerate 1324-avoiding permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brian Nakamura, Fredrik Johansson","submitted_at":"2013-09-27T05:28:43Z","abstract_excerpt":"We consider the problem of enumerating permutations with exactly r occurrences of the pattern 1324 and derive functional equations for this general case as well as for the pattern avoidance (r=0) case. The functional equations lead to a new algorithm for enumerating length n permutations that avoid 1324. This approach is used to enumerate the 1324-avoiders up to n=31. We also extend those functional equations to account for the number of inversions and derive analogous algorithms."},"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.7117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-27T05:28:43Z","cross_cats_sorted":[],"title_canon_sha256":"e0e91481eba1531a90018590316b4297b3084e9623745e701080dc4360e01824","abstract_canon_sha256":"eb2f2526b421ee4ea2697475da59f5ad0f2ed281505473e817a58edc3788b5c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:00.198547Z","signature_b64":"BQOk1NCYWHPzn5Gx6nIhqwi68JQ86TgtwFwiScxXWhET6kLdoLXKie3/cV1u7kDPMzK0o2aWIhLBlOWu4lZqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f9baaaf2f83875f669a66580007311a8e2319068003263d01b72fe6a3276b47","last_reissued_at":"2026-05-18T03:12:00.197892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:00.197892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using functional equations to enumerate 1324-avoiding permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brian Nakamura, Fredrik Johansson","submitted_at":"2013-09-27T05:28:43Z","abstract_excerpt":"We consider the problem of enumerating permutations with exactly r occurrences of the pattern 1324 and derive functional equations for this general case as well as for the pattern avoidance (r=0) case. The functional equations lead to a new algorithm for enumerating length n permutations that avoid 1324. This approach is used to enumerate the 1324-avoiders up to n=31. We also extend those functional equations to account for the number of inversions and derive analogous algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7117","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.7117","created_at":"2026-05-18T03:12:00.198017+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7117v1","created_at":"2026-05-18T03:12:00.198017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7117","created_at":"2026-05-18T03:12:00.198017+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6N2VLZPQODV","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6N2VLZPQODV6ZU2","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6N2VLZP","created_at":"2026-05-18T12:27:51.066281+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/L6N2VLZPQODV6ZU2MZMAABZRDK","json":"https://pith.science/pith/L6N2VLZPQODV6ZU2MZMAABZRDK.json","graph_json":"https://pith.science/api/pith-number/L6N2VLZPQODV6ZU2MZMAABZRDK/graph.json","events_json":"https://pith.science/api/pith-number/L6N2VLZPQODV6ZU2MZMAABZRDK/events.json","paper":"https://pith.science/paper/L6N2VLZP"},"agent_actions":{"view_html":"https://pith.science/pith/L6N2VLZPQODV6ZU2MZMAABZRDK","download_json":"https://pith.science/pith/L6N2VLZPQODV6ZU2MZMAABZRDK.json","view_paper":"https://pith.science/paper/L6N2VLZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7117&json=true","fetch_graph":"https://pith.science/api/pith-number/L6N2VLZPQODV6ZU2MZMAABZRDK/graph.json","fetch_events":"https://pith.science/api/pith-number/L6N2VLZPQODV6ZU2MZMAABZRDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6N2VLZPQODV6ZU2MZMAABZRDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6N2VLZPQODV6ZU2MZMAABZRDK/action/storage_attestation","attest_author":"https://pith.science/pith/L6N2VLZPQODV6ZU2MZMAABZRDK/action/author_attestation","sign_citation":"https://pith.science/pith/L6N2VLZPQODV6ZU2MZMAABZRDK/action/citation_signature","submit_replication":"https://pith.science/pith/L6N2VLZPQODV6ZU2MZMAABZRDK/action/replication_record"}},"created_at":"2026-05-18T03:12:00.198017+00:00","updated_at":"2026-05-18T03:12:00.198017+00:00"}