{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JTTFFJLO5QG7VMLCG3MUDWZETP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6664b010467e38fec1a276e4aef5e721b458af3157a7c0d6dd36cceca24c954c","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-22T16:40:31Z","title_canon_sha256":"8d199b33e2e0e5b66f9b37b30382a0e3f62c82da308638598b8ec21473c2eb7b"},"schema_version":"1.0","source":{"id":"1801.07186","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07186","created_at":"2026-05-18T00:06:50Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07186v3","created_at":"2026-05-18T00:06:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07186","created_at":"2026-05-18T00:06:50Z"},{"alias_kind":"pith_short_12","alias_value":"JTTFFJLO5QG7","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JTTFFJLO5QG7VMLC","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JTTFFJLO","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:2870ee58cb8c0bd1128bace2e5aaf9ee32964a00c597abc34651146324dde889","target":"graph","created_at":"2026-05-18T00:06:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Recently the breakthrough method of hypergraph containers, developed independently by Balogh, Morris, and Samotij as well as Saxton and Thomason, has been used to study sparse random analogs of a variety of classical problems from combinatorics and number theory. The previously known proofs of the containers theorem use the so-called scythe algorithm---an iterative procedure that runs through the vertices of the hypergraph. (Saxton and Thomason have also proposed an alternative, randomized construction in the case of simple hypergraphs.) Here we present the first known deterministic proof of t","authors_text":"Anton Bernshteyn, Anush Tserunyan, Henry Towsner, Michelle Delcourt","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-22T16:40:31Z","title":"A short nonalgorithmic proof of the containers theorem for hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07186","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:905748ca63c57eb87d377a91325e4822a69d9f3feed39d10dc0c43737e892776","target":"record","created_at":"2026-05-18T00:06:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6664b010467e38fec1a276e4aef5e721b458af3157a7c0d6dd36cceca24c954c","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-22T16:40:31Z","title_canon_sha256":"8d199b33e2e0e5b66f9b37b30382a0e3f62c82da308638598b8ec21473c2eb7b"},"schema_version":"1.0","source":{"id":"1801.07186","kind":"arxiv","version":3}},"canonical_sha256":"4ce652a56eec0dfab16236d941db249bc7452c95afcab6f1d92cea12c9889172","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ce652a56eec0dfab16236d941db249bc7452c95afcab6f1d92cea12c9889172","first_computed_at":"2026-05-18T00:06:50.934919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:50.934919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TMePT+ejbaORuroZmO4Hyjs3fkkMgekkHhN2s5LEXNuLFOynCpw/HyuceMUrbpNM/NXojjezjOqc/vsmQC8xCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:50.935645Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07186","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:905748ca63c57eb87d377a91325e4822a69d9f3feed39d10dc0c43737e892776","sha256:2870ee58cb8c0bd1128bace2e5aaf9ee32964a00c597abc34651146324dde889"],"state_sha256":"81079d8e12da723785c1753197b0763548a82a8f9750a3c6e70d1c38ae77cc7a"}