{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:PCAMFPNWLP7YKW4MSIN2C76TXM","short_pith_number":"pith:PCAMFPNW","schema_version":"1.0","canonical_sha256":"7880c2bdb65bff855b8c921ba17fd3bb2a2e6f6c511c449119860e9c0fb5c685","source":{"kind":"arxiv","id":"math/0611508","version":1},"attestation_state":"computed","paper":{"title":"Palindromic complexity of infinite words associated with non-simple Parry numbers","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"L'ubom\\'ira Balkov\\'a, Zuzana Mas\\'akov\\'a","submitted_at":"2006-11-16T17:05:07Z","abstract_excerpt":"We study the palindromic complexity of infinite words $u_\\beta$, the fixed points of the substitution over a binary alphabet, $\\phi(0)=0^a1$, $\\phi(1)=0^b1$, with $a-1\\geq b\\geq 1$, which are canonically associated with quadratic non-simple Parry numbers $\\beta$."},"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":"math/0611508","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2006-11-16T17:05:07Z","cross_cats_sorted":[],"title_canon_sha256":"3b1979fc4d678f9b525f45c86730f1eebf6a5e0c92c165cc5fb8c8d0f8f9403b","abstract_canon_sha256":"ebb285dfe618206b5453c264ff73609730818362215bd2904b2b6c93a5b8ef2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:49.474860Z","signature_b64":"MqEYJCliJZ3Mk12bkD46icUoIq1D/1PwVDamK3xct/12EJSU/0Xh4rmbNsBWNaXH0x7AhZhfqZgPgpTL/2mFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7880c2bdb65bff855b8c921ba17fd3bb2a2e6f6c511c449119860e9c0fb5c685","last_reissued_at":"2026-05-18T01:08:49.474143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:49.474143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Palindromic complexity of infinite words associated with non-simple Parry numbers","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"L'ubom\\'ira Balkov\\'a, Zuzana Mas\\'akov\\'a","submitted_at":"2006-11-16T17:05:07Z","abstract_excerpt":"We study the palindromic complexity of infinite words $u_\\beta$, the fixed points of the substitution over a binary alphabet, $\\phi(0)=0^a1$, $\\phi(1)=0^b1$, with $a-1\\geq b\\geq 1$, which are canonically associated with quadratic non-simple Parry numbers $\\beta$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0611508","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0611508","created_at":"2026-05-18T01:08:49.474250+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0611508v1","created_at":"2026-05-18T01:08:49.474250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0611508","created_at":"2026-05-18T01:08:49.474250+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCAMFPNWLP7Y","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCAMFPNWLP7YKW4M","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCAMFPNW","created_at":"2026-05-18T12:25:54.717736+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/PCAMFPNWLP7YKW4MSIN2C76TXM","json":"https://pith.science/pith/PCAMFPNWLP7YKW4MSIN2C76TXM.json","graph_json":"https://pith.science/api/pith-number/PCAMFPNWLP7YKW4MSIN2C76TXM/graph.json","events_json":"https://pith.science/api/pith-number/PCAMFPNWLP7YKW4MSIN2C76TXM/events.json","paper":"https://pith.science/paper/PCAMFPNW"},"agent_actions":{"view_html":"https://pith.science/pith/PCAMFPNWLP7YKW4MSIN2C76TXM","download_json":"https://pith.science/pith/PCAMFPNWLP7YKW4MSIN2C76TXM.json","view_paper":"https://pith.science/paper/PCAMFPNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0611508&json=true","fetch_graph":"https://pith.science/api/pith-number/PCAMFPNWLP7YKW4MSIN2C76TXM/graph.json","fetch_events":"https://pith.science/api/pith-number/PCAMFPNWLP7YKW4MSIN2C76TXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCAMFPNWLP7YKW4MSIN2C76TXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCAMFPNWLP7YKW4MSIN2C76TXM/action/storage_attestation","attest_author":"https://pith.science/pith/PCAMFPNWLP7YKW4MSIN2C76TXM/action/author_attestation","sign_citation":"https://pith.science/pith/PCAMFPNWLP7YKW4MSIN2C76TXM/action/citation_signature","submit_replication":"https://pith.science/pith/PCAMFPNWLP7YKW4MSIN2C76TXM/action/replication_record"}},"created_at":"2026-05-18T01:08:49.474250+00:00","updated_at":"2026-05-18T01:08:49.474250+00:00"}