{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7Y7V2CDPCD2AWPBH65QV4RTNVQ","short_pith_number":"pith:7Y7V2CDP","schema_version":"1.0","canonical_sha256":"fe3f5d086f10f40b3c27f7615e466dac2995958c670c2892cbd135270b0ae977","source":{"kind":"arxiv","id":"1310.8635","version":2},"attestation_state":"computed","paper":{"title":"Automatic congruences for diagonals of rational functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.CO"],"primary_cat":"math.NT","authors_text":"Eric Rowland, Reem Yassawi","submitted_at":"2013-10-31T18:47:07Z","abstract_excerpt":"In this paper we use the framework of automatic sequences to study combinatorial sequences modulo prime powers. Given a sequence whose generating function is the diagonal of a rational power series, we provide a method, based on work of Denef and Lipshitz, for computing a finite automaton for the sequence modulo $p^\\alpha$, for all but finitely many primes $p$. This method gives completely automatic proofs of known results, establishes a number of new theorems for well-known sequences, and allows us to resolve some conjectures regarding the Ap\\'ery numbers. We also give a second method, which "},"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":"1310.8635","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-31T18:47:07Z","cross_cats_sorted":["cs.SC","math.CO"],"title_canon_sha256":"6dedb6499a4ce41cc3e476a6474aec58adb21536208860ca40125312f9098dd9","abstract_canon_sha256":"40cc7d2b5d6b60efd92927ac4a4e47d0d41afb96278add5e2a4522baf2a125d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:26.210282Z","signature_b64":"NeCbyJs9UBkleHfGuEHZFP69fwKD9Ea5w6mYikRG7MKwnlZadMc/MUdtHfTSnD9CU2J1O5JvvcAOuqm9n8daDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe3f5d086f10f40b3c27f7615e466dac2995958c670c2892cbd135270b0ae977","last_reissued_at":"2026-05-18T01:17:26.209858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:26.209858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic congruences for diagonals of rational functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.CO"],"primary_cat":"math.NT","authors_text":"Eric Rowland, Reem Yassawi","submitted_at":"2013-10-31T18:47:07Z","abstract_excerpt":"In this paper we use the framework of automatic sequences to study combinatorial sequences modulo prime powers. Given a sequence whose generating function is the diagonal of a rational power series, we provide a method, based on work of Denef and Lipshitz, for computing a finite automaton for the sequence modulo $p^\\alpha$, for all but finitely many primes $p$. This method gives completely automatic proofs of known results, establishes a number of new theorems for well-known sequences, and allows us to resolve some conjectures regarding the Ap\\'ery numbers. We also give a second method, which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.8635","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":"1310.8635","created_at":"2026-05-18T01:17:26.209923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.8635v2","created_at":"2026-05-18T01:17:26.209923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8635","created_at":"2026-05-18T01:17:26.209923+00:00"},{"alias_kind":"pith_short_12","alias_value":"7Y7V2CDPCD2A","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"7Y7V2CDPCD2AWPBH","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"7Y7V2CDP","created_at":"2026-05-18T12:27:38.830355+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/7Y7V2CDPCD2AWPBH65QV4RTNVQ","json":"https://pith.science/pith/7Y7V2CDPCD2AWPBH65QV4RTNVQ.json","graph_json":"https://pith.science/api/pith-number/7Y7V2CDPCD2AWPBH65QV4RTNVQ/graph.json","events_json":"https://pith.science/api/pith-number/7Y7V2CDPCD2AWPBH65QV4RTNVQ/events.json","paper":"https://pith.science/paper/7Y7V2CDP"},"agent_actions":{"view_html":"https://pith.science/pith/7Y7V2CDPCD2AWPBH65QV4RTNVQ","download_json":"https://pith.science/pith/7Y7V2CDPCD2AWPBH65QV4RTNVQ.json","view_paper":"https://pith.science/paper/7Y7V2CDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.8635&json=true","fetch_graph":"https://pith.science/api/pith-number/7Y7V2CDPCD2AWPBH65QV4RTNVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7Y7V2CDPCD2AWPBH65QV4RTNVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7Y7V2CDPCD2AWPBH65QV4RTNVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7Y7V2CDPCD2AWPBH65QV4RTNVQ/action/storage_attestation","attest_author":"https://pith.science/pith/7Y7V2CDPCD2AWPBH65QV4RTNVQ/action/author_attestation","sign_citation":"https://pith.science/pith/7Y7V2CDPCD2AWPBH65QV4RTNVQ/action/citation_signature","submit_replication":"https://pith.science/pith/7Y7V2CDPCD2AWPBH65QV4RTNVQ/action/replication_record"}},"created_at":"2026-05-18T01:17:26.209923+00:00","updated_at":"2026-05-18T01:17:26.209923+00:00"}