{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7Y5GTRWFZ4Y2KSTKTPH7NW6M35","short_pith_number":"pith:7Y5GTRWF","canonical_record":{"source":{"id":"1901.01591","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-06T18:42:59Z","cross_cats_sorted":[],"title_canon_sha256":"25e626f9443a6a807dcfd7327966342ccb8cf03a019918f40aaa7e196162cc09","abstract_canon_sha256":"a30a078c369e073b20355984d206889de9b31f0d9486554be9f08b9dbcf0fed2"},"schema_version":"1.0"},"canonical_sha256":"fe3a69c6c5cf31a54a6a9bcff6dbccdf64a345b01a54dc6d771ad4b6125ef736","source":{"kind":"arxiv","id":"1901.01591","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01591","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01591v2","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01591","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"7Y5GTRWFZ4Y2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7Y5GTRWFZ4Y2KSTK","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7Y5GTRWF","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7Y5GTRWFZ4Y2KSTKTPH7NW6M35","target":"record","payload":{"canonical_record":{"source":{"id":"1901.01591","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-06T18:42:59Z","cross_cats_sorted":[],"title_canon_sha256":"25e626f9443a6a807dcfd7327966342ccb8cf03a019918f40aaa7e196162cc09","abstract_canon_sha256":"a30a078c369e073b20355984d206889de9b31f0d9486554be9f08b9dbcf0fed2"},"schema_version":"1.0"},"canonical_sha256":"fe3a69c6c5cf31a54a6a9bcff6dbccdf64a345b01a54dc6d771ad4b6125ef736","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:43.911913Z","signature_b64":"jYLp4tFnEhyienEBxAzDis4O9sm0PIolTyXZ3sGj21jC16iLxgR/oRqj4M+r+NdSCeLGDRdVgqoYruyoSBuCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe3a69c6c5cf31a54a6a9bcff6dbccdf64a345b01a54dc6d771ad4b6125ef736","last_reissued_at":"2026-05-17T23:47:43.911058Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:43.911058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.01591","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-05-17T23:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RsfawqG2d8AeDdi5NiWyKuVGtR0h1U34KQSlZRch3P9buutB7/RZWOfX0C27F4PdPRFIOd5KDhTlpCLF8JOpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:20:19.988423Z"},"content_sha256":"2fbcf5ff316ecf042ac8c029d19df4e2137a09c8e7893c90437312a0f962a0bc","schema_version":"1.0","event_id":"sha256:2fbcf5ff316ecf042ac8c029d19df4e2137a09c8e7893c90437312a0f962a0bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7Y5GTRWFZ4Y2KSTKTPH7NW6M35","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On enumerators of Smirnov words by descents and cyclic descents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brittney Ellzey, Michelle L. Wachs","submitted_at":"2019-01-06T18:42:59Z","abstract_excerpt":"A Smirnov word is a word over the positive integers in which adjacent letters must be different. A symmetric function enumerating these words by descent number arose in the work of Shareshian and the second named author on $q$-Eulerian polynomials, where a $t$-analog of a formula of Carlitz, Scoville, and Vaughan for enumerating Smirnov words is proved. A symmetric function enumerating a circular version of these words by cyclic descent number arose in the work of the first named author on chromatic quasisymmetric functions of directed graphs, where a $t$-analog of a formula of Stanley for enu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01591","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":""},"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-17T23:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvkT9nqa+CZgXjYp7fbnS84bkgGywkAMuQJEhte/nE8DqSurFX9aoftJyR8F3n9fjv62/WjiirmmecBLcN3FAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:20:19.988770Z"},"content_sha256":"bb1bd525e5a43a2c92b1ce164b43321c62b1212a12a96c93f8753f3c7a81af97","schema_version":"1.0","event_id":"sha256:bb1bd525e5a43a2c92b1ce164b43321c62b1212a12a96c93f8753f3c7a81af97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7Y5GTRWFZ4Y2KSTKTPH7NW6M35/bundle.json","state_url":"https://pith.science/pith/7Y5GTRWFZ4Y2KSTKTPH7NW6M35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7Y5GTRWFZ4Y2KSTKTPH7NW6M35/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-24T19:20:19Z","links":{"resolver":"https://pith.science/pith/7Y5GTRWFZ4Y2KSTKTPH7NW6M35","bundle":"https://pith.science/pith/7Y5GTRWFZ4Y2KSTKTPH7NW6M35/bundle.json","state":"https://pith.science/pith/7Y5GTRWFZ4Y2KSTKTPH7NW6M35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7Y5GTRWFZ4Y2KSTKTPH7NW6M35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7Y5GTRWFZ4Y2KSTKTPH7NW6M35","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":"a30a078c369e073b20355984d206889de9b31f0d9486554be9f08b9dbcf0fed2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-06T18:42:59Z","title_canon_sha256":"25e626f9443a6a807dcfd7327966342ccb8cf03a019918f40aaa7e196162cc09"},"schema_version":"1.0","source":{"id":"1901.01591","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01591","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01591v2","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01591","created_at":"2026-05-17T23:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"7Y5GTRWFZ4Y2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7Y5GTRWFZ4Y2KSTK","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7Y5GTRWF","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:bb1bd525e5a43a2c92b1ce164b43321c62b1212a12a96c93f8753f3c7a81af97","target":"graph","created_at":"2026-05-17T23:47:43Z","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":"A Smirnov word is a word over the positive integers in which adjacent letters must be different. A symmetric function enumerating these words by descent number arose in the work of Shareshian and the second named author on $q$-Eulerian polynomials, where a $t$-analog of a formula of Carlitz, Scoville, and Vaughan for enumerating Smirnov words is proved. A symmetric function enumerating a circular version of these words by cyclic descent number arose in the work of the first named author on chromatic quasisymmetric functions of directed graphs, where a $t$-analog of a formula of Stanley for enu","authors_text":"Brittney Ellzey, Michelle L. Wachs","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-06T18:42:59Z","title":"On enumerators of Smirnov words by descents and cyclic descents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01591","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:2fbcf5ff316ecf042ac8c029d19df4e2137a09c8e7893c90437312a0f962a0bc","target":"record","created_at":"2026-05-17T23:47:43Z","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":"a30a078c369e073b20355984d206889de9b31f0d9486554be9f08b9dbcf0fed2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-06T18:42:59Z","title_canon_sha256":"25e626f9443a6a807dcfd7327966342ccb8cf03a019918f40aaa7e196162cc09"},"schema_version":"1.0","source":{"id":"1901.01591","kind":"arxiv","version":2}},"canonical_sha256":"fe3a69c6c5cf31a54a6a9bcff6dbccdf64a345b01a54dc6d771ad4b6125ef736","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe3a69c6c5cf31a54a6a9bcff6dbccdf64a345b01a54dc6d771ad4b6125ef736","first_computed_at":"2026-05-17T23:47:43.911058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:43.911058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jYLp4tFnEhyienEBxAzDis4O9sm0PIolTyXZ3sGj21jC16iLxgR/oRqj4M+r+NdSCeLGDRdVgqoYruyoSBuCCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:43.911913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.01591","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fbcf5ff316ecf042ac8c029d19df4e2137a09c8e7893c90437312a0f962a0bc","sha256:bb1bd525e5a43a2c92b1ce164b43321c62b1212a12a96c93f8753f3c7a81af97"],"state_sha256":"47ba5da1133eeb651dae429596a0d5c2b3d8ac08c364ab33332dc9c1ee18182b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zw/cX75OaNVIGve0GswwG2QgcQEv3GW9V9tsaDjR+RGw1aHG3EDDweADRBI5Il/FVnYG07LflnrwlJY18P7zDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:20:19.990784Z","bundle_sha256":"f877288f13d83c271b305ddb088d34fbaaa55f3671597aa58e54ec203549cb46"}}