{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2SKRK4AKSL3LWA7C4KJ54QSQ7J","short_pith_number":"pith:2SKRK4AK","schema_version":"1.0","canonical_sha256":"d49515700a92f6bb03e2e293de4250fa723a49f92507d9117af9b020796d9b83","source":{"kind":"arxiv","id":"2004.12306","version":2},"attestation_state":"computed","paper":{"title":"Cells in the box and a hyperplane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Imre Barany, Peter Frankl","submitted_at":"2020-04-26T08:19:40Z","abstract_excerpt":"It is well-known that a line can intersect at most $2n-1$ cells of the $n \\times n$ chessboard. Here we consider the high dimensional version: how many cells of the $d$-dimensional $n\\times \\ldots \\times n$ box can a hyperplane intersect? We also prove the lattice analogue of the following well-known fact. If $K,L$ are convex bodies in $R^d$ and $K\\subset L$, then the surface area of $K$ is smaller than that of $L$."},"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":"2004.12306","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2020-04-26T08:19:40Z","cross_cats_sorted":[],"title_canon_sha256":"95b1105aa48df2a170b2229fa40d0acd1c071d0e8c7daaaf3a3f8b23ee18f958","abstract_canon_sha256":"b89511e890407f947633cc54fba3d4b8329892ab01294e1d406e7562ea448022"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:23:55.526612Z","signature_b64":"aKCB7sm5gmtTG/5nIvKXVA5fQN1crsuzyGu10kcjgdbUj4ahnhQie6bbDvkLMBIop5oiAvbnUcDaJEAt5g3rCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d49515700a92f6bb03e2e293de4250fa723a49f92507d9117af9b020796d9b83","last_reissued_at":"2026-07-05T05:23:55.526178Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:23:55.526178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cells in the box and a hyperplane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Imre Barany, Peter Frankl","submitted_at":"2020-04-26T08:19:40Z","abstract_excerpt":"It is well-known that a line can intersect at most $2n-1$ cells of the $n \\times n$ chessboard. Here we consider the high dimensional version: how many cells of the $d$-dimensional $n\\times \\ldots \\times n$ box can a hyperplane intersect? We also prove the lattice analogue of the following well-known fact. If $K,L$ are convex bodies in $R^d$ and $K\\subset L$, then the surface area of $K$ is smaller than that of $L$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.12306","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.12306/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2004.12306","created_at":"2026-07-05T05:23:55.526237+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.12306v2","created_at":"2026-07-05T05:23:55.526237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.12306","created_at":"2026-07-05T05:23:55.526237+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SKRK4AKSL3L","created_at":"2026-07-05T05:23:55.526237+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SKRK4AKSL3LWA7C","created_at":"2026-07-05T05:23:55.526237+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SKRK4AK","created_at":"2026-07-05T05:23:55.526237+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/2SKRK4AKSL3LWA7C4KJ54QSQ7J","json":"https://pith.science/pith/2SKRK4AKSL3LWA7C4KJ54QSQ7J.json","graph_json":"https://pith.science/api/pith-number/2SKRK4AKSL3LWA7C4KJ54QSQ7J/graph.json","events_json":"https://pith.science/api/pith-number/2SKRK4AKSL3LWA7C4KJ54QSQ7J/events.json","paper":"https://pith.science/paper/2SKRK4AK"},"agent_actions":{"view_html":"https://pith.science/pith/2SKRK4AKSL3LWA7C4KJ54QSQ7J","download_json":"https://pith.science/pith/2SKRK4AKSL3LWA7C4KJ54QSQ7J.json","view_paper":"https://pith.science/paper/2SKRK4AK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.12306&json=true","fetch_graph":"https://pith.science/api/pith-number/2SKRK4AKSL3LWA7C4KJ54QSQ7J/graph.json","fetch_events":"https://pith.science/api/pith-number/2SKRK4AKSL3LWA7C4KJ54QSQ7J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SKRK4AKSL3LWA7C4KJ54QSQ7J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SKRK4AKSL3LWA7C4KJ54QSQ7J/action/storage_attestation","attest_author":"https://pith.science/pith/2SKRK4AKSL3LWA7C4KJ54QSQ7J/action/author_attestation","sign_citation":"https://pith.science/pith/2SKRK4AKSL3LWA7C4KJ54QSQ7J/action/citation_signature","submit_replication":"https://pith.science/pith/2SKRK4AKSL3LWA7C4KJ54QSQ7J/action/replication_record"}},"created_at":"2026-07-05T05:23:55.526237+00:00","updated_at":"2026-07-05T05:23:55.526237+00:00"}