{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:WFYD7QEPDXY6MQXRK6KBWBOADR","short_pith_number":"pith:WFYD7QEP","schema_version":"1.0","canonical_sha256":"b1703fc08f1df1e642f157941b05c01c7f706809df15a8e90f631782e45056f5","source":{"kind":"arxiv","id":"1008.1668","version":1},"attestation_state":"computed","paper":{"title":"State Complexity of Testing Divisibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Emilie Charlier, Laurent Waxweiler, Michel Rigo, Narad Rampersad","submitted_at":"2010-08-10T08:35:10Z","abstract_excerpt":"Under some mild assumptions, we study the state complexity of the trim minimal automaton accepting the greedy representations of the multiples of m >= 2 for a wide class of linear numeration systems. As an example, the number of states of the trim minimal automaton accepting the greedy representations of the multiples of m in the Fibonacci system is exactly 2m^2."},"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":"1008.1668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-08-10T08:35:10Z","cross_cats_sorted":[],"title_canon_sha256":"8b6ff2a4f84086a1f83f2e5949da310275289ce081827d24d954294595f2d19f","abstract_canon_sha256":"3eccace28b01b809066b23235987d30d60abbd9c4e5858c14c5ebbbba864c94b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:23.526049Z","signature_b64":"e6OZ3LHwgxUEIrrHfvlh0V3XF+Au7+cuf0Kv2zPDMk6kNL3caBaH4fIngUeFXa+2fcRrPTaiRuN3qhpQnjiMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1703fc08f1df1e642f157941b05c01c7f706809df15a8e90f631782e45056f5","last_reissued_at":"2026-05-18T04:42:23.525557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:23.525557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"State Complexity of Testing Divisibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Emilie Charlier, Laurent Waxweiler, Michel Rigo, Narad Rampersad","submitted_at":"2010-08-10T08:35:10Z","abstract_excerpt":"Under some mild assumptions, we study the state complexity of the trim minimal automaton accepting the greedy representations of the multiples of m >= 2 for a wide class of linear numeration systems. As an example, the number of states of the trim minimal automaton accepting the greedy representations of the multiples of m in the Fibonacci system is exactly 2m^2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1668","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":"1008.1668","created_at":"2026-05-18T04:42:23.525642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1668v1","created_at":"2026-05-18T04:42:23.525642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1668","created_at":"2026-05-18T04:42:23.525642+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFYD7QEPDXY6","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFYD7QEPDXY6MQXR","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFYD7QEP","created_at":"2026-05-18T12:26:15.391820+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/WFYD7QEPDXY6MQXRK6KBWBOADR","json":"https://pith.science/pith/WFYD7QEPDXY6MQXRK6KBWBOADR.json","graph_json":"https://pith.science/api/pith-number/WFYD7QEPDXY6MQXRK6KBWBOADR/graph.json","events_json":"https://pith.science/api/pith-number/WFYD7QEPDXY6MQXRK6KBWBOADR/events.json","paper":"https://pith.science/paper/WFYD7QEP"},"agent_actions":{"view_html":"https://pith.science/pith/WFYD7QEPDXY6MQXRK6KBWBOADR","download_json":"https://pith.science/pith/WFYD7QEPDXY6MQXRK6KBWBOADR.json","view_paper":"https://pith.science/paper/WFYD7QEP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1668&json=true","fetch_graph":"https://pith.science/api/pith-number/WFYD7QEPDXY6MQXRK6KBWBOADR/graph.json","fetch_events":"https://pith.science/api/pith-number/WFYD7QEPDXY6MQXRK6KBWBOADR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFYD7QEPDXY6MQXRK6KBWBOADR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFYD7QEPDXY6MQXRK6KBWBOADR/action/storage_attestation","attest_author":"https://pith.science/pith/WFYD7QEPDXY6MQXRK6KBWBOADR/action/author_attestation","sign_citation":"https://pith.science/pith/WFYD7QEPDXY6MQXRK6KBWBOADR/action/citation_signature","submit_replication":"https://pith.science/pith/WFYD7QEPDXY6MQXRK6KBWBOADR/action/replication_record"}},"created_at":"2026-05-18T04:42:23.525642+00:00","updated_at":"2026-05-18T04:42:23.525642+00:00"}