{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:7XHFH7P5ENOBL4BLLXKL76RYBX","short_pith_number":"pith:7XHFH7P5","schema_version":"1.0","canonical_sha256":"fdce53fdfd235c15f02b5dd4bffa380dd3614fd24c9f4edc190aaa0ce4ff982a","source":{"kind":"arxiv","id":"1002.1933","version":2},"attestation_state":"computed","paper":{"title":"Enumerating pattern avoidance for affine permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Crites","submitted_at":"2010-02-09T18:25:02Z","abstract_excerpt":"In this paper we study pattern avoidance for affine permutations. In particular, we show that for a given pattern p, there are only finitely many affine permutations in $\\widetilde{S}_n$ that avoid p if and only if p avoids the pattern 321. We then count the number of affine permutations that avoid a given pattern p for each p in S_3, as well as give some conjectures for the patterns in S_4."},"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":"1002.1933","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-09T18:25:02Z","cross_cats_sorted":[],"title_canon_sha256":"97a0368eafe115fe2d42208d16d927038b3541dde323b077cde70eb24fd6aca9","abstract_canon_sha256":"83b1871e667412fa12dbec4d4bd529917edbf164d505b6cd76471bc1819d513f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:08.689011Z","signature_b64":"3DgVsHxVhYuMAEvbNYcrGrmdjzThhpsQCv/oEQmsMuSrNIOKztjMME4bHUm/BRpJyXsTNY9LeMjBgQAHPe4JAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdce53fdfd235c15f02b5dd4bffa380dd3614fd24c9f4edc190aaa0ce4ff982a","last_reissued_at":"2026-05-18T04:36:08.688603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:08.688603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumerating pattern avoidance for affine permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Crites","submitted_at":"2010-02-09T18:25:02Z","abstract_excerpt":"In this paper we study pattern avoidance for affine permutations. In particular, we show that for a given pattern p, there are only finitely many affine permutations in $\\widetilde{S}_n$ that avoid p if and only if p avoids the pattern 321. We then count the number of affine permutations that avoid a given pattern p for each p in S_3, as well as give some conjectures for the patterns in S_4."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.1933","kind":"arxiv","version":2},"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":"1002.1933","created_at":"2026-05-18T04:36:08.688667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.1933v2","created_at":"2026-05-18T04:36:08.688667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.1933","created_at":"2026-05-18T04:36:08.688667+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XHFH7P5ENOB","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XHFH7P5ENOBL4BL","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XHFH7P5","created_at":"2026-05-18T12:26:05.355336+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/7XHFH7P5ENOBL4BLLXKL76RYBX","json":"https://pith.science/pith/7XHFH7P5ENOBL4BLLXKL76RYBX.json","graph_json":"https://pith.science/api/pith-number/7XHFH7P5ENOBL4BLLXKL76RYBX/graph.json","events_json":"https://pith.science/api/pith-number/7XHFH7P5ENOBL4BLLXKL76RYBX/events.json","paper":"https://pith.science/paper/7XHFH7P5"},"agent_actions":{"view_html":"https://pith.science/pith/7XHFH7P5ENOBL4BLLXKL76RYBX","download_json":"https://pith.science/pith/7XHFH7P5ENOBL4BLLXKL76RYBX.json","view_paper":"https://pith.science/paper/7XHFH7P5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.1933&json=true","fetch_graph":"https://pith.science/api/pith-number/7XHFH7P5ENOBL4BLLXKL76RYBX/graph.json","fetch_events":"https://pith.science/api/pith-number/7XHFH7P5ENOBL4BLLXKL76RYBX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XHFH7P5ENOBL4BLLXKL76RYBX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XHFH7P5ENOBL4BLLXKL76RYBX/action/storage_attestation","attest_author":"https://pith.science/pith/7XHFH7P5ENOBL4BLLXKL76RYBX/action/author_attestation","sign_citation":"https://pith.science/pith/7XHFH7P5ENOBL4BLLXKL76RYBX/action/citation_signature","submit_replication":"https://pith.science/pith/7XHFH7P5ENOBL4BLLXKL76RYBX/action/replication_record"}},"created_at":"2026-05-18T04:36:08.688667+00:00","updated_at":"2026-05-18T04:36:08.688667+00:00"}