{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IYLQGAV5PWKWNINARXEX7HOANK","short_pith_number":"pith:IYLQGAV5","schema_version":"1.0","canonical_sha256":"46170302bd7d9566a1a08dc97f9dc06abbb05937d3d583f7d7d428ee79b3435b","source":{"kind":"arxiv","id":"2407.04971","version":1},"attestation_state":"computed","paper":{"title":"Counting Permutation Patterns with Multidimensional Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Gal Beniamini, Nir Lavee","submitted_at":"2024-07-06T06:23:11Z","abstract_excerpt":"We consider the well-studied pattern counting problem: given a permutation $\\pi \\in \\mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\\tau \\in \\mathbb{S}_k$ in $\\pi$.\n  Our first result is an $\\widetilde{\\mathcal{O}}(n^2)$-time algorithm for $k=6$ and $k=7$. The proof relies heavily on a new family of graphs that we introduce, called pattern-trees. Every such tree corresponds to an integer linear combination of permutations in $\\mathbb{S}_k$, and is associated with linear extensions of partially ordered sets. We design an evaluation algori"},"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":"2407.04971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-06T06:23:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"272a0c4869fa8542f1bca0d698021c453071b20edfb18ac49c8114661aeba8e6","abstract_canon_sha256":"f542f084bf8b6d81cc48d3e960a68c0aa028a82d6c84472170ae6bc8f1c98cff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:44.402933Z","signature_b64":"5xAM5SjHTK43/sYooUehiZAbHMnDna6U9oQQuFZ+x9eAl0Pni8sMf151cFazzNwJ4SuJFybeywtiaL5TWsxMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46170302bd7d9566a1a08dc97f9dc06abbb05937d3d583f7d7d428ee79b3435b","last_reissued_at":"2026-07-05T08:40:44.402429Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:44.402429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Permutation Patterns with Multidimensional Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Gal Beniamini, Nir Lavee","submitted_at":"2024-07-06T06:23:11Z","abstract_excerpt":"We consider the well-studied pattern counting problem: given a permutation $\\pi \\in \\mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\\tau \\in \\mathbb{S}_k$ in $\\pi$.\n  Our first result is an $\\widetilde{\\mathcal{O}}(n^2)$-time algorithm for $k=6$ and $k=7$. The proof relies heavily on a new family of graphs that we introduce, called pattern-trees. Every such tree corresponds to an integer linear combination of permutations in $\\mathbb{S}_k$, and is associated with linear extensions of partially ordered sets. We design an evaluation algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.04971","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/2407.04971/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":"2407.04971","created_at":"2026-07-05T08:40:44.402488+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.04971v1","created_at":"2026-07-05T08:40:44.402488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.04971","created_at":"2026-07-05T08:40:44.402488+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYLQGAV5PWKW","created_at":"2026-07-05T08:40:44.402488+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYLQGAV5PWKWNINA","created_at":"2026-07-05T08:40:44.402488+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYLQGAV5","created_at":"2026-07-05T08:40:44.402488+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.19955","citing_title":"Global Permutation Entropy","ref_index":197,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IYLQGAV5PWKWNINARXEX7HOANK","json":"https://pith.science/pith/IYLQGAV5PWKWNINARXEX7HOANK.json","graph_json":"https://pith.science/api/pith-number/IYLQGAV5PWKWNINARXEX7HOANK/graph.json","events_json":"https://pith.science/api/pith-number/IYLQGAV5PWKWNINARXEX7HOANK/events.json","paper":"https://pith.science/paper/IYLQGAV5"},"agent_actions":{"view_html":"https://pith.science/pith/IYLQGAV5PWKWNINARXEX7HOANK","download_json":"https://pith.science/pith/IYLQGAV5PWKWNINARXEX7HOANK.json","view_paper":"https://pith.science/paper/IYLQGAV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.04971&json=true","fetch_graph":"https://pith.science/api/pith-number/IYLQGAV5PWKWNINARXEX7HOANK/graph.json","fetch_events":"https://pith.science/api/pith-number/IYLQGAV5PWKWNINARXEX7HOANK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYLQGAV5PWKWNINARXEX7HOANK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYLQGAV5PWKWNINARXEX7HOANK/action/storage_attestation","attest_author":"https://pith.science/pith/IYLQGAV5PWKWNINARXEX7HOANK/action/author_attestation","sign_citation":"https://pith.science/pith/IYLQGAV5PWKWNINARXEX7HOANK/action/citation_signature","submit_replication":"https://pith.science/pith/IYLQGAV5PWKWNINARXEX7HOANK/action/replication_record"}},"created_at":"2026-07-05T08:40:44.402488+00:00","updated_at":"2026-07-05T08:40:44.402488+00:00"}