{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:J4XMSY75ZHZSYMMAOJZIZF7AKT","short_pith_number":"pith:J4XMSY75","canonical_record":{"source":{"id":"1401.0337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-01T21:32:42Z","cross_cats_sorted":[],"title_canon_sha256":"083c13d5c2faa9345c2236228218292e827071b147856cb102c3c717f808f3df","abstract_canon_sha256":"afcc5001960c5f19362a51dbf52c958fd1e383f43e21041a030e000df3d69f0b"},"schema_version":"1.0"},"canonical_sha256":"4f2ec963fdc9f32c318072728c97e054ec31c709bed7254d4fa60f1bff2205a6","source":{"kind":"arxiv","id":"1401.0337","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0337","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0337v1","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0337","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"pith_short_12","alias_value":"J4XMSY75ZHZS","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J4XMSY75ZHZSYMMA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J4XMSY75","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:J4XMSY75ZHZSYMMAOJZIZF7AKT","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-01T21:32:42Z","cross_cats_sorted":[],"title_canon_sha256":"083c13d5c2faa9345c2236228218292e827071b147856cb102c3c717f808f3df","abstract_canon_sha256":"afcc5001960c5f19362a51dbf52c958fd1e383f43e21041a030e000df3d69f0b"},"schema_version":"1.0"},"canonical_sha256":"4f2ec963fdc9f32c318072728c97e054ec31c709bed7254d4fa60f1bff2205a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:23.473331Z","signature_b64":"bCsd17hOtUHJUEn78E7bjrS1DA9x2BXTv35veSFLdfv1nx/8sTEqk+xTd7I1ppuGSfKZEAEGSxhF2Q5ciL5XDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f2ec963fdc9f32c318072728c97e054ec31c709bed7254d4fa60f1bff2205a6","last_reissued_at":"2026-05-18T03:03:23.472783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:23.472783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0337","source_version":1,"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-05-18T03:03:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1j8SU0rIiB3xMfkZi230aW0PkqvhZjKBSvUriak2k5PxWSwvQv+spnQ5dqIsiQjHErUtN8ELl1S7wjwPTQJFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:56:00.325251Z"},"content_sha256":"7b2353ba3e13209e160a1ac28ac8690787854bd9ff042560c2cf481d8a04c057","schema_version":"1.0","event_id":"sha256:7b2353ba3e13209e160a1ac28ac8690787854bd9ff042560c2cf481d8a04c057"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:J4XMSY75ZHZSYMMAOJZIZF7AKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Refining enumeration schemes to count according to permutation statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew M. Baxter","submitted_at":"2014-01-01T21:32:42Z","abstract_excerpt":"We consider the question of computing the distribution of a permutation statistics over restricted permutations via enumeration schemes. The restricted permutations are those avoiding sets of vincular patterns (which include both classical and consecutive patterns), and the statistics are described in the number of copies of certain vincular patterns such as the descent statistic and major index. An enumeration scheme is a polynomial-time algorithm (specifically, a system of recurrence relations) to compute the number of permutations avoiding a given set of vincular patterns. Enumeration schem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0337","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":""},"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-05-18T03:03:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xaOvuTCl2ezfLgSG4f9dmg/KgXo92PESTTOqr9eS+RfhnmmEiAia0ph7BaTG0iHki1etvW2sED5/Wnf0PB/cDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:56:00.325631Z"},"content_sha256":"a8d2f9a0a584445c1b70066911259c5b866d31f6cf3b8c48c648cc7d7cdedc5e","schema_version":"1.0","event_id":"sha256:a8d2f9a0a584445c1b70066911259c5b866d31f6cf3b8c48c648cc7d7cdedc5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J4XMSY75ZHZSYMMAOJZIZF7AKT/bundle.json","state_url":"https://pith.science/pith/J4XMSY75ZHZSYMMAOJZIZF7AKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J4XMSY75ZHZSYMMAOJZIZF7AKT/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-06-11T12:56:00Z","links":{"resolver":"https://pith.science/pith/J4XMSY75ZHZSYMMAOJZIZF7AKT","bundle":"https://pith.science/pith/J4XMSY75ZHZSYMMAOJZIZF7AKT/bundle.json","state":"https://pith.science/pith/J4XMSY75ZHZSYMMAOJZIZF7AKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J4XMSY75ZHZSYMMAOJZIZF7AKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:J4XMSY75ZHZSYMMAOJZIZF7AKT","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":"afcc5001960c5f19362a51dbf52c958fd1e383f43e21041a030e000df3d69f0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-01T21:32:42Z","title_canon_sha256":"083c13d5c2faa9345c2236228218292e827071b147856cb102c3c717f808f3df"},"schema_version":"1.0","source":{"id":"1401.0337","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0337","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0337v1","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0337","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"pith_short_12","alias_value":"J4XMSY75ZHZS","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J4XMSY75ZHZSYMMA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J4XMSY75","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:a8d2f9a0a584445c1b70066911259c5b866d31f6cf3b8c48c648cc7d7cdedc5e","target":"graph","created_at":"2026-05-18T03:03:23Z","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"},"paper":{"abstract_excerpt":"We consider the question of computing the distribution of a permutation statistics over restricted permutations via enumeration schemes. The restricted permutations are those avoiding sets of vincular patterns (which include both classical and consecutive patterns), and the statistics are described in the number of copies of certain vincular patterns such as the descent statistic and major index. An enumeration scheme is a polynomial-time algorithm (specifically, a system of recurrence relations) to compute the number of permutations avoiding a given set of vincular patterns. Enumeration schem","authors_text":"Andrew M. Baxter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-01T21:32:42Z","title":"Refining enumeration schemes to count according to permutation statistics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0337","kind":"arxiv","version":1},"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:7b2353ba3e13209e160a1ac28ac8690787854bd9ff042560c2cf481d8a04c057","target":"record","created_at":"2026-05-18T03:03:23Z","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":"afcc5001960c5f19362a51dbf52c958fd1e383f43e21041a030e000df3d69f0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-01T21:32:42Z","title_canon_sha256":"083c13d5c2faa9345c2236228218292e827071b147856cb102c3c717f808f3df"},"schema_version":"1.0","source":{"id":"1401.0337","kind":"arxiv","version":1}},"canonical_sha256":"4f2ec963fdc9f32c318072728c97e054ec31c709bed7254d4fa60f1bff2205a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f2ec963fdc9f32c318072728c97e054ec31c709bed7254d4fa60f1bff2205a6","first_computed_at":"2026-05-18T03:03:23.472783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:23.472783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bCsd17hOtUHJUEn78E7bjrS1DA9x2BXTv35veSFLdfv1nx/8sTEqk+xTd7I1ppuGSfKZEAEGSxhF2Q5ciL5XDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:23.473331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0337","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b2353ba3e13209e160a1ac28ac8690787854bd9ff042560c2cf481d8a04c057","sha256:a8d2f9a0a584445c1b70066911259c5b866d31f6cf3b8c48c648cc7d7cdedc5e"],"state_sha256":"f62f3a4a47a88fc71b7646efa67e49c29f80ba8533cbde0902df448bbe4fadd0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vg96RvyOCrKFY6ErDldmyzLjZfnuf7CMbSKyDAKfPmeLcrv2VKyAYoLT2X2cWrdPN4WJCJeLUlHXUzynMPa9DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:56:00.327875Z","bundle_sha256":"ada90bb99d6970222a656d797dfafb5c94b9937902f8cd2ba8e05536c5bf42a9"}}