{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:BEERBA5DQ4IY7ZPW3QPSPWBHB6","short_pith_number":"pith:BEERBA5D","schema_version":"1.0","canonical_sha256":"09091083a387118fe5f6dc1f27d8270fb79a927c409ce1bdf69bed6d27a8483e","source":{"kind":"arxiv","id":"0902.0632","version":2},"attestation_state":"computed","paper":{"title":"A Note on Symmetries in the Rauzy Graph and Factor Frequencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"E. Pelantova, L. Balkova","submitted_at":"2009-02-03T22:10:12Z","abstract_excerpt":"We focus on infinite words with languages closed under reversal. If frequencies of all factors are well defined, we show that the number of different frequencies of factors of length n+1 does not exceed 2C(n+1)-2C(n)+1."},"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":"0902.0632","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-02-03T22:10:12Z","cross_cats_sorted":[],"title_canon_sha256":"0c5eec4f220df7e22fc6f94e283d130414875d05c5d7773495f29f923f1a9b38","abstract_canon_sha256":"4eda662dad60e41bb5df7baa8b495cae62f761d3a8bb46931b834f8b7b621cef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:12.493036Z","signature_b64":"pG2uUMO2Ey0KqX9+4V7sZzcbP/yfwRq6Wq46qOUjIsIcFZCufF/pvZILYHAaE+BXEtTqIgPAmeAgGl/fXznaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09091083a387118fe5f6dc1f27d8270fb79a927c409ce1bdf69bed6d27a8483e","last_reissued_at":"2026-05-18T03:34:12.492528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:12.492528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Symmetries in the Rauzy Graph and Factor Frequencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"E. Pelantova, L. Balkova","submitted_at":"2009-02-03T22:10:12Z","abstract_excerpt":"We focus on infinite words with languages closed under reversal. If frequencies of all factors are well defined, we show that the number of different frequencies of factors of length n+1 does not exceed 2C(n+1)-2C(n)+1."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.0632","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0902.0632","created_at":"2026-05-18T03:34:12.492592+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.0632v2","created_at":"2026-05-18T03:34:12.492592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.0632","created_at":"2026-05-18T03:34:12.492592+00:00"},{"alias_kind":"pith_short_12","alias_value":"BEERBA5DQ4IY","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"BEERBA5DQ4IY7ZPW","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"BEERBA5D","created_at":"2026-05-18T12:25:58.837520+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/BEERBA5DQ4IY7ZPW3QPSPWBHB6","json":"https://pith.science/pith/BEERBA5DQ4IY7ZPW3QPSPWBHB6.json","graph_json":"https://pith.science/api/pith-number/BEERBA5DQ4IY7ZPW3QPSPWBHB6/graph.json","events_json":"https://pith.science/api/pith-number/BEERBA5DQ4IY7ZPW3QPSPWBHB6/events.json","paper":"https://pith.science/paper/BEERBA5D"},"agent_actions":{"view_html":"https://pith.science/pith/BEERBA5DQ4IY7ZPW3QPSPWBHB6","download_json":"https://pith.science/pith/BEERBA5DQ4IY7ZPW3QPSPWBHB6.json","view_paper":"https://pith.science/paper/BEERBA5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.0632&json=true","fetch_graph":"https://pith.science/api/pith-number/BEERBA5DQ4IY7ZPW3QPSPWBHB6/graph.json","fetch_events":"https://pith.science/api/pith-number/BEERBA5DQ4IY7ZPW3QPSPWBHB6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BEERBA5DQ4IY7ZPW3QPSPWBHB6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BEERBA5DQ4IY7ZPW3QPSPWBHB6/action/storage_attestation","attest_author":"https://pith.science/pith/BEERBA5DQ4IY7ZPW3QPSPWBHB6/action/author_attestation","sign_citation":"https://pith.science/pith/BEERBA5DQ4IY7ZPW3QPSPWBHB6/action/citation_signature","submit_replication":"https://pith.science/pith/BEERBA5DQ4IY7ZPW3QPSPWBHB6/action/replication_record"}},"created_at":"2026-05-18T03:34:12.492592+00:00","updated_at":"2026-05-18T03:34:12.492592+00:00"}