{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:V2CGYKATJXGHTQ66LLBZF6KOFU","short_pith_number":"pith:V2CGYKAT","schema_version":"1.0","canonical_sha256":"ae846c28134dcc79c3de5ac392f94e2d017b9b3ccab1754238badb2dfacf9c09","source":{"kind":"arxiv","id":"1012.1756","version":2},"attestation_state":"computed","paper":{"title":"The odd Catalan numbers modulo 2^k","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Hsueh-Yung Lin","submitted_at":"2010-12-08T13:12:45Z","abstract_excerpt":"We study the properties of the odd Catalan numbers, C_n, modulo 2^k for k >= 2. We show that there exist only k - 1 different congruences of the odd Catalan numbers modulo 2^k. Moreover, these congruences can be obtained by C_{2^m - 1} (mod 2^k) for m = 1, 2, ..., k - 1."},"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":"1012.1756","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-12-08T13:12:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4f1ffc8f32288d025873662d1de9cfd42cff5c502e429b5db1ababafc705612d","abstract_canon_sha256":"a3f5006ee77dad63900d592adc6d9286d3a17ff5b9dacbda24c9e419a988bcc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:50.993000Z","signature_b64":"x+W+CgLnJxqlW2huSe8wTpVkZZc5oXNt1FnNopiQcVykIAD5FxvfoLj5P00bM18x0IKY5haSKOSwN1DGkbfHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae846c28134dcc79c3de5ac392f94e2d017b9b3ccab1754238badb2dfacf9c09","last_reissued_at":"2026-05-18T04:31:50.992577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:50.992577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The odd Catalan numbers modulo 2^k","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Hsueh-Yung Lin","submitted_at":"2010-12-08T13:12:45Z","abstract_excerpt":"We study the properties of the odd Catalan numbers, C_n, modulo 2^k for k >= 2. We show that there exist only k - 1 different congruences of the odd Catalan numbers modulo 2^k. Moreover, these congruences can be obtained by C_{2^m - 1} (mod 2^k) for m = 1, 2, ..., k - 1."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1756","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":"1012.1756","created_at":"2026-05-18T04:31:50.992647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1756v2","created_at":"2026-05-18T04:31:50.992647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1756","created_at":"2026-05-18T04:31:50.992647+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2CGYKATJXGH","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2CGYKATJXGHTQ66","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2CGYKAT","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/V2CGYKATJXGHTQ66LLBZF6KOFU","json":"https://pith.science/pith/V2CGYKATJXGHTQ66LLBZF6KOFU.json","graph_json":"https://pith.science/api/pith-number/V2CGYKATJXGHTQ66LLBZF6KOFU/graph.json","events_json":"https://pith.science/api/pith-number/V2CGYKATJXGHTQ66LLBZF6KOFU/events.json","paper":"https://pith.science/paper/V2CGYKAT"},"agent_actions":{"view_html":"https://pith.science/pith/V2CGYKATJXGHTQ66LLBZF6KOFU","download_json":"https://pith.science/pith/V2CGYKATJXGHTQ66LLBZF6KOFU.json","view_paper":"https://pith.science/paper/V2CGYKAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1756&json=true","fetch_graph":"https://pith.science/api/pith-number/V2CGYKATJXGHTQ66LLBZF6KOFU/graph.json","fetch_events":"https://pith.science/api/pith-number/V2CGYKATJXGHTQ66LLBZF6KOFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2CGYKATJXGHTQ66LLBZF6KOFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2CGYKATJXGHTQ66LLBZF6KOFU/action/storage_attestation","attest_author":"https://pith.science/pith/V2CGYKATJXGHTQ66LLBZF6KOFU/action/author_attestation","sign_citation":"https://pith.science/pith/V2CGYKATJXGHTQ66LLBZF6KOFU/action/citation_signature","submit_replication":"https://pith.science/pith/V2CGYKATJXGHTQ66LLBZF6KOFU/action/replication_record"}},"created_at":"2026-05-18T04:31:50.992647+00:00","updated_at":"2026-05-18T04:31:50.992647+00:00"}