{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:65FWW3QCKNLFIW6JYUOBL7QL4O","short_pith_number":"pith:65FWW3QC","canonical_record":{"source":{"id":"1808.04102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T08:25:27Z","cross_cats_sorted":[],"title_canon_sha256":"773bee7999430e2f92f1ff5f7b6c70b750f45972cbea5288daa068f84ec8ae76","abstract_canon_sha256":"04156ef35099bb2d993bc736d47b3b62d16b1e4c3b2d6ba40cf6912a90ac1be6"},"schema_version":"1.0"},"canonical_sha256":"f74b6b6e025356545bc9c51c15fe0be39f4a30c917068ae7e8825e65320d0f79","source":{"kind":"arxiv","id":"1808.04102","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04102","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04102v1","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04102","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"pith_short_12","alias_value":"65FWW3QCKNLF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"65FWW3QCKNLFIW6J","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"65FWW3QC","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:65FWW3QCKNLFIW6JYUOBL7QL4O","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T08:25:27Z","cross_cats_sorted":[],"title_canon_sha256":"773bee7999430e2f92f1ff5f7b6c70b750f45972cbea5288daa068f84ec8ae76","abstract_canon_sha256":"04156ef35099bb2d993bc736d47b3b62d16b1e4c3b2d6ba40cf6912a90ac1be6"},"schema_version":"1.0"},"canonical_sha256":"f74b6b6e025356545bc9c51c15fe0be39f4a30c917068ae7e8825e65320d0f79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:18.866775Z","signature_b64":"xbnDqBaSmXsDxcBxksx/q/Pj7jmxQ4NBelwV3e7h165wwNM9FVKrujGYLt0Lq/YDs9shhqcYJW4VYEy8flJECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f74b6b6e025356545bc9c51c15fe0be39f4a30c917068ae7e8825e65320d0f79","last_reissued_at":"2026-05-18T00:08:18.866372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:18.866372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04102","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-18T00:08:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dy2D2fjy9Cv6cpZtz0jY0qOAthmySe5fFhq8NMFp1KCSGtMxSaZ5irADwzKss/R7Z2sO5ajt1IxB0nDuyhIwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:21:38.108086Z"},"content_sha256":"d5a79e86101b4cc7e0f53ab7d5d8489a754326b924135fcb3779e35c28e2b949","schema_version":"1.0","event_id":"sha256:d5a79e86101b4cc7e0f53ab7d5d8489a754326b924135fcb3779e35c28e2b949"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:65FWW3QCKNLFIW6JYUOBL7QL4O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parikh Matrices for Powers of Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adrian Atanasiu, Ghajendran Poovanandran, Wen Chean Teh","submitted_at":"2018-08-13T08:25:27Z","abstract_excerpt":"Certain upper triangular matrices, termed as Parikh matrices, are often used in the combinatorial study of words. Given a word, the Parikh matrix of that word elegantly computes the number of occurrences of certain predefined subwords in that word. In this paper, we compute the Parikh matrix of any word raised to an arbitrary power. Furthermore, we propose canonical decompositions of both Parikh matrices and words into normal forms. Finally, given a Parikh matrix, the relation between its normal form and the normal forms of words in the corresponding M-equivalence class is established."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04102","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-18T00:08:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"++PJgsnzLxxJWGltrifJm8Bg9+WflTJiAkxxwmSo6rrOiwj7+4QN64BcoLnJs8o5aZi3cAWc8rbYmes3hYNUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:21:38.108735Z"},"content_sha256":"ce466f417b1e77d7a7bed71ea084ba353547bd53b0b1ad00f3409badd88344ed","schema_version":"1.0","event_id":"sha256:ce466f417b1e77d7a7bed71ea084ba353547bd53b0b1ad00f3409badd88344ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65FWW3QCKNLFIW6JYUOBL7QL4O/bundle.json","state_url":"https://pith.science/pith/65FWW3QCKNLFIW6JYUOBL7QL4O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65FWW3QCKNLFIW6JYUOBL7QL4O/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-05-27T20:21:38Z","links":{"resolver":"https://pith.science/pith/65FWW3QCKNLFIW6JYUOBL7QL4O","bundle":"https://pith.science/pith/65FWW3QCKNLFIW6JYUOBL7QL4O/bundle.json","state":"https://pith.science/pith/65FWW3QCKNLFIW6JYUOBL7QL4O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65FWW3QCKNLFIW6JYUOBL7QL4O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:65FWW3QCKNLFIW6JYUOBL7QL4O","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":"04156ef35099bb2d993bc736d47b3b62d16b1e4c3b2d6ba40cf6912a90ac1be6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T08:25:27Z","title_canon_sha256":"773bee7999430e2f92f1ff5f7b6c70b750f45972cbea5288daa068f84ec8ae76"},"schema_version":"1.0","source":{"id":"1808.04102","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04102","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04102v1","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04102","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"pith_short_12","alias_value":"65FWW3QCKNLF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"65FWW3QCKNLFIW6J","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"65FWW3QC","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:ce466f417b1e77d7a7bed71ea084ba353547bd53b0b1ad00f3409badd88344ed","target":"graph","created_at":"2026-05-18T00:08:18Z","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":"Certain upper triangular matrices, termed as Parikh matrices, are often used in the combinatorial study of words. Given a word, the Parikh matrix of that word elegantly computes the number of occurrences of certain predefined subwords in that word. In this paper, we compute the Parikh matrix of any word raised to an arbitrary power. Furthermore, we propose canonical decompositions of both Parikh matrices and words into normal forms. Finally, given a Parikh matrix, the relation between its normal form and the normal forms of words in the corresponding M-equivalence class is established.","authors_text":"Adrian Atanasiu, Ghajendran Poovanandran, Wen Chean Teh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T08:25:27Z","title":"Parikh Matrices for Powers of Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04102","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:d5a79e86101b4cc7e0f53ab7d5d8489a754326b924135fcb3779e35c28e2b949","target":"record","created_at":"2026-05-18T00:08:18Z","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":"04156ef35099bb2d993bc736d47b3b62d16b1e4c3b2d6ba40cf6912a90ac1be6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T08:25:27Z","title_canon_sha256":"773bee7999430e2f92f1ff5f7b6c70b750f45972cbea5288daa068f84ec8ae76"},"schema_version":"1.0","source":{"id":"1808.04102","kind":"arxiv","version":1}},"canonical_sha256":"f74b6b6e025356545bc9c51c15fe0be39f4a30c917068ae7e8825e65320d0f79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f74b6b6e025356545bc9c51c15fe0be39f4a30c917068ae7e8825e65320d0f79","first_computed_at":"2026-05-18T00:08:18.866372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:18.866372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xbnDqBaSmXsDxcBxksx/q/Pj7jmxQ4NBelwV3e7h165wwNM9FVKrujGYLt0Lq/YDs9shhqcYJW4VYEy8flJECg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:18.866775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04102","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5a79e86101b4cc7e0f53ab7d5d8489a754326b924135fcb3779e35c28e2b949","sha256:ce466f417b1e77d7a7bed71ea084ba353547bd53b0b1ad00f3409badd88344ed"],"state_sha256":"e6bdf4455040772de2ebd5f06685ae9206bd7769d7e8be71b56f2966826a79e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/M7Ym3C8asmKhQUwRcc6vgdAGDiKruk7ILldnVdhwnkwbTzxL0lQJTdnkbqZSIg68xifA6R0FleJHVxQzR5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:21:38.111440Z","bundle_sha256":"24ac3a501a93723281b1d0c5d299b985d155fb9a75bebae4cbe6385fe3ad0535"}}