{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZVL6SRYZYAPFIHQTMZCDS6RJ6J","short_pith_number":"pith:ZVL6SRYZ","schema_version":"1.0","canonical_sha256":"cd57e94719c01e541e136644397a29f252eb14f36af4d9fab3d850895a07906e","source":{"kind":"arxiv","id":"1610.02063","version":1},"attestation_state":"computed","paper":{"title":"Bisecting binomial coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eugen J. Ionascu, Pantelimon Stanica, Thor Martinsen","submitted_at":"2016-10-06T20:54:53Z","abstract_excerpt":"In this paper, we deal with the problem of bisecting binomial coefficients. We find many (previously unknown) infinite classes of integers which admit nontrivial bisections, and a class with only trivial bisections. As a byproduct of this last construction, we show conjectures Q2 and Q4 of Cusick and Li. We next find several bounds for the number of nontrivial bisections and further compute (using a supercomputer) the exact number of such bisections for n <= 51."},"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":"1610.02063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-06T20:54:53Z","cross_cats_sorted":[],"title_canon_sha256":"46bfd308b993087bc1c4e9c84a02240e93df229c551fce1433a10381074e6a46","abstract_canon_sha256":"0edb7c5de80596d1d80be79d07612464e1410e9524b68225696e8acf3a0c3ed3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:58.485843Z","signature_b64":"ZTAJGHtF4rOS1QyFL6H6XQtqzUY/GbH3HWHXPhf3IG9+DB7cGw8kOs4tzshMP/q4bqsqfhUTU2Puh4TJAgudDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd57e94719c01e541e136644397a29f252eb14f36af4d9fab3d850895a07906e","last_reissued_at":"2026-05-18T01:02:58.485193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:58.485193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bisecting binomial coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eugen J. Ionascu, Pantelimon Stanica, Thor Martinsen","submitted_at":"2016-10-06T20:54:53Z","abstract_excerpt":"In this paper, we deal with the problem of bisecting binomial coefficients. We find many (previously unknown) infinite classes of integers which admit nontrivial bisections, and a class with only trivial bisections. As a byproduct of this last construction, we show conjectures Q2 and Q4 of Cusick and Li. We next find several bounds for the number of nontrivial bisections and further compute (using a supercomputer) the exact number of such bisections for n <= 51."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02063","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":"1610.02063","created_at":"2026-05-18T01:02:58.485285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02063v1","created_at":"2026-05-18T01:02:58.485285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02063","created_at":"2026-05-18T01:02:58.485285+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVL6SRYZYAPF","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVL6SRYZYAPFIHQT","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVL6SRYZ","created_at":"2026-05-18T12:30:55.937587+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/ZVL6SRYZYAPFIHQTMZCDS6RJ6J","json":"https://pith.science/pith/ZVL6SRYZYAPFIHQTMZCDS6RJ6J.json","graph_json":"https://pith.science/api/pith-number/ZVL6SRYZYAPFIHQTMZCDS6RJ6J/graph.json","events_json":"https://pith.science/api/pith-number/ZVL6SRYZYAPFIHQTMZCDS6RJ6J/events.json","paper":"https://pith.science/paper/ZVL6SRYZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZVL6SRYZYAPFIHQTMZCDS6RJ6J","download_json":"https://pith.science/pith/ZVL6SRYZYAPFIHQTMZCDS6RJ6J.json","view_paper":"https://pith.science/paper/ZVL6SRYZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02063&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVL6SRYZYAPFIHQTMZCDS6RJ6J/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVL6SRYZYAPFIHQTMZCDS6RJ6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVL6SRYZYAPFIHQTMZCDS6RJ6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVL6SRYZYAPFIHQTMZCDS6RJ6J/action/storage_attestation","attest_author":"https://pith.science/pith/ZVL6SRYZYAPFIHQTMZCDS6RJ6J/action/author_attestation","sign_citation":"https://pith.science/pith/ZVL6SRYZYAPFIHQTMZCDS6RJ6J/action/citation_signature","submit_replication":"https://pith.science/pith/ZVL6SRYZYAPFIHQTMZCDS6RJ6J/action/replication_record"}},"created_at":"2026-05-18T01:02:58.485285+00:00","updated_at":"2026-05-18T01:02:58.485285+00:00"}