{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:C5HHFEOV7KWIFAX73CKONYL6JN","short_pith_number":"pith:C5HHFEOV","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"},"canonical_sha256":"174e7291d5faac8282ffd894e6e17e4b602982765aba28704de09f2bed709616","source":{"kind":"arxiv","id":"1805.01562","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01562","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01562v1","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01562","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"C5HHFEOV7KWI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C5HHFEOV7KWIFAX7","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C5HHFEOV","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:C5HHFEOV7KWIFAX73CKONYL6JN","target":"record","payload":{"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"},"canonical_sha256":"174e7291d5faac8282ffd894e6e17e4b602982765aba28704de09f2bed709616","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"},"source_kind":"arxiv","source_id":"1805.01562","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pe8u0WebAKeneUReUMEe68wKPx6Ioyyn1LxNXZt/4HFbv6oBeb4Gm+p2N30yFJNu/RnXD/5DIUOf/GHdcOdqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:12:05.934236Z"},"content_sha256":"342960a671620719bd39c3cceaea959805c8f4684cafd54016acf3d9842637d4","schema_version":"1.0","event_id":"sha256:342960a671620719bd39c3cceaea959805c8f4684cafd54016acf3d9842637d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:C5HHFEOV7KWIFAX73CKONYL6JN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nQ2z9la5INAwecPdPG7gVdJbLcrjWf7IhxirjWadZmvzG7SL2gdIyCirtZNDMtc4F9oKq7n0h53s4rcoObKfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:12:05.934881Z"},"content_sha256":"8282b36123e26a116099e87e05ce71dfdf4d25afc6893b5d125d412a54c38e0e","schema_version":"1.0","event_id":"sha256:8282b36123e26a116099e87e05ce71dfdf4d25afc6893b5d125d412a54c38e0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5HHFEOV7KWIFAX73CKONYL6JN/bundle.json","state_url":"https://pith.science/pith/C5HHFEOV7KWIFAX73CKONYL6JN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5HHFEOV7KWIFAX73CKONYL6JN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T02:12:05Z","links":{"resolver":"https://pith.science/pith/C5HHFEOV7KWIFAX73CKONYL6JN","bundle":"https://pith.science/pith/C5HHFEOV7KWIFAX73CKONYL6JN/bundle.json","state":"https://pith.science/pith/C5HHFEOV7KWIFAX73CKONYL6JN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5HHFEOV7KWIFAX73CKONYL6JN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:C5HHFEOV7KWIFAX73CKONYL6JN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"75337151c1310cb338cf2ce1002a353b13d6ae6790a56062c6fe11791defe417","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-03T22:33:57Z","title_canon_sha256":"21cb404882cdd9ded423354f76952336648ee738bf36af009bbb105601b13935"},"schema_version":"1.0","source":{"id":"1805.01562","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01562","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01562v1","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01562","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"C5HHFEOV7KWI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C5HHFEOV7KWIFAX7","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C5HHFEOV","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:8282b36123e26a116099e87e05ce71dfdf4d25afc6893b5d125d412a54c38e0e","target":"graph","created_at":"2026-05-18T00:16:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Adri\\'an Pastine, Emiliano J.J. Estrugo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-03T22:33:57Z","title":"The number of s-separated k-sets in various circles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01562","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:342960a671620719bd39c3cceaea959805c8f4684cafd54016acf3d9842637d4","target":"record","created_at":"2026-05-18T00:16:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"75337151c1310cb338cf2ce1002a353b13d6ae6790a56062c6fe11791defe417","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-03T22:33:57Z","title_canon_sha256":"21cb404882cdd9ded423354f76952336648ee738bf36af009bbb105601b13935"},"schema_version":"1.0","source":{"id":"1805.01562","kind":"arxiv","version":1}},"canonical_sha256":"174e7291d5faac8282ffd894e6e17e4b602982765aba28704de09f2bed709616","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"174e7291d5faac8282ffd894e6e17e4b602982765aba28704de09f2bed709616","first_computed_at":"2026-05-18T00:16:47.454606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:47.454606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P9SpikstKtYVJOEAkyL2Sbo+ngi+uOtQ9D0rp7uJerS+aguOvKh77KmsYpDIcgfFmAfvk6ScYhk8noPz0nlrDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:47.455308Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01562","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:342960a671620719bd39c3cceaea959805c8f4684cafd54016acf3d9842637d4","sha256:8282b36123e26a116099e87e05ce71dfdf4d25afc6893b5d125d412a54c38e0e"],"state_sha256":"57e8acb4236a8de0e7fbee475cbdc6617682b916977bed154f77ffa390464c4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4hfeR4bdE2rijKneQVRgIiLzmHYrgxA4BvWutJM31oVI8NGu1ZbmtqAxOvMnLKLrS/B0rHqF7VjryGtMVY5Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:12:05.937496Z","bundle_sha256":"64dc77869573366d5c13e3b2a9ee9d6db9b204b9e28a9908b7e05a6bd666f685"}}