{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:E7XAQWNRVL3QQEUVL3YPPOEOUU","short_pith_number":"pith:E7XAQWNR","canonical_record":{"source":{"id":"2202.07715","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-02-15T20:29:53Z","cross_cats_sorted":[],"title_canon_sha256":"5eb9d74fe0aa9608638beb980a1a2a7024ec76f5d4c7e0a333855d2a52b522bc","abstract_canon_sha256":"f1657bbc27564a6adcc1e88b7b6aa70c05c384021e901d59a47dbafe5edd9a6e"},"schema_version":"1.0"},"canonical_sha256":"27ee0859b1aaf70812955ef0f7b88ea5175d8dc26ebbc0ab71937bd7b27c74b6","source":{"kind":"arxiv","id":"2202.07715","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.07715","created_at":"2026-07-05T09:20:35Z"},{"alias_kind":"arxiv_version","alias_value":"2202.07715v3","created_at":"2026-07-05T09:20:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.07715","created_at":"2026-07-05T09:20:35Z"},{"alias_kind":"pith_short_12","alias_value":"E7XAQWNRVL3Q","created_at":"2026-07-05T09:20:35Z"},{"alias_kind":"pith_short_16","alias_value":"E7XAQWNRVL3QQEUV","created_at":"2026-07-05T09:20:35Z"},{"alias_kind":"pith_short_8","alias_value":"E7XAQWNR","created_at":"2026-07-05T09:20:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:E7XAQWNRVL3QQEUVL3YPPOEOUU","target":"record","payload":{"canonical_record":{"source":{"id":"2202.07715","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-02-15T20:29:53Z","cross_cats_sorted":[],"title_canon_sha256":"5eb9d74fe0aa9608638beb980a1a2a7024ec76f5d4c7e0a333855d2a52b522bc","abstract_canon_sha256":"f1657bbc27564a6adcc1e88b7b6aa70c05c384021e901d59a47dbafe5edd9a6e"},"schema_version":"1.0"},"canonical_sha256":"27ee0859b1aaf70812955ef0f7b88ea5175d8dc26ebbc0ab71937bd7b27c74b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:20:35.727048Z","signature_b64":"Tirhr0ZH9uyfbATC3MAt8t7+qn84vrAQQeGunA70ZuyVVsdGQzr9/1l8ajqtpHNIrzrN+Wlqbgy3kBkztjVuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27ee0859b1aaf70812955ef0f7b88ea5175d8dc26ebbc0ab71937bd7b27c74b6","last_reissued_at":"2026-07-05T09:20:35.726545Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:20:35.726545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.07715","source_version":3,"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-05T09:20:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TkQ3luEOcsi44xcPyaouqXOmf3WK9HR77ZtV6sMHWjxoLbCLOjDUyY11F7/eSUHQgtJ2qRecRhzAQJA96IVJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:42:05.563222Z"},"content_sha256":"ea52a519358253207bf08061ecaa7fd0bafce6d99bc3e250c862b7923c5cbf96","schema_version":"1.0","event_id":"sha256:ea52a519358253207bf08061ecaa7fd0bafce6d99bc3e250c862b7923c5cbf96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:E7XAQWNRVL3QQEUVL3YPPOEOUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial Exploration: An algorithmic framework for enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Claesson, Christian Bean, \\'Emile Nadeau, Henning Ulfarsson, Jay Pantone, Michael H. Albert","submitted_at":"2022-02-15T20:29:53Z","abstract_excerpt":"Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and provide an open-source Python implementation. As a prerequisite, we build up a new theoretical foundation for combinatorial decomposition strategies and combinatorial specifications.\n  We then apply Combinatorial Exploration to the domain of permutation patterns, to great effect. We rederive hundreds of results in the literature in a uniform manner and prov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.07715","kind":"arxiv","version":3},"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/2202.07715/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-05T09:20:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xV5cz0Zvi3CRGnA6VXCD04/EtRgp4Zh3m8lTHYxlRZEx8u2ov6b6PawbF/yRddIenvcZiTxXUHPOLtCrL47nDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:42:05.563594Z"},"content_sha256":"503c6067e769d272d2ec28ca7bb25f356aa02f7e8624042a324fb5ee0cb7140e","schema_version":"1.0","event_id":"sha256:503c6067e769d272d2ec28ca7bb25f356aa02f7e8624042a324fb5ee0cb7140e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7XAQWNRVL3QQEUVL3YPPOEOUU/bundle.json","state_url":"https://pith.science/pith/E7XAQWNRVL3QQEUVL3YPPOEOUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7XAQWNRVL3QQEUVL3YPPOEOUU/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-13T20:42:05Z","links":{"resolver":"https://pith.science/pith/E7XAQWNRVL3QQEUVL3YPPOEOUU","bundle":"https://pith.science/pith/E7XAQWNRVL3QQEUVL3YPPOEOUU/bundle.json","state":"https://pith.science/pith/E7XAQWNRVL3QQEUVL3YPPOEOUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7XAQWNRVL3QQEUVL3YPPOEOUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:E7XAQWNRVL3QQEUVL3YPPOEOUU","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":"f1657bbc27564a6adcc1e88b7b6aa70c05c384021e901d59a47dbafe5edd9a6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-02-15T20:29:53Z","title_canon_sha256":"5eb9d74fe0aa9608638beb980a1a2a7024ec76f5d4c7e0a333855d2a52b522bc"},"schema_version":"1.0","source":{"id":"2202.07715","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.07715","created_at":"2026-07-05T09:20:35Z"},{"alias_kind":"arxiv_version","alias_value":"2202.07715v3","created_at":"2026-07-05T09:20:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.07715","created_at":"2026-07-05T09:20:35Z"},{"alias_kind":"pith_short_12","alias_value":"E7XAQWNRVL3Q","created_at":"2026-07-05T09:20:35Z"},{"alias_kind":"pith_short_16","alias_value":"E7XAQWNRVL3QQEUV","created_at":"2026-07-05T09:20:35Z"},{"alias_kind":"pith_short_8","alias_value":"E7XAQWNR","created_at":"2026-07-05T09:20:35Z"}],"graph_snapshots":[{"event_id":"sha256:503c6067e769d272d2ec28ca7bb25f356aa02f7e8624042a324fb5ee0cb7140e","target":"graph","created_at":"2026-07-05T09:20:35Z","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/2202.07715/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and provide an open-source Python implementation. As a prerequisite, we build up a new theoretical foundation for combinatorial decomposition strategies and combinatorial specifications.\n  We then apply Combinatorial Exploration to the domain of permutation patterns, to great effect. We rederive hundreds of results in the literature in a uniform manner and prov","authors_text":"Anders Claesson, Christian Bean, \\'Emile Nadeau, Henning Ulfarsson, Jay Pantone, Michael H. Albert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-02-15T20:29:53Z","title":"Combinatorial Exploration: An algorithmic framework for enumeration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.07715","kind":"arxiv","version":3},"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:ea52a519358253207bf08061ecaa7fd0bafce6d99bc3e250c862b7923c5cbf96","target":"record","created_at":"2026-07-05T09:20:35Z","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":"f1657bbc27564a6adcc1e88b7b6aa70c05c384021e901d59a47dbafe5edd9a6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-02-15T20:29:53Z","title_canon_sha256":"5eb9d74fe0aa9608638beb980a1a2a7024ec76f5d4c7e0a333855d2a52b522bc"},"schema_version":"1.0","source":{"id":"2202.07715","kind":"arxiv","version":3}},"canonical_sha256":"27ee0859b1aaf70812955ef0f7b88ea5175d8dc26ebbc0ab71937bd7b27c74b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27ee0859b1aaf70812955ef0f7b88ea5175d8dc26ebbc0ab71937bd7b27c74b6","first_computed_at":"2026-07-05T09:20:35.726545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:20:35.726545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tirhr0ZH9uyfbATC3MAt8t7+qn84vrAQQeGunA70ZuyVVsdGQzr9/1l8ajqtpHNIrzrN+Wlqbgy3kBkztjVuDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:20:35.727048Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.07715","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea52a519358253207bf08061ecaa7fd0bafce6d99bc3e250c862b7923c5cbf96","sha256:503c6067e769d272d2ec28ca7bb25f356aa02f7e8624042a324fb5ee0cb7140e"],"state_sha256":"2421783d09be3cc210d73e09e6434c946ebcc31d0f5ace5c342bc783009ba85e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wI5dJpM8lgjvSf80yayn0t2Cy2ZNOw4CI67n/MDh9N406KCQ6B4iAjITt4rOPG67DqdKcZaomlterxX07Q/fCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T20:42:05.571877Z","bundle_sha256":"d7222356a726faea781411dace9000d1ba6efd4d259329cd5a21b752055c9736"}}