{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PI52AX5MVBALBB3Q5U3XD5WPWS","short_pith_number":"pith:PI52AX5M","schema_version":"1.0","canonical_sha256":"7a3ba05faca840b08770ed3771f6cfb495fd5b977faadc483495a2aea7dd7907","source":{"kind":"arxiv","id":"1103.3258","version":1},"attestation_state":"computed","paper":{"title":"A q-analog of Ljunggren's binomial congruence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Armin Straub","submitted_at":"2011-03-16T19:04:29Z","abstract_excerpt":"We prove a $q$-analog of a classical binomial congruence due to Ljunggren which states that \\[ \\binom{a p}{b p} \\equiv \\binom{a}{b} \\] modulo $p^3$ for primes $p\\ge5$. This congruence subsumes and builds on earlier congruences by Babbage, Wolstenholme and Glaisher for which we recall existing $q$-analogs. Our congruence generalizes an earlier result of Clark."},"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":"1103.3258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-03-16T19:04:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"72771ac64849f7f19317af49669e30985e940224d8d8d585e4feabd7dc6c84cf","abstract_canon_sha256":"86cfc68d85ec5f7f78557ecee72768cde48175dc0fe35cfc41b220a5e25632ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:44.492017Z","signature_b64":"5+n2POd+6uoh3osEAszNnWDxdgN3PDFzkq3kOWYHNcWNMd4af7EWUaBA3GzgxTrjaARlTD/SK3TxVVfwo/89Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a3ba05faca840b08770ed3771f6cfb495fd5b977faadc483495a2aea7dd7907","last_reissued_at":"2026-05-18T04:26:44.491334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:44.491334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A q-analog of Ljunggren's binomial congruence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Armin Straub","submitted_at":"2011-03-16T19:04:29Z","abstract_excerpt":"We prove a $q$-analog of a classical binomial congruence due to Ljunggren which states that \\[ \\binom{a p}{b p} \\equiv \\binom{a}{b} \\] modulo $p^3$ for primes $p\\ge5$. This congruence subsumes and builds on earlier congruences by Babbage, Wolstenholme and Glaisher for which we recall existing $q$-analogs. Our congruence generalizes an earlier result of Clark."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3258","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":"1103.3258","created_at":"2026-05-18T04:26:44.491456+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.3258v1","created_at":"2026-05-18T04:26:44.491456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3258","created_at":"2026-05-18T04:26:44.491456+00:00"},{"alias_kind":"pith_short_12","alias_value":"PI52AX5MVBAL","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PI52AX5MVBALBB3Q","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PI52AX5M","created_at":"2026-05-18T12:26:39.201973+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/PI52AX5MVBALBB3Q5U3XD5WPWS","json":"https://pith.science/pith/PI52AX5MVBALBB3Q5U3XD5WPWS.json","graph_json":"https://pith.science/api/pith-number/PI52AX5MVBALBB3Q5U3XD5WPWS/graph.json","events_json":"https://pith.science/api/pith-number/PI52AX5MVBALBB3Q5U3XD5WPWS/events.json","paper":"https://pith.science/paper/PI52AX5M"},"agent_actions":{"view_html":"https://pith.science/pith/PI52AX5MVBALBB3Q5U3XD5WPWS","download_json":"https://pith.science/pith/PI52AX5MVBALBB3Q5U3XD5WPWS.json","view_paper":"https://pith.science/paper/PI52AX5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.3258&json=true","fetch_graph":"https://pith.science/api/pith-number/PI52AX5MVBALBB3Q5U3XD5WPWS/graph.json","fetch_events":"https://pith.science/api/pith-number/PI52AX5MVBALBB3Q5U3XD5WPWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PI52AX5MVBALBB3Q5U3XD5WPWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PI52AX5MVBALBB3Q5U3XD5WPWS/action/storage_attestation","attest_author":"https://pith.science/pith/PI52AX5MVBALBB3Q5U3XD5WPWS/action/author_attestation","sign_citation":"https://pith.science/pith/PI52AX5MVBALBB3Q5U3XD5WPWS/action/citation_signature","submit_replication":"https://pith.science/pith/PI52AX5MVBALBB3Q5U3XD5WPWS/action/replication_record"}},"created_at":"2026-05-18T04:26:44.491456+00:00","updated_at":"2026-05-18T04:26:44.491456+00:00"}