{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WQUVFX4GFLBQOUICNOP2KZYKTR","short_pith_number":"pith:WQUVFX4G","schema_version":"1.0","canonical_sha256":"b42952df862ac30751026b9fa5670a9c4a79ec3b42b2a5f63bc53f4de7737dcc","source":{"kind":"arxiv","id":"1502.03065","version":3},"attestation_state":"computed","paper":{"title":"Subword counting and the incidence algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Claesson","submitted_at":"2015-02-10T20:18:21Z","abstract_excerpt":"The Pascal matrix, $P$, is an upper diagonal matrix whose entries are the binomial coefficients. In 1993 Call and Velleman demonstrated that it satisfies the beautiful relation $P=\\exp(H)$ in which $H$ has the numbers 1, 2, 3, etc. on its superdiagonal and zeros elsewhere. We generalize this identity to the incidence algebras $I(A^*)$ and $I(\\mathcal{S})$ of functions on words and permutations, respectively. In $I(A^*)$ the entries of $P$ and $H$ count subwords; in $I(\\mathcal{S})$ they count permutation patterns. Inspired by vincular permutation patterns we define what it means for a subword "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1502.03065","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-10T20:18:21Z","cross_cats_sorted":[],"title_canon_sha256":"d31902cb39f74c562fb2522736fdc3a00e788c9363f89d8e14c6efc50d64a64c","abstract_canon_sha256":"5357416e0b5bb107c48f22cc140558d693f9922f14416127c87d0dc6418fa905"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:04.419605Z","signature_b64":"sOeTOQS0blcp2DXpLNgrxTpj7+AK0ZTJ1EjuRIHFwDUXprMVFBTKgUmnGDrhSOEFzhJrIQaE7F7nnJF5nVq/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b42952df862ac30751026b9fa5670a9c4a79ec3b42b2a5f63bc53f4de7737dcc","last_reissued_at":"2026-05-18T02:25:04.419241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:04.419241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subword counting and the incidence algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Claesson","submitted_at":"2015-02-10T20:18:21Z","abstract_excerpt":"The Pascal matrix, $P$, is an upper diagonal matrix whose entries are the binomial coefficients. In 1993 Call and Velleman demonstrated that it satisfies the beautiful relation $P=\\exp(H)$ in which $H$ has the numbers 1, 2, 3, etc. on its superdiagonal and zeros elsewhere. We generalize this identity to the incidence algebras $I(A^*)$ and $I(\\mathcal{S})$ of functions on words and permutations, respectively. In $I(A^*)$ the entries of $P$ and $H$ count subwords; in $I(\\mathcal{S})$ they count permutation patterns. Inspired by vincular permutation patterns we define what it means for a subword "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03065","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.03065","created_at":"2026-05-18T02:25:04.419298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03065v3","created_at":"2026-05-18T02:25:04.419298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03065","created_at":"2026-05-18T02:25:04.419298+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQUVFX4GFLBQ","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQUVFX4GFLBQOUIC","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQUVFX4G","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WQUVFX4GFLBQOUICNOP2KZYKTR","json":"https://pith.science/pith/WQUVFX4GFLBQOUICNOP2KZYKTR.json","graph_json":"https://pith.science/api/pith-number/WQUVFX4GFLBQOUICNOP2KZYKTR/graph.json","events_json":"https://pith.science/api/pith-number/WQUVFX4GFLBQOUICNOP2KZYKTR/events.json","paper":"https://pith.science/paper/WQUVFX4G"},"agent_actions":{"view_html":"https://pith.science/pith/WQUVFX4GFLBQOUICNOP2KZYKTR","download_json":"https://pith.science/pith/WQUVFX4GFLBQOUICNOP2KZYKTR.json","view_paper":"https://pith.science/paper/WQUVFX4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03065&json=true","fetch_graph":"https://pith.science/api/pith-number/WQUVFX4GFLBQOUICNOP2KZYKTR/graph.json","fetch_events":"https://pith.science/api/pith-number/WQUVFX4GFLBQOUICNOP2KZYKTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQUVFX4GFLBQOUICNOP2KZYKTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQUVFX4GFLBQOUICNOP2KZYKTR/action/storage_attestation","attest_author":"https://pith.science/pith/WQUVFX4GFLBQOUICNOP2KZYKTR/action/author_attestation","sign_citation":"https://pith.science/pith/WQUVFX4GFLBQOUICNOP2KZYKTR/action/citation_signature","submit_replication":"https://pith.science/pith/WQUVFX4GFLBQOUICNOP2KZYKTR/action/replication_record"}},"created_at":"2026-05-18T02:25:04.419298+00:00","updated_at":"2026-05-18T02:25:04.419298+00:00"}