{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RXMC2JYJKYPQDVM4A4QYCJPOXS","short_pith_number":"pith:RXMC2JYJ","canonical_record":{"source":{"id":"1408.0451","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-03T03:18:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c737429d3c543c604dff99e2364f30c2d7139c98c7247cbe43c52ac34ca7cd1f","abstract_canon_sha256":"07094501c1e3402b6c6b08f75edf2fcf82e674f960c00e60010a21447166dd07"},"schema_version":"1.0"},"canonical_sha256":"8dd82d2709561f01d59c07218125eebcb34284386b0bbf6d852babae13a95cb6","source":{"kind":"arxiv","id":"1408.0451","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0451","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0451v2","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0451","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"RXMC2JYJKYPQ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RXMC2JYJKYPQDVM4","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RXMC2JYJ","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RXMC2JYJKYPQDVM4A4QYCJPOXS","target":"record","payload":{"canonical_record":{"source":{"id":"1408.0451","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-03T03:18:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c737429d3c543c604dff99e2364f30c2d7139c98c7247cbe43c52ac34ca7cd1f","abstract_canon_sha256":"07094501c1e3402b6c6b08f75edf2fcf82e674f960c00e60010a21447166dd07"},"schema_version":"1.0"},"canonical_sha256":"8dd82d2709561f01d59c07218125eebcb34284386b0bbf6d852babae13a95cb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:31.678780Z","signature_b64":"JrVAqWOA4NbWYBTYU8Ydkxva6Bflz1pcQouWoq7tDOTn4nsa0NknZ3H7Fmwo9sNUZGih7dFq6QdPQ1A04BvNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dd82d2709561f01d59c07218125eebcb34284386b0bbf6d852babae13a95cb6","last_reissued_at":"2026-05-18T02:26:31.678393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:31.678393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.0451","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-18T02:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9P56nG8vH/SHkuk1e6hfcAB1DhtWKPiTGc0+jRrqPq4NgKQx8cMAB750EG9IziwY75JKd0wRXbDSJoYH63K6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:13:09.089921Z"},"content_sha256":"55fc298bf8b024f3ab8614ca95781aab6aafd8ec97d753189dce4c1089c0b72e","schema_version":"1.0","event_id":"sha256:55fc298bf8b024f3ab8614ca95781aab6aafd8ec97d753189dce4c1089c0b72e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RXMC2JYJKYPQDVM4A4QYCJPOXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized trapezoidal words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Amy Glen, Florence Lev\\'e","submitted_at":"2014-08-03T03:18:45Z","abstract_excerpt":"The factor complexity function $C_w(n)$ of a finite or infinite word $w$ counts the number of distinct factors of $w$ of length $n$ for each $n \\ge 0$. A finite word $w$ of length $|w|$ is said to be trapezoidal if the graph of its factor complexity $C_w(n)$ as a function of $n$ (for $0 \\leq n \\leq |w|$) is that of a regular trapezoid (or possibly an isosceles triangle); that is, $C_w(n)$ increases by 1 with each $n$ on some interval of length $r$, then $C_w(n)$ is constant on some interval of length $s$, and finally $C_w(n)$ decreases by 1 with each $n$ on an interval of the same length $r$. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0451","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-18T02:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g29eHK2lw8aXGk9Ixp/yhI8h9NDOSAlpLUhUReqoH8T6c9q0khDYN5lxj85AooYZYemfCxSD+jkNgZkdNEDKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:13:09.090602Z"},"content_sha256":"d3eceeb3b654271a010a9ecd3da7ccb6ca2e923134945963ec11c762044e9692","schema_version":"1.0","event_id":"sha256:d3eceeb3b654271a010a9ecd3da7ccb6ca2e923134945963ec11c762044e9692"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXMC2JYJKYPQDVM4A4QYCJPOXS/bundle.json","state_url":"https://pith.science/pith/RXMC2JYJKYPQDVM4A4QYCJPOXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXMC2JYJKYPQDVM4A4QYCJPOXS/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-06T11:13:09Z","links":{"resolver":"https://pith.science/pith/RXMC2JYJKYPQDVM4A4QYCJPOXS","bundle":"https://pith.science/pith/RXMC2JYJKYPQDVM4A4QYCJPOXS/bundle.json","state":"https://pith.science/pith/RXMC2JYJKYPQDVM4A4QYCJPOXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXMC2JYJKYPQDVM4A4QYCJPOXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RXMC2JYJKYPQDVM4A4QYCJPOXS","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":"07094501c1e3402b6c6b08f75edf2fcf82e674f960c00e60010a21447166dd07","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-03T03:18:45Z","title_canon_sha256":"c737429d3c543c604dff99e2364f30c2d7139c98c7247cbe43c52ac34ca7cd1f"},"schema_version":"1.0","source":{"id":"1408.0451","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0451","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0451v2","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0451","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"RXMC2JYJKYPQ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RXMC2JYJKYPQDVM4","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RXMC2JYJ","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:d3eceeb3b654271a010a9ecd3da7ccb6ca2e923134945963ec11c762044e9692","target":"graph","created_at":"2026-05-18T02:26:31Z","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 factor complexity function $C_w(n)$ of a finite or infinite word $w$ counts the number of distinct factors of $w$ of length $n$ for each $n \\ge 0$. A finite word $w$ of length $|w|$ is said to be trapezoidal if the graph of its factor complexity $C_w(n)$ as a function of $n$ (for $0 \\leq n \\leq |w|$) is that of a regular trapezoid (or possibly an isosceles triangle); that is, $C_w(n)$ increases by 1 with each $n$ on some interval of length $r$, then $C_w(n)$ is constant on some interval of length $s$, and finally $C_w(n)$ decreases by 1 with each $n$ on an interval of the same length $r$. ","authors_text":"Amy Glen, Florence Lev\\'e","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-03T03:18:45Z","title":"Generalized trapezoidal words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0451","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:55fc298bf8b024f3ab8614ca95781aab6aafd8ec97d753189dce4c1089c0b72e","target":"record","created_at":"2026-05-18T02:26:31Z","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":"07094501c1e3402b6c6b08f75edf2fcf82e674f960c00e60010a21447166dd07","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-03T03:18:45Z","title_canon_sha256":"c737429d3c543c604dff99e2364f30c2d7139c98c7247cbe43c52ac34ca7cd1f"},"schema_version":"1.0","source":{"id":"1408.0451","kind":"arxiv","version":2}},"canonical_sha256":"8dd82d2709561f01d59c07218125eebcb34284386b0bbf6d852babae13a95cb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dd82d2709561f01d59c07218125eebcb34284386b0bbf6d852babae13a95cb6","first_computed_at":"2026-05-18T02:26:31.678393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:31.678393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JrVAqWOA4NbWYBTYU8Ydkxva6Bflz1pcQouWoq7tDOTn4nsa0NknZ3H7Fmwo9sNUZGih7dFq6QdPQ1A04BvNAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:31.678780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0451","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55fc298bf8b024f3ab8614ca95781aab6aafd8ec97d753189dce4c1089c0b72e","sha256:d3eceeb3b654271a010a9ecd3da7ccb6ca2e923134945963ec11c762044e9692"],"state_sha256":"9cfda192254ca7e70d3012b99a1214854b532d77d36f53ee94705fee1484e9a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gcOo3GlI/HOv34mW1fw+kzE4ZH9esEluu6QSsZlOiC+Hd0l5ZABJm9yv4vQ6ZhmWrp+oz05D+FqqCXXhTVSvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T11:13:09.094680Z","bundle_sha256":"ad03337ef09ea115a9871ef21fcc61d8d4b0a0d43c88de72cc583a21de6c95a4"}}