{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DW6K7XUK2VS7CCWYRUDDYRNA4I","short_pith_number":"pith:DW6K7XUK","schema_version":"1.0","canonical_sha256":"1dbcafde8ad565f10ad88d063c45a0e23f33d8f589bae91f9b48c6b9aece18b6","source":{"kind":"arxiv","id":"1808.04166","version":1},"attestation_state":"computed","paper":{"title":"On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.PR","authors_text":"Christos Pelekis","submitted_at":"2018-08-13T12:19:48Z","abstract_excerpt":"Suppose that you have $n$ colours and $m$ mutually independent dice, each of which has $r$ sides. Each dice lands on any of its sides with equal probability. You may colour the sides of each die in any way you wish, but there is one restriction: you are not allowed to use the same colour more than once on the sides of a die. Any other colouring is allowed. Let $X$ be the number of different colours that you see after rolling the dice. How should you colour the sides of the dice in order to maximize the Shannon entropy of $X$? In this article we investigate this question. We show that the entro"},"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.04166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-13T12:19:48Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b805d8761ea55f0c3765cd158d56a79eed5f90d4253678c6b16321f8f3cfeb68","abstract_canon_sha256":"5ef0f0b9dbe97dfb578775bebc910352546173eb231e5edeef3727de52140bbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:18.698130Z","signature_b64":"0SPntpHwb1uYCCWiqP4zdVYN3iA3/QthgliKJ/SXHzU6bJ1Do9fXLX6sqZwYjsnrk7LJCbh5KHeu9GOilEfeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dbcafde8ad565f10ad88d063c45a0e23f33d8f589bae91f9b48c6b9aece18b6","last_reissued_at":"2026-05-18T00:08:18.697686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:18.697686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.PR","authors_text":"Christos Pelekis","submitted_at":"2018-08-13T12:19:48Z","abstract_excerpt":"Suppose that you have $n$ colours and $m$ mutually independent dice, each of which has $r$ sides. Each dice lands on any of its sides with equal probability. You may colour the sides of each die in any way you wish, but there is one restriction: you are not allowed to use the same colour more than once on the sides of a die. Any other colouring is allowed. Let $X$ be the number of different colours that you see after rolling the dice. How should you colour the sides of the dice in order to maximize the Shannon entropy of $X$? In this article we investigate this question. We show that the entro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04166","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.04166","created_at":"2026-05-18T00:08:18.697757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.04166v1","created_at":"2026-05-18T00:08:18.697757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04166","created_at":"2026-05-18T00:08:18.697757+00:00"},{"alias_kind":"pith_short_12","alias_value":"DW6K7XUK2VS7","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DW6K7XUK2VS7CCWY","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DW6K7XUK","created_at":"2026-05-18T12:32:19.392346+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/DW6K7XUK2VS7CCWYRUDDYRNA4I","json":"https://pith.science/pith/DW6K7XUK2VS7CCWYRUDDYRNA4I.json","graph_json":"https://pith.science/api/pith-number/DW6K7XUK2VS7CCWYRUDDYRNA4I/graph.json","events_json":"https://pith.science/api/pith-number/DW6K7XUK2VS7CCWYRUDDYRNA4I/events.json","paper":"https://pith.science/paper/DW6K7XUK"},"agent_actions":{"view_html":"https://pith.science/pith/DW6K7XUK2VS7CCWYRUDDYRNA4I","download_json":"https://pith.science/pith/DW6K7XUK2VS7CCWYRUDDYRNA4I.json","view_paper":"https://pith.science/paper/DW6K7XUK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.04166&json=true","fetch_graph":"https://pith.science/api/pith-number/DW6K7XUK2VS7CCWYRUDDYRNA4I/graph.json","fetch_events":"https://pith.science/api/pith-number/DW6K7XUK2VS7CCWYRUDDYRNA4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DW6K7XUK2VS7CCWYRUDDYRNA4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DW6K7XUK2VS7CCWYRUDDYRNA4I/action/storage_attestation","attest_author":"https://pith.science/pith/DW6K7XUK2VS7CCWYRUDDYRNA4I/action/author_attestation","sign_citation":"https://pith.science/pith/DW6K7XUK2VS7CCWYRUDDYRNA4I/action/citation_signature","submit_replication":"https://pith.science/pith/DW6K7XUK2VS7CCWYRUDDYRNA4I/action/replication_record"}},"created_at":"2026-05-18T00:08:18.697757+00:00","updated_at":"2026-05-18T00:08:18.697757+00:00"}