{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:C5HHFEOV7KWIFAX73CKONYL6JN","short_pith_number":"pith:C5HHFEOV","schema_version":"1.0","canonical_sha256":"174e7291d5faac8282ffd894e6e17e4b602982765aba28704de09f2bed709616","source":{"kind":"arxiv","id":"1805.01562","version":1},"attestation_state":"computed","paper":{"title":"The number of s-separated k-sets in various circles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adri\\'an Pastine, Emiliano J.J. Estrugo","submitted_at":"2018-05-03T22:33:57Z","abstract_excerpt":"This article studies the number of ways of selecting $k$ objects arranged in $p$ circles of sizes $n_1,\\ldots,n_p$ such that no two selected ones have less than $s$ objects between them. If $n_i\\geq sk+1$ for all $1\\leq i \\leq p$, this number is shown to be $\\frac{n_1+\\ldots+n_p}{k}\\binom{n_1+\\ldots+n_p-sk-1}{k-1}$. A combinatorial proof of this claim is provided, and some nice combinatorial formulas are derived."},"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":"1805.01562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-03T22:33:57Z","cross_cats_sorted":[],"title_canon_sha256":"21cb404882cdd9ded423354f76952336648ee738bf36af009bbb105601b13935","abstract_canon_sha256":"75337151c1310cb338cf2ce1002a353b13d6ae6790a56062c6fe11791defe417"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:47.455308Z","signature_b64":"P9SpikstKtYVJOEAkyL2Sbo+ngi+uOtQ9D0rp7uJerS+aguOvKh77KmsYpDIcgfFmAfvk6ScYhk8noPz0nlrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"174e7291d5faac8282ffd894e6e17e4b602982765aba28704de09f2bed709616","last_reissued_at":"2026-05-18T00:16:47.454606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:47.454606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The number of s-separated k-sets in various circles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adri\\'an Pastine, Emiliano J.J. Estrugo","submitted_at":"2018-05-03T22:33:57Z","abstract_excerpt":"This article studies the number of ways of selecting $k$ objects arranged in $p$ circles of sizes $n_1,\\ldots,n_p$ such that no two selected ones have less than $s$ objects between them. If $n_i\\geq sk+1$ for all $1\\leq i \\leq p$, this number is shown to be $\\frac{n_1+\\ldots+n_p}{k}\\binom{n_1+\\ldots+n_p-sk-1}{k-1}$. A combinatorial proof of this claim is provided, and some nice combinatorial formulas are derived."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01562","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":"1805.01562","created_at":"2026-05-18T00:16:47.454725+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.01562v1","created_at":"2026-05-18T00:16:47.454725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01562","created_at":"2026-05-18T00:16:47.454725+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5HHFEOV7KWI","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5HHFEOV7KWIFAX7","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5HHFEOV","created_at":"2026-05-18T12:32:16.446611+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/C5HHFEOV7KWIFAX73CKONYL6JN","json":"https://pith.science/pith/C5HHFEOV7KWIFAX73CKONYL6JN.json","graph_json":"https://pith.science/api/pith-number/C5HHFEOV7KWIFAX73CKONYL6JN/graph.json","events_json":"https://pith.science/api/pith-number/C5HHFEOV7KWIFAX73CKONYL6JN/events.json","paper":"https://pith.science/paper/C5HHFEOV"},"agent_actions":{"view_html":"https://pith.science/pith/C5HHFEOV7KWIFAX73CKONYL6JN","download_json":"https://pith.science/pith/C5HHFEOV7KWIFAX73CKONYL6JN.json","view_paper":"https://pith.science/paper/C5HHFEOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.01562&json=true","fetch_graph":"https://pith.science/api/pith-number/C5HHFEOV7KWIFAX73CKONYL6JN/graph.json","fetch_events":"https://pith.science/api/pith-number/C5HHFEOV7KWIFAX73CKONYL6JN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5HHFEOV7KWIFAX73CKONYL6JN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5HHFEOV7KWIFAX73CKONYL6JN/action/storage_attestation","attest_author":"https://pith.science/pith/C5HHFEOV7KWIFAX73CKONYL6JN/action/author_attestation","sign_citation":"https://pith.science/pith/C5HHFEOV7KWIFAX73CKONYL6JN/action/citation_signature","submit_replication":"https://pith.science/pith/C5HHFEOV7KWIFAX73CKONYL6JN/action/replication_record"}},"created_at":"2026-05-18T00:16:47.454725+00:00","updated_at":"2026-05-18T00:16:47.454725+00:00"}