{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2RUGHW32RE76AYYQVEEFLSXOIR","short_pith_number":"pith:2RUGHW32","schema_version":"1.0","canonical_sha256":"d46863db7a893fe06310a90855caee444dba27fafd3508a1765e2a01c205892d","source":{"kind":"arxiv","id":"1801.04584","version":1},"attestation_state":"computed","paper":{"title":"The method of hypergraph containers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J\\'ozsef Balogh, Robert Morris, Wojciech Samotij","submitted_at":"2018-01-14T17:03:49Z","abstract_excerpt":"In this survey we describe a recently-developed technique for bounding the number (and controlling the typical structure) of finite objects with forbidden substructures. This technique exploits a subtle clustering phenomenon exhibited by the independent sets of uniform hypergraphs whose edges are sufficiently evenly distributed; more precisely, it provides a relatively small family of 'containers' for the independent sets, each of which contains few edges. We attempt to convey to the reader a general high-level overview of the method, focusing on a small number of illustrative applications in "},"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":"1801.04584","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-14T17:03:49Z","cross_cats_sorted":[],"title_canon_sha256":"0968bfc797cc8134e04e0376e51a31222dae9791957ef0a5286429060fbb7c7f","abstract_canon_sha256":"a27022ce5593d877d91ab32aab4c3243a6d187c7ccfac32e0819769e4f19d19f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:03.927131Z","signature_b64":"PJSmKYlA80Qo3sp1/M8d+Prsp+oh3GxwxLXnH6TipfFe++mD7v5DjMcw4pJe7Z3hHyF7E5XR0A1iMIymY0zICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d46863db7a893fe06310a90855caee444dba27fafd3508a1765e2a01c205892d","last_reissued_at":"2026-05-18T00:26:03.926418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:03.926418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The method of hypergraph containers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J\\'ozsef Balogh, Robert Morris, Wojciech Samotij","submitted_at":"2018-01-14T17:03:49Z","abstract_excerpt":"In this survey we describe a recently-developed technique for bounding the number (and controlling the typical structure) of finite objects with forbidden substructures. This technique exploits a subtle clustering phenomenon exhibited by the independent sets of uniform hypergraphs whose edges are sufficiently evenly distributed; more precisely, it provides a relatively small family of 'containers' for the independent sets, each of which contains few edges. We attempt to convey to the reader a general high-level overview of the method, focusing on a small number of illustrative applications in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04584","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":"1801.04584","created_at":"2026-05-18T00:26:03.926537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04584v1","created_at":"2026-05-18T00:26:03.926537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04584","created_at":"2026-05-18T00:26:03.926537+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RUGHW32RE76","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RUGHW32RE76AYYQ","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RUGHW32","created_at":"2026-05-18T12:32:02.567920+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/2RUGHW32RE76AYYQVEEFLSXOIR","json":"https://pith.science/pith/2RUGHW32RE76AYYQVEEFLSXOIR.json","graph_json":"https://pith.science/api/pith-number/2RUGHW32RE76AYYQVEEFLSXOIR/graph.json","events_json":"https://pith.science/api/pith-number/2RUGHW32RE76AYYQVEEFLSXOIR/events.json","paper":"https://pith.science/paper/2RUGHW32"},"agent_actions":{"view_html":"https://pith.science/pith/2RUGHW32RE76AYYQVEEFLSXOIR","download_json":"https://pith.science/pith/2RUGHW32RE76AYYQVEEFLSXOIR.json","view_paper":"https://pith.science/paper/2RUGHW32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04584&json=true","fetch_graph":"https://pith.science/api/pith-number/2RUGHW32RE76AYYQVEEFLSXOIR/graph.json","fetch_events":"https://pith.science/api/pith-number/2RUGHW32RE76AYYQVEEFLSXOIR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RUGHW32RE76AYYQVEEFLSXOIR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RUGHW32RE76AYYQVEEFLSXOIR/action/storage_attestation","attest_author":"https://pith.science/pith/2RUGHW32RE76AYYQVEEFLSXOIR/action/author_attestation","sign_citation":"https://pith.science/pith/2RUGHW32RE76AYYQVEEFLSXOIR/action/citation_signature","submit_replication":"https://pith.science/pith/2RUGHW32RE76AYYQVEEFLSXOIR/action/replication_record"}},"created_at":"2026-05-18T00:26:03.926537+00:00","updated_at":"2026-05-18T00:26:03.926537+00:00"}