{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZVNJLASWIEK67LPBDZ3HBRHRMY","short_pith_number":"pith:ZVNJLASW","schema_version":"1.0","canonical_sha256":"cd5a9582564115efade11e7670c4f16637a9c0a50c91405e4f28fd071f882270","source":{"kind":"arxiv","id":"1808.09482","version":1},"attestation_state":"computed","paper":{"title":"Expected Number of Vertices of a Hypercube Slice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.PR","authors_text":"Hunter Swan","submitted_at":"2018-08-28T18:32:05Z","abstract_excerpt":"Given a random k-dimensional cross-section of a hypercube, what is its expected number of vertices? We show that, for a suitable distribution of random slices, the answer is $2^k$, independent of the dimension of the hypercube."},"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.09482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-28T18:32:05Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"2bf372d89623870a942186e473f1db316a4bb8c050d976fc73cf2d56fba2470a","abstract_canon_sha256":"424878c0c4af6d981f94836e96409cde89e4f7501452ac2517eba5c09ae51942"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:55.458993Z","signature_b64":"Ea+Rf8VhLWLuqLAfRIxbbk44XCtDzvhnR2LhAeM93cQg5mInT6Ui4wGtHRsGgmmPEjXZFsf+453jccQ0thsZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd5a9582564115efade11e7670c4f16637a9c0a50c91405e4f28fd071f882270","last_reissued_at":"2026-05-18T00:06:55.458271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:55.458271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expected Number of Vertices of a Hypercube Slice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.PR","authors_text":"Hunter Swan","submitted_at":"2018-08-28T18:32:05Z","abstract_excerpt":"Given a random k-dimensional cross-section of a hypercube, what is its expected number of vertices? We show that, for a suitable distribution of random slices, the answer is $2^k$, independent of the dimension of the hypercube."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09482","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.09482","created_at":"2026-05-18T00:06:55.458405+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.09482v1","created_at":"2026-05-18T00:06:55.458405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09482","created_at":"2026-05-18T00:06:55.458405+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVNJLASWIEK6","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVNJLASWIEK67LPB","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVNJLASW","created_at":"2026-05-18T12:33:07.085635+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/ZVNJLASWIEK67LPBDZ3HBRHRMY","json":"https://pith.science/pith/ZVNJLASWIEK67LPBDZ3HBRHRMY.json","graph_json":"https://pith.science/api/pith-number/ZVNJLASWIEK67LPBDZ3HBRHRMY/graph.json","events_json":"https://pith.science/api/pith-number/ZVNJLASWIEK67LPBDZ3HBRHRMY/events.json","paper":"https://pith.science/paper/ZVNJLASW"},"agent_actions":{"view_html":"https://pith.science/pith/ZVNJLASWIEK67LPBDZ3HBRHRMY","download_json":"https://pith.science/pith/ZVNJLASWIEK67LPBDZ3HBRHRMY.json","view_paper":"https://pith.science/paper/ZVNJLASW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.09482&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVNJLASWIEK67LPBDZ3HBRHRMY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVNJLASWIEK67LPBDZ3HBRHRMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVNJLASWIEK67LPBDZ3HBRHRMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVNJLASWIEK67LPBDZ3HBRHRMY/action/storage_attestation","attest_author":"https://pith.science/pith/ZVNJLASWIEK67LPBDZ3HBRHRMY/action/author_attestation","sign_citation":"https://pith.science/pith/ZVNJLASWIEK67LPBDZ3HBRHRMY/action/citation_signature","submit_replication":"https://pith.science/pith/ZVNJLASWIEK67LPBDZ3HBRHRMY/action/replication_record"}},"created_at":"2026-05-18T00:06:55.458405+00:00","updated_at":"2026-05-18T00:06:55.458405+00:00"}