{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7Y7V2CDPCD2AWPBH65QV4RTNVQ","short_pith_number":"pith:7Y7V2CDP","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"},"canonical_sha256":"fe3f5d086f10f40b3c27f7615e466dac2995958c670c2892cbd135270b0ae977","source":{"kind":"arxiv","id":"1310.8635","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.8635","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"arxiv_version","alias_value":"1310.8635v2","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8635","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"pith_short_12","alias_value":"7Y7V2CDPCD2A","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7Y7V2CDPCD2AWPBH","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7Y7V2CDP","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7Y7V2CDPCD2AWPBH65QV4RTNVQ","target":"record","payload":{"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"},"canonical_sha256":"fe3f5d086f10f40b3c27f7615e466dac2995958c670c2892cbd135270b0ae977","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"},"source_kind":"arxiv","source_id":"1310.8635","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PfA1u355xo+nRZYzM8kHyLOG9Vh9Dzo+WlSCBJzU/IxBH1k7qjwxe2HMbvnOm/qi1Tn9H9O9EJzW8zamb6pLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:55:02.045956Z"},"content_sha256":"16e773c992a3ab8751b2763a1d0cb1d1cc7ccd9bccaed99b986e8a9cd995a496","schema_version":"1.0","event_id":"sha256:16e773c992a3ab8751b2763a1d0cb1d1cc7ccd9bccaed99b986e8a9cd995a496"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7Y7V2CDPCD2AWPBH65QV4RTNVQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w7WNxk2FSpjNRfce7F5dyK3Ep2SsBynGpgrzNe8woET8Ayox8w2dZ0hoMfP7VCOE/MujE9/KXJz2HcS5/HWgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:55:02.046757Z"},"content_sha256":"16510e125962a9131274c690da67091f029b8c57c751bcc89fd4cc0774af5f16","schema_version":"1.0","event_id":"sha256:16510e125962a9131274c690da67091f029b8c57c751bcc89fd4cc0774af5f16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7Y7V2CDPCD2AWPBH65QV4RTNVQ/bundle.json","state_url":"https://pith.science/pith/7Y7V2CDPCD2AWPBH65QV4RTNVQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7Y7V2CDPCD2AWPBH65QV4RTNVQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T16:55:02Z","links":{"resolver":"https://pith.science/pith/7Y7V2CDPCD2AWPBH65QV4RTNVQ","bundle":"https://pith.science/pith/7Y7V2CDPCD2AWPBH65QV4RTNVQ/bundle.json","state":"https://pith.science/pith/7Y7V2CDPCD2AWPBH65QV4RTNVQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7Y7V2CDPCD2AWPBH65QV4RTNVQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7Y7V2CDPCD2AWPBH65QV4RTNVQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"40cc7d2b5d6b60efd92927ac4a4e47d0d41afb96278add5e2a4522baf2a125d8","cross_cats_sorted":["cs.SC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-31T18:47:07Z","title_canon_sha256":"6dedb6499a4ce41cc3e476a6474aec58adb21536208860ca40125312f9098dd9"},"schema_version":"1.0","source":{"id":"1310.8635","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.8635","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"arxiv_version","alias_value":"1310.8635v2","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8635","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"pith_short_12","alias_value":"7Y7V2CDPCD2A","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7Y7V2CDPCD2AWPBH","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7Y7V2CDP","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:16510e125962a9131274c690da67091f029b8c57c751bcc89fd4cc0774af5f16","target":"graph","created_at":"2026-05-18T01:17:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Eric Rowland, Reem Yassawi","cross_cats":["cs.SC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-31T18:47:07Z","title":"Automatic congruences for diagonals of rational functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.8635","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:16e773c992a3ab8751b2763a1d0cb1d1cc7ccd9bccaed99b986e8a9cd995a496","target":"record","created_at":"2026-05-18T01:17:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"40cc7d2b5d6b60efd92927ac4a4e47d0d41afb96278add5e2a4522baf2a125d8","cross_cats_sorted":["cs.SC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-31T18:47:07Z","title_canon_sha256":"6dedb6499a4ce41cc3e476a6474aec58adb21536208860ca40125312f9098dd9"},"schema_version":"1.0","source":{"id":"1310.8635","kind":"arxiv","version":2}},"canonical_sha256":"fe3f5d086f10f40b3c27f7615e466dac2995958c670c2892cbd135270b0ae977","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe3f5d086f10f40b3c27f7615e466dac2995958c670c2892cbd135270b0ae977","first_computed_at":"2026-05-18T01:17:26.209858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:26.209858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NeCbyJs9UBkleHfGuEHZFP69fwKD9Ea5w6mYikRG7MKwnlZadMc/MUdtHfTSnD9CU2J1O5JvvcAOuqm9n8daDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:26.210282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.8635","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16e773c992a3ab8751b2763a1d0cb1d1cc7ccd9bccaed99b986e8a9cd995a496","sha256:16510e125962a9131274c690da67091f029b8c57c751bcc89fd4cc0774af5f16"],"state_sha256":"7533939bdf8421dec565807e8c19c7f62cb0aeafee788bdfc334a7be2a7d9999"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PoW2femAKpy9joxo3c8gcOUOQq6S5Xzq+neYSzi+rAYbTxaaCh86YaFYelMSf2veFRInWjujvkpBTDSsP1rGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:55:02.051131Z","bundle_sha256":"b8c62e4c31f668c7f966cbefc6a7b7ee47057a4e1652d0923c86c5aa675de0d4"}}