{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XTIFBKYJJEKH4SOPJ6TKPDLEXT","short_pith_number":"pith:XTIFBKYJ","schema_version":"1.0","canonical_sha256":"bcd050ab0949147e49cf4fa6a78d64bcf7045344416260437d836532c0db9b51","source":{"kind":"arxiv","id":"1406.7872","version":1},"attestation_state":"computed","paper":{"title":"Three tutorial lectures on entropy and counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Galvin","submitted_at":"2014-06-30T19:49:26Z","abstract_excerpt":"We explain the notion of the {\\em entropy} of a discrete random variable, and derive some of its basic properties. We then show through examples how entropy can be useful as a combinatorial enumeration tool. We end with a few open questions."},"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":"1406.7872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-30T19:49:26Z","cross_cats_sorted":[],"title_canon_sha256":"d1ac373ecad3ffaa928ce0f559268e4c6bb257734e4d04d6431a1674dd0b4030","abstract_canon_sha256":"8da0f07924f5ef14e8a248515d1703fe29864a4b1ec9de7a50dc772694ba0c22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:43.958445Z","signature_b64":"ge2kTn/e8JJ0dsZqNkj1i1Jmz8QPezaIjBp1iLpn0rLr5qC72Py7pgPBVHzimuwNQS1Uq3XhVnR/jbG8J7P1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcd050ab0949147e49cf4fa6a78d64bcf7045344416260437d836532c0db9b51","last_reissued_at":"2026-05-18T02:48:43.957846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:43.957846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Three tutorial lectures on entropy and counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Galvin","submitted_at":"2014-06-30T19:49:26Z","abstract_excerpt":"We explain the notion of the {\\em entropy} of a discrete random variable, and derive some of its basic properties. We then show through examples how entropy can be useful as a combinatorial enumeration tool. We end with a few open questions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7872","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":"1406.7872","created_at":"2026-05-18T02:48:43.957936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.7872v1","created_at":"2026-05-18T02:48:43.957936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7872","created_at":"2026-05-18T02:48:43.957936+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTIFBKYJJEKH","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTIFBKYJJEKH4SOP","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTIFBKYJ","created_at":"2026-05-18T12:28:57.508820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.00894","citing_title":"Non-Adaptive Cryptanalytic Time-Space Lower Bounds via a Shearer-like Inequality for Permutations","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XTIFBKYJJEKH4SOPJ6TKPDLEXT","json":"https://pith.science/pith/XTIFBKYJJEKH4SOPJ6TKPDLEXT.json","graph_json":"https://pith.science/api/pith-number/XTIFBKYJJEKH4SOPJ6TKPDLEXT/graph.json","events_json":"https://pith.science/api/pith-number/XTIFBKYJJEKH4SOPJ6TKPDLEXT/events.json","paper":"https://pith.science/paper/XTIFBKYJ"},"agent_actions":{"view_html":"https://pith.science/pith/XTIFBKYJJEKH4SOPJ6TKPDLEXT","download_json":"https://pith.science/pith/XTIFBKYJJEKH4SOPJ6TKPDLEXT.json","view_paper":"https://pith.science/paper/XTIFBKYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.7872&json=true","fetch_graph":"https://pith.science/api/pith-number/XTIFBKYJJEKH4SOPJ6TKPDLEXT/graph.json","fetch_events":"https://pith.science/api/pith-number/XTIFBKYJJEKH4SOPJ6TKPDLEXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTIFBKYJJEKH4SOPJ6TKPDLEXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTIFBKYJJEKH4SOPJ6TKPDLEXT/action/storage_attestation","attest_author":"https://pith.science/pith/XTIFBKYJJEKH4SOPJ6TKPDLEXT/action/author_attestation","sign_citation":"https://pith.science/pith/XTIFBKYJJEKH4SOPJ6TKPDLEXT/action/citation_signature","submit_replication":"https://pith.science/pith/XTIFBKYJJEKH4SOPJ6TKPDLEXT/action/replication_record"}},"created_at":"2026-05-18T02:48:43.957936+00:00","updated_at":"2026-05-18T02:48:43.957936+00:00"}