{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WHBK5DGR7CFCULGNUJCRMJZZ2U","short_pith_number":"pith:WHBK5DGR","canonical_record":{"source":{"id":"1508.02793","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-12T01:38:07Z","cross_cats_sorted":["cs.DM","cs.FL"],"title_canon_sha256":"a0a867fb8534c3daa6296a5ab4a4257351510080ba95c1e551f7b0f809a210e9","abstract_canon_sha256":"87a8fe8a1045d84671272b82e50d4243090178d91283657042b204199495b9d3"},"schema_version":"1.0"},"canonical_sha256":"b1c2ae8cd1f88a2a2ccda245162739d5384296aa3d0ccca80b4701d360f274ed","source":{"kind":"arxiv","id":"1508.02793","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02793","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02793v3","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02793","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"pith_short_12","alias_value":"WHBK5DGR7CFC","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WHBK5DGR7CFCULGN","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WHBK5DGR","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WHBK5DGR7CFCULGNUJCRMJZZ2U","target":"record","payload":{"canonical_record":{"source":{"id":"1508.02793","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-12T01:38:07Z","cross_cats_sorted":["cs.DM","cs.FL"],"title_canon_sha256":"a0a867fb8534c3daa6296a5ab4a4257351510080ba95c1e551f7b0f809a210e9","abstract_canon_sha256":"87a8fe8a1045d84671272b82e50d4243090178d91283657042b204199495b9d3"},"schema_version":"1.0"},"canonical_sha256":"b1c2ae8cd1f88a2a2ccda245162739d5384296aa3d0ccca80b4701d360f274ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:09.684171Z","signature_b64":"JNTJkUIS8lB2Ha0mM+CBtcNr6uWo4bcL3VwIv/9F37s2l3fdtwq6yIbqYl1GMefkf/vMzPHaU6gi6yEGcNJQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1c2ae8cd1f88a2a2ccda245162739d5384296aa3d0ccca80b4701d360f274ed","last_reissued_at":"2026-05-18T00:23:09.683545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:09.683545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.02793","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-05-18T00:23:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XXi6zGJXOrqeCTWT01VfPfUzJLQSTjlHL2ZxGrv0hEdpdmnO3LN2Tdqmy80PQ5BNsD5cT2dkHD4Z+ApNHGhBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:48:28.376175Z"},"content_sha256":"92d383f9e57493f90bd7fca26b76e5cb725846ff6ae8181579576b4d2318bf53","schema_version":"1.0","event_id":"sha256:92d383f9e57493f90bd7fca26b76e5cb725846ff6ae8181579576b4d2318bf53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WHBK5DGR7CFCULGNUJCRMJZZ2U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A generalized Goulden-Jackson cluster method and lattice path enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.FL"],"primary_cat":"math.CO","authors_text":"Yan Zhuang","submitted_at":"2015-08-12T01:38:07Z","abstract_excerpt":"The Goulden-Jackson cluster method is a powerful tool for obtaining generating functions for counting words in a free monoid by occurrences of a set of subwords. We introduce a generalization of the cluster method for monoid networks, which generalize the combinatorial framework of free monoids. As a sample application of the generalized cluster method, we compute bivariate and multivariate generating functions counting Motzkin paths---both with height bounded and unbounded---by statistics corresponding to the number of occurrences of various subwords, yielding both closed-form and continued f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02793","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":""},"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-18T00:23:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0ej8S531h8LZ+eh9NSdcMk9LcxGePboGUiAGJgAHBsMYSobJWQwDME/g4C3InMRbBPZnLNEXHpGJYBdv6WTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:48:28.376829Z"},"content_sha256":"333ca06f230bc7f05ebb113de911cb62366c10f1728def4d3087f2ce2357db30","schema_version":"1.0","event_id":"sha256:333ca06f230bc7f05ebb113de911cb62366c10f1728def4d3087f2ce2357db30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHBK5DGR7CFCULGNUJCRMJZZ2U/bundle.json","state_url":"https://pith.science/pith/WHBK5DGR7CFCULGNUJCRMJZZ2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHBK5DGR7CFCULGNUJCRMJZZ2U/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-07T01:48:28Z","links":{"resolver":"https://pith.science/pith/WHBK5DGR7CFCULGNUJCRMJZZ2U","bundle":"https://pith.science/pith/WHBK5DGR7CFCULGNUJCRMJZZ2U/bundle.json","state":"https://pith.science/pith/WHBK5DGR7CFCULGNUJCRMJZZ2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHBK5DGR7CFCULGNUJCRMJZZ2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WHBK5DGR7CFCULGNUJCRMJZZ2U","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":"87a8fe8a1045d84671272b82e50d4243090178d91283657042b204199495b9d3","cross_cats_sorted":["cs.DM","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-12T01:38:07Z","title_canon_sha256":"a0a867fb8534c3daa6296a5ab4a4257351510080ba95c1e551f7b0f809a210e9"},"schema_version":"1.0","source":{"id":"1508.02793","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02793","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02793v3","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02793","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"pith_short_12","alias_value":"WHBK5DGR7CFC","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WHBK5DGR7CFCULGN","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WHBK5DGR","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:333ca06f230bc7f05ebb113de911cb62366c10f1728def4d3087f2ce2357db30","target":"graph","created_at":"2026-05-18T00:23:09Z","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":"The Goulden-Jackson cluster method is a powerful tool for obtaining generating functions for counting words in a free monoid by occurrences of a set of subwords. We introduce a generalization of the cluster method for monoid networks, which generalize the combinatorial framework of free monoids. As a sample application of the generalized cluster method, we compute bivariate and multivariate generating functions counting Motzkin paths---both with height bounded and unbounded---by statistics corresponding to the number of occurrences of various subwords, yielding both closed-form and continued f","authors_text":"Yan Zhuang","cross_cats":["cs.DM","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-12T01:38:07Z","title":"A generalized Goulden-Jackson cluster method and lattice path enumeration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02793","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:92d383f9e57493f90bd7fca26b76e5cb725846ff6ae8181579576b4d2318bf53","target":"record","created_at":"2026-05-18T00:23:09Z","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":"87a8fe8a1045d84671272b82e50d4243090178d91283657042b204199495b9d3","cross_cats_sorted":["cs.DM","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-12T01:38:07Z","title_canon_sha256":"a0a867fb8534c3daa6296a5ab4a4257351510080ba95c1e551f7b0f809a210e9"},"schema_version":"1.0","source":{"id":"1508.02793","kind":"arxiv","version":3}},"canonical_sha256":"b1c2ae8cd1f88a2a2ccda245162739d5384296aa3d0ccca80b4701d360f274ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1c2ae8cd1f88a2a2ccda245162739d5384296aa3d0ccca80b4701d360f274ed","first_computed_at":"2026-05-18T00:23:09.683545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:09.683545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JNTJkUIS8lB2Ha0mM+CBtcNr6uWo4bcL3VwIv/9F37s2l3fdtwq6yIbqYl1GMefkf/vMzPHaU6gi6yEGcNJQCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:09.684171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02793","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92d383f9e57493f90bd7fca26b76e5cb725846ff6ae8181579576b4d2318bf53","sha256:333ca06f230bc7f05ebb113de911cb62366c10f1728def4d3087f2ce2357db30"],"state_sha256":"6fe1bfe4cd1e2cc5bcc9add56ae309875da6581cd6181c70115d3601a5ba7e9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hZSqT+IIpBhpwTkNFYk6zH8fGK8Y6F+vxhuW8S4Uln56sVX0oQQQedF553vyBGvvUTVMOZYVDPwCYnPCDI9ZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T01:48:28.380498Z","bundle_sha256":"15627ada6e423a2667281280970f4e12d07e91136d704af60dd25ab88eb6d66a"}}