{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MRYA53UUTFZSF6QIJTR4CSY42Z","short_pith_number":"pith:MRYA53UU","schema_version":"1.0","canonical_sha256":"64700eee94997322fa084ce3c14b1cd663bae795a9e0c852fecb3457ab050cad","source":{"kind":"arxiv","id":"1605.05490","version":2},"attestation_state":"computed","paper":{"title":"On pattern avoiding indecomposable permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alice L.L. Gao, Philip B. Zhang, Sergey Kitaev","submitted_at":"2016-05-18T09:23:50Z","abstract_excerpt":"Comtet introduced the notion of indecomposable permutations in 1972. A permutation is indecomposable if and only if it has no proper prefix which is itself a permutation. Indecomposable permutations were studied in the literature in various contexts. In particular, this notion has been proven to be useful in obtaining non-trivial enumeration and equidistribution results on permutations.\n  In this paper, we give a complete classification of indecomposable permutations avoiding a classical pattern of length 3 or 4, and of indecomposable permutations avoiding a non-consecutive vincular pattern of"},"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":"1605.05490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-18T09:23:50Z","cross_cats_sorted":[],"title_canon_sha256":"92602aebe4a00931bf37e8c73c251bf8dcf24941c47205a0acabc4d98c450d4b","abstract_canon_sha256":"0c63e2a72aa230a1e465d8917853289120b40beabcf225268eb5f52bc07701be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:12.064595Z","signature_b64":"vgvaRfwQl0Cg4pRApDsJH0nCGTr2HjiKbVMdhagQpPlhJgsRenmxgph5Ku8WSrFOHRcPX1oBbMUZZ1TOAYqMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64700eee94997322fa084ce3c14b1cd663bae795a9e0c852fecb3457ab050cad","last_reissued_at":"2026-05-18T01:14:12.063901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:12.063901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On pattern avoiding indecomposable permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alice L.L. Gao, Philip B. Zhang, Sergey Kitaev","submitted_at":"2016-05-18T09:23:50Z","abstract_excerpt":"Comtet introduced the notion of indecomposable permutations in 1972. A permutation is indecomposable if and only if it has no proper prefix which is itself a permutation. Indecomposable permutations were studied in the literature in various contexts. In particular, this notion has been proven to be useful in obtaining non-trivial enumeration and equidistribution results on permutations.\n  In this paper, we give a complete classification of indecomposable permutations avoiding a classical pattern of length 3 or 4, and of indecomposable permutations avoiding a non-consecutive vincular pattern of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05490","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":"1605.05490","created_at":"2026-05-18T01:14:12.063994+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05490v2","created_at":"2026-05-18T01:14:12.063994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05490","created_at":"2026-05-18T01:14:12.063994+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRYA53UUTFZS","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRYA53UUTFZSF6QI","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRYA53UU","created_at":"2026-05-18T12:30:32.724797+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/MRYA53UUTFZSF6QIJTR4CSY42Z","json":"https://pith.science/pith/MRYA53UUTFZSF6QIJTR4CSY42Z.json","graph_json":"https://pith.science/api/pith-number/MRYA53UUTFZSF6QIJTR4CSY42Z/graph.json","events_json":"https://pith.science/api/pith-number/MRYA53UUTFZSF6QIJTR4CSY42Z/events.json","paper":"https://pith.science/paper/MRYA53UU"},"agent_actions":{"view_html":"https://pith.science/pith/MRYA53UUTFZSF6QIJTR4CSY42Z","download_json":"https://pith.science/pith/MRYA53UUTFZSF6QIJTR4CSY42Z.json","view_paper":"https://pith.science/paper/MRYA53UU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05490&json=true","fetch_graph":"https://pith.science/api/pith-number/MRYA53UUTFZSF6QIJTR4CSY42Z/graph.json","fetch_events":"https://pith.science/api/pith-number/MRYA53UUTFZSF6QIJTR4CSY42Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRYA53UUTFZSF6QIJTR4CSY42Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRYA53UUTFZSF6QIJTR4CSY42Z/action/storage_attestation","attest_author":"https://pith.science/pith/MRYA53UUTFZSF6QIJTR4CSY42Z/action/author_attestation","sign_citation":"https://pith.science/pith/MRYA53UUTFZSF6QIJTR4CSY42Z/action/citation_signature","submit_replication":"https://pith.science/pith/MRYA53UUTFZSF6QIJTR4CSY42Z/action/replication_record"}},"created_at":"2026-05-18T01:14:12.063994+00:00","updated_at":"2026-05-18T01:14:12.063994+00:00"}