{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PEPREY5VBPEVVSHYNKKG7KDGVW","short_pith_number":"pith:PEPREY5V","schema_version":"1.0","canonical_sha256":"791f1263b50bc95ac8f86a946fa866ada65e48481423f79625038054b9142e8c","source":{"kind":"arxiv","id":"1908.03890","version":1},"attestation_state":"computed","paper":{"title":"A Robust Class of Linear Recurrence Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Corentin Barloy, Filip Mazowiecki, Nathana\\\"el Fijalkow, Nathan Lhote","submitted_at":"2019-08-11T12:02:36Z","abstract_excerpt":"We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several characterisations: polynomially ambiguous weighted automata, copyless cost-register automata, rational formal series, and linear recurrence sequences whose eigenvalues are roots of rational numbers."},"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":"1908.03890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-08-11T12:02:36Z","cross_cats_sorted":[],"title_canon_sha256":"6ddaff0ce26e04c0cbdcc4753a6c01406447d043b6bc3a3620a1de1e7e464267","abstract_canon_sha256":"d860dc1dc27bb612551e23bc5e0b878a16fe7b979fb5461a2fcbef3e70654b04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:53:19.178978Z","signature_b64":"8i4TlV6wDPdce2kEf1SrYbBy2Hv3zCxnPWY+j0idTh0osO+ktKSYA0rOSxON032Wpwx1oIPydxR84HiZcXoOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"791f1263b50bc95ac8f86a946fa866ada65e48481423f79625038054b9142e8c","last_reissued_at":"2026-07-04T23:53:19.178632Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:53:19.178632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Robust Class of Linear Recurrence Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Corentin Barloy, Filip Mazowiecki, Nathana\\\"el Fijalkow, Nathan Lhote","submitted_at":"2019-08-11T12:02:36Z","abstract_excerpt":"We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several characterisations: polynomially ambiguous weighted automata, copyless cost-register automata, rational formal series, and linear recurrence sequences whose eigenvalues are roots of rational numbers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03890","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03890/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.03890","created_at":"2026-07-04T23:53:19.178688+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03890v1","created_at":"2026-07-04T23:53:19.178688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03890","created_at":"2026-07-04T23:53:19.178688+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEPREY5VBPEV","created_at":"2026-07-04T23:53:19.178688+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEPREY5VBPEVVSHY","created_at":"2026-07-04T23:53:19.178688+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEPREY5V","created_at":"2026-07-04T23:53:19.178688+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/PEPREY5VBPEVVSHYNKKG7KDGVW","json":"https://pith.science/pith/PEPREY5VBPEVVSHYNKKG7KDGVW.json","graph_json":"https://pith.science/api/pith-number/PEPREY5VBPEVVSHYNKKG7KDGVW/graph.json","events_json":"https://pith.science/api/pith-number/PEPREY5VBPEVVSHYNKKG7KDGVW/events.json","paper":"https://pith.science/paper/PEPREY5V"},"agent_actions":{"view_html":"https://pith.science/pith/PEPREY5VBPEVVSHYNKKG7KDGVW","download_json":"https://pith.science/pith/PEPREY5VBPEVVSHYNKKG7KDGVW.json","view_paper":"https://pith.science/paper/PEPREY5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03890&json=true","fetch_graph":"https://pith.science/api/pith-number/PEPREY5VBPEVVSHYNKKG7KDGVW/graph.json","fetch_events":"https://pith.science/api/pith-number/PEPREY5VBPEVVSHYNKKG7KDGVW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEPREY5VBPEVVSHYNKKG7KDGVW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEPREY5VBPEVVSHYNKKG7KDGVW/action/storage_attestation","attest_author":"https://pith.science/pith/PEPREY5VBPEVVSHYNKKG7KDGVW/action/author_attestation","sign_citation":"https://pith.science/pith/PEPREY5VBPEVVSHYNKKG7KDGVW/action/citation_signature","submit_replication":"https://pith.science/pith/PEPREY5VBPEVVSHYNKKG7KDGVW/action/replication_record"}},"created_at":"2026-07-04T23:53:19.178688+00:00","updated_at":"2026-07-04T23:53:19.178688+00:00"}