{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QQO3EZH4VALHAO5U3O4NFUCPB6","short_pith_number":"pith:QQO3EZH4","canonical_record":{"source":{"id":"1408.1859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-08T14:06:58Z","cross_cats_sorted":[],"title_canon_sha256":"db5c185ad92664674f1e490290f06048f45ca985c0cfe4a30c0f7e417460f348","abstract_canon_sha256":"29595e50fcb3ac0eb974d6cb82710044f561816ae6e6a46fdcac761ed3434d90"},"schema_version":"1.0"},"canonical_sha256":"841db264fca816703bb4dbb8d2d04f0f852a3563aa752a60723e5671da5fb19d","source":{"kind":"arxiv","id":"1408.1859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1859","created_at":"2026-05-18T02:45:38Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1859v1","created_at":"2026-05-18T02:45:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1859","created_at":"2026-05-18T02:45:38Z"},{"alias_kind":"pith_short_12","alias_value":"QQO3EZH4VALH","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QQO3EZH4VALHAO5U","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QQO3EZH4","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QQO3EZH4VALHAO5U3O4NFUCPB6","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-08T14:06:58Z","cross_cats_sorted":[],"title_canon_sha256":"db5c185ad92664674f1e490290f06048f45ca985c0cfe4a30c0f7e417460f348","abstract_canon_sha256":"29595e50fcb3ac0eb974d6cb82710044f561816ae6e6a46fdcac761ed3434d90"},"schema_version":"1.0"},"canonical_sha256":"841db264fca816703bb4dbb8d2d04f0f852a3563aa752a60723e5671da5fb19d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:38.960949Z","signature_b64":"zoEtLHNyQcPCtiSBBPLRiCTftUKBdJ0L5KpYYnH2Ae0kDtgOwir+a9Qb6rFdGOOuan93i89jcKij5pfZGBJ8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"841db264fca816703bb4dbb8d2d04f0f852a3563aa752a60723e5671da5fb19d","last_reissued_at":"2026-05-18T02:45:38.960473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:38.960473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1859","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-18T02:45:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LK0ELqiXaFH/TcsPyMt6zByy0ydBHCR0q7+fQfZpoa+OomD39dLaAOapkBC3UNStTCCR3EIxgE5Vuzg36QFnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:27:19.949721Z"},"content_sha256":"ea953af627776795c313ecd290f0bce2b912f4c7a48c298fe281de9795cb0fe4","schema_version":"1.0","event_id":"sha256:ea953af627776795c313ecd290f0bce2b912f4c7a48c298fe281de9795cb0fe4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QQO3EZH4VALHAO5U3O4NFUCPB6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Context-free Grammars for Permutations and Increasing Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amy M. Fu, William Y.C. Chen","submitted_at":"2014-08-08T14:06:58Z","abstract_excerpt":"In this paper, we introduce the notion of a grammatical labeling to describe a recursive process of generating combinatorial objects based on a context-free grammar. For example, by labeling the ascents and descents of a Stirling permutation, we obtain a grammar for the second-order Eulerian polynomials. By using the grammar for $0$-$1$-$2$ increasing trees given by Dumont, we obtain a grammatical derivation of the generating function of the Andr\\'e polynomials obtained by Foata and Sch\\\"utzenberger, without solving a differential equation. We also find a grammar for the number $T(n,k)$ of per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1859","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-18T02:45:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PK+WXL9EQoLL4lVHk3QlWzF8l1zncNHHztQHekRIs/yEPEKgnd5naOfqTq7a1FLLAgMpd3UIgvhC33NvFxTcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:27:19.950053Z"},"content_sha256":"49ef9c83b56f6d95b18943a204d63fd4c5d33a110465a70a6115be877bc18ded","schema_version":"1.0","event_id":"sha256:49ef9c83b56f6d95b18943a204d63fd4c5d33a110465a70a6115be877bc18ded"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQO3EZH4VALHAO5U3O4NFUCPB6/bundle.json","state_url":"https://pith.science/pith/QQO3EZH4VALHAO5U3O4NFUCPB6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQO3EZH4VALHAO5U3O4NFUCPB6/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-20T07:27:19Z","links":{"resolver":"https://pith.science/pith/QQO3EZH4VALHAO5U3O4NFUCPB6","bundle":"https://pith.science/pith/QQO3EZH4VALHAO5U3O4NFUCPB6/bundle.json","state":"https://pith.science/pith/QQO3EZH4VALHAO5U3O4NFUCPB6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQO3EZH4VALHAO5U3O4NFUCPB6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QQO3EZH4VALHAO5U3O4NFUCPB6","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":"29595e50fcb3ac0eb974d6cb82710044f561816ae6e6a46fdcac761ed3434d90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-08T14:06:58Z","title_canon_sha256":"db5c185ad92664674f1e490290f06048f45ca985c0cfe4a30c0f7e417460f348"},"schema_version":"1.0","source":{"id":"1408.1859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1859","created_at":"2026-05-18T02:45:38Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1859v1","created_at":"2026-05-18T02:45:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1859","created_at":"2026-05-18T02:45:38Z"},{"alias_kind":"pith_short_12","alias_value":"QQO3EZH4VALH","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QQO3EZH4VALHAO5U","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QQO3EZH4","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:49ef9c83b56f6d95b18943a204d63fd4c5d33a110465a70a6115be877bc18ded","target":"graph","created_at":"2026-05-18T02:45: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"},"paper":{"abstract_excerpt":"In this paper, we introduce the notion of a grammatical labeling to describe a recursive process of generating combinatorial objects based on a context-free grammar. For example, by labeling the ascents and descents of a Stirling permutation, we obtain a grammar for the second-order Eulerian polynomials. By using the grammar for $0$-$1$-$2$ increasing trees given by Dumont, we obtain a grammatical derivation of the generating function of the Andr\\'e polynomials obtained by Foata and Sch\\\"utzenberger, without solving a differential equation. We also find a grammar for the number $T(n,k)$ of per","authors_text":"Amy M. Fu, William Y.C. Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-08T14:06:58Z","title":"Context-free Grammars for Permutations and Increasing Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1859","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:ea953af627776795c313ecd290f0bce2b912f4c7a48c298fe281de9795cb0fe4","target":"record","created_at":"2026-05-18T02:45: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":"29595e50fcb3ac0eb974d6cb82710044f561816ae6e6a46fdcac761ed3434d90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-08T14:06:58Z","title_canon_sha256":"db5c185ad92664674f1e490290f06048f45ca985c0cfe4a30c0f7e417460f348"},"schema_version":"1.0","source":{"id":"1408.1859","kind":"arxiv","version":1}},"canonical_sha256":"841db264fca816703bb4dbb8d2d04f0f852a3563aa752a60723e5671da5fb19d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"841db264fca816703bb4dbb8d2d04f0f852a3563aa752a60723e5671da5fb19d","first_computed_at":"2026-05-18T02:45:38.960473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:38.960473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zoEtLHNyQcPCtiSBBPLRiCTftUKBdJ0L5KpYYnH2Ae0kDtgOwir+a9Qb6rFdGOOuan93i89jcKij5pfZGBJ8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:38.960949Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea953af627776795c313ecd290f0bce2b912f4c7a48c298fe281de9795cb0fe4","sha256:49ef9c83b56f6d95b18943a204d63fd4c5d33a110465a70a6115be877bc18ded"],"state_sha256":"d8dc7da7126b7f3d928e81b258fdfa43595b7e96d2b5f7f03c62d81ac9cd0472"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LC1KMzFrcZ0WJg+k1qIHyyCiIatuFEPOdM6JpKEe3ZlgVAwuhxLcl2s+OQBktUuj7g3OH1oMIbRMUDVlwiJZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:27:19.951865Z","bundle_sha256":"8b5fea73c22275b6e1008e250d7dcd64d057e6af5188036fdc5e63548cbfade7"}}