{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SVDNXGEQEST5CFNUWIGVMECBWB","short_pith_number":"pith:SVDNXGEQ","schema_version":"1.0","canonical_sha256":"9546db989024a7d115b4b20d561041b07e300823691df5b1022baedf0ad2b71a","source":{"kind":"arxiv","id":"1707.06893","version":2},"attestation_state":"computed","paper":{"title":"Binomial collisions and near collisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Aart Blokhuis, Andries Brouwer, Benne de Weger","submitted_at":"2017-07-21T13:36:01Z","abstract_excerpt":"We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for binomial coefficients that seem to be new."},"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":"1707.06893","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-07-21T13:36:01Z","cross_cats_sorted":[],"title_canon_sha256":"15b8b825c8434a7682ba5b7d7357837afbc049fbbb3f8affca46d0a6dfb56775","abstract_canon_sha256":"54e488a6f390a6eaeb73fbae8b97bad36d42f9af8dc6ff941f86295d038a6031"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:59.480247Z","signature_b64":"cljmYeIgl/1Cp3yd75w8fQ2kFJ+gUXl+lcLkhx6UJj9lt/ZvwOKjW62433DiUm8VjtuJU1FqhRjC44SSXPmODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9546db989024a7d115b4b20d561041b07e300823691df5b1022baedf0ad2b71a","last_reissued_at":"2026-05-18T00:32:59.479620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:59.479620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binomial collisions and near collisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Aart Blokhuis, Andries Brouwer, Benne de Weger","submitted_at":"2017-07-21T13:36:01Z","abstract_excerpt":"We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for binomial coefficients that seem to be new."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06893","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":"1707.06893","created_at":"2026-05-18T00:32:59.479733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06893v2","created_at":"2026-05-18T00:32:59.479733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06893","created_at":"2026-05-18T00:32:59.479733+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVDNXGEQEST5","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVDNXGEQEST5CFNU","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVDNXGEQ","created_at":"2026-05-18T12:31:43.269735+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/SVDNXGEQEST5CFNUWIGVMECBWB","json":"https://pith.science/pith/SVDNXGEQEST5CFNUWIGVMECBWB.json","graph_json":"https://pith.science/api/pith-number/SVDNXGEQEST5CFNUWIGVMECBWB/graph.json","events_json":"https://pith.science/api/pith-number/SVDNXGEQEST5CFNUWIGVMECBWB/events.json","paper":"https://pith.science/paper/SVDNXGEQ"},"agent_actions":{"view_html":"https://pith.science/pith/SVDNXGEQEST5CFNUWIGVMECBWB","download_json":"https://pith.science/pith/SVDNXGEQEST5CFNUWIGVMECBWB.json","view_paper":"https://pith.science/paper/SVDNXGEQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06893&json=true","fetch_graph":"https://pith.science/api/pith-number/SVDNXGEQEST5CFNUWIGVMECBWB/graph.json","fetch_events":"https://pith.science/api/pith-number/SVDNXGEQEST5CFNUWIGVMECBWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVDNXGEQEST5CFNUWIGVMECBWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVDNXGEQEST5CFNUWIGVMECBWB/action/storage_attestation","attest_author":"https://pith.science/pith/SVDNXGEQEST5CFNUWIGVMECBWB/action/author_attestation","sign_citation":"https://pith.science/pith/SVDNXGEQEST5CFNUWIGVMECBWB/action/citation_signature","submit_replication":"https://pith.science/pith/SVDNXGEQEST5CFNUWIGVMECBWB/action/replication_record"}},"created_at":"2026-05-18T00:32:59.479733+00:00","updated_at":"2026-05-18T00:32:59.479733+00:00"}