{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:S4FL6ITRGSGPF3XBTALIQ33K6B","short_pith_number":"pith:S4FL6ITR","canonical_record":{"source":{"id":"2408.08293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-15T17:49:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f33ac03785e777fe24c4576ef0b228adaf30e91f8eb34f446f80f700352c18a0","abstract_canon_sha256":"5d19b33a309da1b92a69a213ecef08aec66d20551d088ca01477bb98c80ff427"},"schema_version":"1.0"},"canonical_sha256":"970abf2271348cf2eee19816886f6af05c4491815d410c27f1639ff5cc78d4eb","source":{"kind":"arxiv","id":"2408.08293","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.08293","created_at":"2026-07-05T11:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"2408.08293v2","created_at":"2026-07-05T11:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08293","created_at":"2026-07-05T11:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"S4FL6ITRGSGP","created_at":"2026-07-05T11:00:38Z"},{"alias_kind":"pith_short_16","alias_value":"S4FL6ITRGSGPF3XB","created_at":"2026-07-05T11:00:38Z"},{"alias_kind":"pith_short_8","alias_value":"S4FL6ITR","created_at":"2026-07-05T11:00:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:S4FL6ITRGSGPF3XBTALIQ33K6B","target":"record","payload":{"canonical_record":{"source":{"id":"2408.08293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-15T17:49:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f33ac03785e777fe24c4576ef0b228adaf30e91f8eb34f446f80f700352c18a0","abstract_canon_sha256":"5d19b33a309da1b92a69a213ecef08aec66d20551d088ca01477bb98c80ff427"},"schema_version":"1.0"},"canonical_sha256":"970abf2271348cf2eee19816886f6af05c4491815d410c27f1639ff5cc78d4eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:38.461525Z","signature_b64":"vJDmk10Y93JJoCVknphqFW9rZ5NEHHLCrWoM1SmdO1filaMuBYwCOeZ1xJwFru5X1JUAKyF3oK8xLI+74y9LBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"970abf2271348cf2eee19816886f6af05c4491815d410c27f1639ff5cc78d4eb","last_reissued_at":"2026-07-05T11:00:38.461015Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:38.461015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.08293","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F+sFHu1Pfqzol1BZ4gvDvVWQ/eZm5kJcW2zkPEoH73zjcysprwzbE3lOl5eBGx4xb1E9CeHqAmp/g4/FA8F7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:32:46.136593Z"},"content_sha256":"8cf635733f790695c85be3d3260a3a55b1897ca437cf6a5999398cea60eaf4c3","schema_version":"1.0","event_id":"sha256:8cf635733f790695c85be3d3260a3a55b1897ca437cf6a5999398cea60eaf4c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:S4FL6ITRGSGPF3XBTALIQ33K6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient counting of permutation patterns via double posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Emanuele Verri, Joscha Diehl","submitted_at":"2024-08-15T17:49:22Z","abstract_excerpt":"Corner trees, introduced in \"Even-Zohar and Leng, 2021, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms\", allow for the efficient counting of certain permutation patterns. Here we identify corner trees as a subset of finite (strict) double posets, which we term twin-tree double posets. They are contained in both twin double posets and tree double posets, giving candidate sets for generalizations of corner tree countings. We provide the generalization of an algorithm proposed by Even-Zohar/Leng to a class of tree double posets, thereby enlarging the space of permutations that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.08293","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.08293/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ar5syuUffRE4+8vcBBbvDo0XwhhCWCAuIKs4JDKZQDtWNGKKceVI7KtbaFwSDrrJTdJLnSgbOVcoypKHBnGRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:32:46.137118Z"},"content_sha256":"5997e493e1d385ba341ee79615427708048dffd44a08922acf97075d5d2dbb24","schema_version":"1.0","event_id":"sha256:5997e493e1d385ba341ee79615427708048dffd44a08922acf97075d5d2dbb24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4FL6ITRGSGPF3XBTALIQ33K6B/bundle.json","state_url":"https://pith.science/pith/S4FL6ITRGSGPF3XBTALIQ33K6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4FL6ITRGSGPF3XBTALIQ33K6B/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T09:32:46Z","links":{"resolver":"https://pith.science/pith/S4FL6ITRGSGPF3XBTALIQ33K6B","bundle":"https://pith.science/pith/S4FL6ITRGSGPF3XBTALIQ33K6B/bundle.json","state":"https://pith.science/pith/S4FL6ITRGSGPF3XBTALIQ33K6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4FL6ITRGSGPF3XBTALIQ33K6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:S4FL6ITRGSGPF3XBTALIQ33K6B","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5d19b33a309da1b92a69a213ecef08aec66d20551d088ca01477bb98c80ff427","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-15T17:49:22Z","title_canon_sha256":"f33ac03785e777fe24c4576ef0b228adaf30e91f8eb34f446f80f700352c18a0"},"schema_version":"1.0","source":{"id":"2408.08293","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.08293","created_at":"2026-07-05T11:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"2408.08293v2","created_at":"2026-07-05T11:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08293","created_at":"2026-07-05T11:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"S4FL6ITRGSGP","created_at":"2026-07-05T11:00:38Z"},{"alias_kind":"pith_short_16","alias_value":"S4FL6ITRGSGPF3XB","created_at":"2026-07-05T11:00:38Z"},{"alias_kind":"pith_short_8","alias_value":"S4FL6ITR","created_at":"2026-07-05T11:00:38Z"}],"graph_snapshots":[{"event_id":"sha256:5997e493e1d385ba341ee79615427708048dffd44a08922acf97075d5d2dbb24","target":"graph","created_at":"2026-07-05T11:00:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.08293/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Corner trees, introduced in \"Even-Zohar and Leng, 2021, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms\", allow for the efficient counting of certain permutation patterns. Here we identify corner trees as a subset of finite (strict) double posets, which we term twin-tree double posets. They are contained in both twin double posets and tree double posets, giving candidate sets for generalizations of corner tree countings. We provide the generalization of an algorithm proposed by Even-Zohar/Leng to a class of tree double posets, thereby enlarging the space of permutations that ","authors_text":"Emanuele Verri, Joscha Diehl","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-15T17:49:22Z","title":"Efficient counting of permutation patterns via double posets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.08293","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8cf635733f790695c85be3d3260a3a55b1897ca437cf6a5999398cea60eaf4c3","target":"record","created_at":"2026-07-05T11:00:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5d19b33a309da1b92a69a213ecef08aec66d20551d088ca01477bb98c80ff427","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-15T17:49:22Z","title_canon_sha256":"f33ac03785e777fe24c4576ef0b228adaf30e91f8eb34f446f80f700352c18a0"},"schema_version":"1.0","source":{"id":"2408.08293","kind":"arxiv","version":2}},"canonical_sha256":"970abf2271348cf2eee19816886f6af05c4491815d410c27f1639ff5cc78d4eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"970abf2271348cf2eee19816886f6af05c4491815d410c27f1639ff5cc78d4eb","first_computed_at":"2026-07-05T11:00:38.461015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:00:38.461015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vJDmk10Y93JJoCVknphqFW9rZ5NEHHLCrWoM1SmdO1filaMuBYwCOeZ1xJwFru5X1JUAKyF3oK8xLI+74y9LBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:00:38.461525Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.08293","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cf635733f790695c85be3d3260a3a55b1897ca437cf6a5999398cea60eaf4c3","sha256:5997e493e1d385ba341ee79615427708048dffd44a08922acf97075d5d2dbb24"],"state_sha256":"247b7965311ac134e85c8f494aabfeb54577e0d2fc8a439825720564f4d1425a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tIO/u/F5rsgnlBp855EuCOTlYxLZzHiSwp9BS4L6kLakfIxO07R2hmkO689ezH3o61QrXcGYZaPGwirUT/LKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T09:32:46.141551Z","bundle_sha256":"dfbf1487bb0095b98e1477c1a38e570ff1d45939df0eeb40b6d39ba768302a5d"}}