{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OMU6NNEHT5T4CEW75GFA6PVVJT","short_pith_number":"pith:OMU6NNEH","schema_version":"1.0","canonical_sha256":"7329e6b4879f67c112dfe98a0f3eb54cc0ff8d4592e60658ef1f4feaf8198679","source":{"kind":"arxiv","id":"1607.08152","version":1},"attestation_state":"computed","paper":{"title":"Multicolour containers and the entropy of decorated graph limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Uzzell, Johanna Str\\\"omberg, Kelly O'Connell, Victor Falgas-Ravry","submitted_at":"2016-07-27T15:35:32Z","abstract_excerpt":"In recent breakthrough results, Saxton--Thomason and Balogh--Morris--Samotij have developed powerful theories of hypergraph containers. These theories have led to a large number of new results on transference, and on counting and characterising typical graphs in hereditary properties. In a different direction, Hatami--Janson--Szegedy proved results on the entropy of graph limits which count and characterise graphs in dense hereditary properties.\n  In this paper, we make a threefold contribution to this area of research:\n  1) We generalise results of Saxton--Thomason to obtain container theorem"},"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":"1607.08152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-27T15:35:32Z","cross_cats_sorted":[],"title_canon_sha256":"0e7b47bacf71b2c30544926fad38889c226895d393a53cbd4e7fe2b0b8edf0ee","abstract_canon_sha256":"c25518744e9c2eaaf7d30eee82f895f22e6c39ca04e42d4c0fcfb96a6fbe80bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:20.908716Z","signature_b64":"tdaf9xQpP0E6nSmVIPJ1gTfdeAr6ZVLrHWVnKptaVI8BGnUbcWvJ4EMPAxAXWTTBfhNluYjCQjPFnkpyUUNBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7329e6b4879f67c112dfe98a0f3eb54cc0ff8d4592e60658ef1f4feaf8198679","last_reissued_at":"2026-05-18T01:10:20.907975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:20.907975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multicolour containers and the entropy of decorated graph limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Uzzell, Johanna Str\\\"omberg, Kelly O'Connell, Victor Falgas-Ravry","submitted_at":"2016-07-27T15:35:32Z","abstract_excerpt":"In recent breakthrough results, Saxton--Thomason and Balogh--Morris--Samotij have developed powerful theories of hypergraph containers. These theories have led to a large number of new results on transference, and on counting and characterising typical graphs in hereditary properties. In a different direction, Hatami--Janson--Szegedy proved results on the entropy of graph limits which count and characterise graphs in dense hereditary properties.\n  In this paper, we make a threefold contribution to this area of research:\n  1) We generalise results of Saxton--Thomason to obtain container theorem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08152","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":"1607.08152","created_at":"2026-05-18T01:10:20.908070+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.08152v1","created_at":"2026-05-18T01:10:20.908070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08152","created_at":"2026-05-18T01:10:20.908070+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMU6NNEHT5T4","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMU6NNEHT5T4CEW7","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMU6NNEH","created_at":"2026-05-18T12:30:36.002864+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/OMU6NNEHT5T4CEW75GFA6PVVJT","json":"https://pith.science/pith/OMU6NNEHT5T4CEW75GFA6PVVJT.json","graph_json":"https://pith.science/api/pith-number/OMU6NNEHT5T4CEW75GFA6PVVJT/graph.json","events_json":"https://pith.science/api/pith-number/OMU6NNEHT5T4CEW75GFA6PVVJT/events.json","paper":"https://pith.science/paper/OMU6NNEH"},"agent_actions":{"view_html":"https://pith.science/pith/OMU6NNEHT5T4CEW75GFA6PVVJT","download_json":"https://pith.science/pith/OMU6NNEHT5T4CEW75GFA6PVVJT.json","view_paper":"https://pith.science/paper/OMU6NNEH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.08152&json=true","fetch_graph":"https://pith.science/api/pith-number/OMU6NNEHT5T4CEW75GFA6PVVJT/graph.json","fetch_events":"https://pith.science/api/pith-number/OMU6NNEHT5T4CEW75GFA6PVVJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMU6NNEHT5T4CEW75GFA6PVVJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMU6NNEHT5T4CEW75GFA6PVVJT/action/storage_attestation","attest_author":"https://pith.science/pith/OMU6NNEHT5T4CEW75GFA6PVVJT/action/author_attestation","sign_citation":"https://pith.science/pith/OMU6NNEHT5T4CEW75GFA6PVVJT/action/citation_signature","submit_replication":"https://pith.science/pith/OMU6NNEHT5T4CEW75GFA6PVVJT/action/replication_record"}},"created_at":"2026-05-18T01:10:20.908070+00:00","updated_at":"2026-05-18T01:10:20.908070+00:00"}