{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AZDDFSW3VZENGY5W5IYAEJAK5J","short_pith_number":"pith:AZDDFSW3","schema_version":"1.0","canonical_sha256":"064632cadbae48d363b6ea3002240aea5ee1e56ff700729a8fbdac99ca188759","source":{"kind":"arxiv","id":"1702.01675","version":2},"attestation_state":"computed","paper":{"title":"On a biased edge isoperimetric inequality for the discrete cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Ellis, Nathan Keller, Noam Lifshitz","submitted_at":"2017-02-06T16:05:32Z","abstract_excerpt":"The `full' edge isoperimetric inequality for the discrete cube (due to Harper, Bernstein, Lindsay and Hart) specifies the minimum size of the edge boundary $\\partial A$ of a set $A \\subset \\{0,1\\}^n$, as a function of $|A|$. A weaker (but more widely-used) lower bound is $|\\partial A| \\geq |A| \\log_2(2^n/|A|)$, where equality holds iff $A$ is a subcube. In 2011, the first author obtained a sharp `stability' version of the latter result, proving that if $|\\partial A| \\leq |A| (\\log(2^n/|A|)+\\epsilon)$, then there exists a subcube $C$ such that $|A \\Delta C|/|A| = O(\\epsilon /\\log(1/\\epsilon))$."},"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":"1702.01675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-06T16:05:32Z","cross_cats_sorted":[],"title_canon_sha256":"700b23fa5df397d7a5d1e6d817b36056dcc2964996c3da2cd9950c3ce2b343e3","abstract_canon_sha256":"b057071b24e7a9618f2394e87dff803477761a1ebd834a28eb3f779e4fb6b1ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:11.122485Z","signature_b64":"Gb+FfTI3TthFD6lH9eDvP3LMl/1eXdPCDjpsjADfXMWI8P30zXdSBdnj1FawtW6bZoG3bwLu20fqHuadSqzWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"064632cadbae48d363b6ea3002240aea5ee1e56ff700729a8fbdac99ca188759","last_reissued_at":"2026-05-18T00:22:11.121877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:11.121877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a biased edge isoperimetric inequality for the discrete cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Ellis, Nathan Keller, Noam Lifshitz","submitted_at":"2017-02-06T16:05:32Z","abstract_excerpt":"The `full' edge isoperimetric inequality for the discrete cube (due to Harper, Bernstein, Lindsay and Hart) specifies the minimum size of the edge boundary $\\partial A$ of a set $A \\subset \\{0,1\\}^n$, as a function of $|A|$. A weaker (but more widely-used) lower bound is $|\\partial A| \\geq |A| \\log_2(2^n/|A|)$, where equality holds iff $A$ is a subcube. In 2011, the first author obtained a sharp `stability' version of the latter result, proving that if $|\\partial A| \\leq |A| (\\log(2^n/|A|)+\\epsilon)$, then there exists a subcube $C$ such that $|A \\Delta C|/|A| = O(\\epsilon /\\log(1/\\epsilon))$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01675","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":""},"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":"1702.01675","created_at":"2026-05-18T00:22:11.121953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01675v2","created_at":"2026-05-18T00:22:11.121953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01675","created_at":"2026-05-18T00:22:11.121953+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZDDFSW3VZEN","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZDDFSW3VZENGY5W","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZDDFSW3","created_at":"2026-05-18T12:31:08.081275+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/AZDDFSW3VZENGY5W5IYAEJAK5J","json":"https://pith.science/pith/AZDDFSW3VZENGY5W5IYAEJAK5J.json","graph_json":"https://pith.science/api/pith-number/AZDDFSW3VZENGY5W5IYAEJAK5J/graph.json","events_json":"https://pith.science/api/pith-number/AZDDFSW3VZENGY5W5IYAEJAK5J/events.json","paper":"https://pith.science/paper/AZDDFSW3"},"agent_actions":{"view_html":"https://pith.science/pith/AZDDFSW3VZENGY5W5IYAEJAK5J","download_json":"https://pith.science/pith/AZDDFSW3VZENGY5W5IYAEJAK5J.json","view_paper":"https://pith.science/paper/AZDDFSW3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01675&json=true","fetch_graph":"https://pith.science/api/pith-number/AZDDFSW3VZENGY5W5IYAEJAK5J/graph.json","fetch_events":"https://pith.science/api/pith-number/AZDDFSW3VZENGY5W5IYAEJAK5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZDDFSW3VZENGY5W5IYAEJAK5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZDDFSW3VZENGY5W5IYAEJAK5J/action/storage_attestation","attest_author":"https://pith.science/pith/AZDDFSW3VZENGY5W5IYAEJAK5J/action/author_attestation","sign_citation":"https://pith.science/pith/AZDDFSW3VZENGY5W5IYAEJAK5J/action/citation_signature","submit_replication":"https://pith.science/pith/AZDDFSW3VZENGY5W5IYAEJAK5J/action/replication_record"}},"created_at":"2026-05-18T00:22:11.121953+00:00","updated_at":"2026-05-18T00:22:11.121953+00:00"}