{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:YDZSIMIZQ6N6HIBH3HB7TKOCII","short_pith_number":"pith:YDZSIMIZ","schema_version":"1.0","canonical_sha256":"c0f3243119879be3a027d9c3f9a9c24231e6beeee6425e5f3e7fe4a82581818f","source":{"kind":"arxiv","id":"math/0604322","version":1},"attestation_state":"computed","paper":{"title":"Pattern Avoidance and the Bruhat Order","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bridget Eileen Tenner","submitted_at":"2006-04-13T17:14:36Z","abstract_excerpt":"The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. A method for determining non-isomorphic principal order ideals is described and applied for small lengths. The permutations with boolean principal order ideals are characterized. These form an order ideal which is a simplicial poset, and its rank generating function is computed. Moreover, the permutations whose principal order ideals have a form related to boolean posets are also completely described. It is determined when the set of permutations avoiding a particular set of patter"},"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":"math/0604322","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2006-04-13T17:14:36Z","cross_cats_sorted":[],"title_canon_sha256":"c272d80d7bb5942bf10458c7325d3e4ca8b9835affe123e3a0ac6d4348952451","abstract_canon_sha256":"bfc6853a473c92c5377620d193f97c8b54db49d0771403270c35c1a792242aa5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:54:36.306165Z","signature_b64":"1sy8UT+yqPu3XLBuey3f1BOOYhYLBzt2bk+y+aj5Jks4ghCjF9J+e6KoBq/7NVOSSpHMFCVta8kKqd7kSIR7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0f3243119879be3a027d9c3f9a9c24231e6beeee6425e5f3e7fe4a82581818f","last_reissued_at":"2026-07-04T14:54:36.305681Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:54:36.305681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pattern Avoidance and the Bruhat Order","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bridget Eileen Tenner","submitted_at":"2006-04-13T17:14:36Z","abstract_excerpt":"The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. A method for determining non-isomorphic principal order ideals is described and applied for small lengths. The permutations with boolean principal order ideals are characterized. These form an order ideal which is a simplicial poset, and its rank generating function is computed. Moreover, the permutations whose principal order ideals have a form related to boolean posets are also completely described. It is determined when the set of permutations avoiding a particular set of patter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0604322","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0604322/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"math/0604322","created_at":"2026-07-04T14:54:36.305737+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0604322v1","created_at":"2026-07-04T14:54:36.305737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0604322","created_at":"2026-07-04T14:54:36.305737+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDZSIMIZQ6N6","created_at":"2026-07-04T14:54:36.305737+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDZSIMIZQ6N6HIBH","created_at":"2026-07-04T14:54:36.305737+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDZSIMIZ","created_at":"2026-07-04T14:54:36.305737+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.01283","citing_title":"Big data approach to Kazhdan-Lusztig polynomials","ref_index":59,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YDZSIMIZQ6N6HIBH3HB7TKOCII","json":"https://pith.science/pith/YDZSIMIZQ6N6HIBH3HB7TKOCII.json","graph_json":"https://pith.science/api/pith-number/YDZSIMIZQ6N6HIBH3HB7TKOCII/graph.json","events_json":"https://pith.science/api/pith-number/YDZSIMIZQ6N6HIBH3HB7TKOCII/events.json","paper":"https://pith.science/paper/YDZSIMIZ"},"agent_actions":{"view_html":"https://pith.science/pith/YDZSIMIZQ6N6HIBH3HB7TKOCII","download_json":"https://pith.science/pith/YDZSIMIZQ6N6HIBH3HB7TKOCII.json","view_paper":"https://pith.science/paper/YDZSIMIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0604322&json=true","fetch_graph":"https://pith.science/api/pith-number/YDZSIMIZQ6N6HIBH3HB7TKOCII/graph.json","fetch_events":"https://pith.science/api/pith-number/YDZSIMIZQ6N6HIBH3HB7TKOCII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDZSIMIZQ6N6HIBH3HB7TKOCII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDZSIMIZQ6N6HIBH3HB7TKOCII/action/storage_attestation","attest_author":"https://pith.science/pith/YDZSIMIZQ6N6HIBH3HB7TKOCII/action/author_attestation","sign_citation":"https://pith.science/pith/YDZSIMIZQ6N6HIBH3HB7TKOCII/action/citation_signature","submit_replication":"https://pith.science/pith/YDZSIMIZQ6N6HIBH3HB7TKOCII/action/replication_record"}},"created_at":"2026-07-04T14:54:36.305737+00:00","updated_at":"2026-07-04T14:54:36.305737+00:00"}