{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HSFHJMSM7MATIGNFUPGZAVTJXN","short_pith_number":"pith:HSFHJMSM","schema_version":"1.0","canonical_sha256":"3c8a74b24cfb013419a5a3cd905669bb4246f9a4691968d43ce1b93d903b0029","source":{"kind":"arxiv","id":"1808.03487","version":1},"attestation_state":"computed","paper":{"title":"Arithmetic properties of cubic and overcubic partition pairs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Chiranjit Ray, Rupam Barman","submitted_at":"2018-08-10T11:14:10Z","abstract_excerpt":"Let $b(n)$ denote the number of cubic partition pairs of $n$. We give affirmative answer to a conjecture of Lin, namely, we prove that $$b(49n+37)\\equiv 0 \\pmod{49}.$$ We also prove two congruences modulo $256$ satisfied by $\\overline{b}(n)$, the number of overcubic partition pairs of $n$. Let $\\overline{a}(n)$ denote the number of overcubic partition of $n$. For a fixed positive integer $k$, we further show that $\\overline{b}(n)$ and $\\overline{a}(n)$ are divisible by $2^k$ for almost all $n$. We use arithmetic properties of modular forms to prove our results."},"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":"1808.03487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-08-10T11:14:10Z","cross_cats_sorted":[],"title_canon_sha256":"7b9fae320e28e84549400630eed279a3d7696298300cdd991fa2afead20de51a","abstract_canon_sha256":"385881c50ec47c35cfbc1efff33526f6aa35f73c2053c47d69b6513b2e6f042b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:24.884604Z","signature_b64":"yt3eh6FWA6kUDmU+hRFiU7wXeHWJJ+vscp1/wY5aHxXGYjtybhorX3ES8aIYxi70U3b4ukHS+ntybhvGAKtYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c8a74b24cfb013419a5a3cd905669bb4246f9a4691968d43ce1b93d903b0029","last_reissued_at":"2026-05-18T00:08:24.884010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:24.884010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arithmetic properties of cubic and overcubic partition pairs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Chiranjit Ray, Rupam Barman","submitted_at":"2018-08-10T11:14:10Z","abstract_excerpt":"Let $b(n)$ denote the number of cubic partition pairs of $n$. We give affirmative answer to a conjecture of Lin, namely, we prove that $$b(49n+37)\\equiv 0 \\pmod{49}.$$ We also prove two congruences modulo $256$ satisfied by $\\overline{b}(n)$, the number of overcubic partition pairs of $n$. Let $\\overline{a}(n)$ denote the number of overcubic partition of $n$. For a fixed positive integer $k$, we further show that $\\overline{b}(n)$ and $\\overline{a}(n)$ are divisible by $2^k$ for almost all $n$. We use arithmetic properties of modular forms to prove our results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03487","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":"1808.03487","created_at":"2026-05-18T00:08:24.884099+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03487v1","created_at":"2026-05-18T00:08:24.884099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03487","created_at":"2026-05-18T00:08:24.884099+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSFHJMSM7MAT","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSFHJMSM7MATIGNF","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSFHJMSM","created_at":"2026-05-18T12:32:28.185984+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/HSFHJMSM7MATIGNFUPGZAVTJXN","json":"https://pith.science/pith/HSFHJMSM7MATIGNFUPGZAVTJXN.json","graph_json":"https://pith.science/api/pith-number/HSFHJMSM7MATIGNFUPGZAVTJXN/graph.json","events_json":"https://pith.science/api/pith-number/HSFHJMSM7MATIGNFUPGZAVTJXN/events.json","paper":"https://pith.science/paper/HSFHJMSM"},"agent_actions":{"view_html":"https://pith.science/pith/HSFHJMSM7MATIGNFUPGZAVTJXN","download_json":"https://pith.science/pith/HSFHJMSM7MATIGNFUPGZAVTJXN.json","view_paper":"https://pith.science/paper/HSFHJMSM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03487&json=true","fetch_graph":"https://pith.science/api/pith-number/HSFHJMSM7MATIGNFUPGZAVTJXN/graph.json","fetch_events":"https://pith.science/api/pith-number/HSFHJMSM7MATIGNFUPGZAVTJXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSFHJMSM7MATIGNFUPGZAVTJXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSFHJMSM7MATIGNFUPGZAVTJXN/action/storage_attestation","attest_author":"https://pith.science/pith/HSFHJMSM7MATIGNFUPGZAVTJXN/action/author_attestation","sign_citation":"https://pith.science/pith/HSFHJMSM7MATIGNFUPGZAVTJXN/action/citation_signature","submit_replication":"https://pith.science/pith/HSFHJMSM7MATIGNFUPGZAVTJXN/action/replication_record"}},"created_at":"2026-05-18T00:08:24.884099+00:00","updated_at":"2026-05-18T00:08:24.884099+00:00"}