{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5TY6Y6FN3GRKOSFNESO3WLFL6F","short_pith_number":"pith:5TY6Y6FN","schema_version":"1.0","canonical_sha256":"ecf1ec78add9a2a748ad249dbb2cabf16d4a5763a1e5a989b69e077cab40983f","source":{"kind":"arxiv","id":"2406.01499","version":1},"attestation_state":"computed","paper":{"title":"Applications of Sparse Hypergraph Colorings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Christian Clemen","submitted_at":"2024-06-03T16:26:59Z","abstract_excerpt":"Many problems in extremal combinatorics can be reduced to determining the independence number of a specific auxiliary hypergraph. We present two such problems, one from discrete geometry and one from hypergraph Tur\\'an theory. Using results on hypergraph colorings by Cooper-Mubayi and Li-Postle, we demonstrate that for those two problems the trivial lower bound on the independence number can be improved upon:\n  Erd\\H{o}s, Graham, Ruzsa and Taylor asked to determine the largest size, denoted by $g(n)$, of a subset $P$ of the grid $[n]^2$ such that every pair of points in $P$ span a different sl"},"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":"2406.01499","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-03T16:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"78f4c5d0a4d7d42ee68e608b627a9179ce0fe6753acab116a3ecac14be76f18e","abstract_canon_sha256":"3c1636bd84ca4e888e67af58cd872cb4161af6bed997922085024225f577bdee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:26:40.523591Z","signature_b64":"ZlfxvCb05L9KHl4M/CO/IJ/pO5n13Om27msGxqPdzZ1HNEJ6zPkAJociBlcO0DCln0ZIl896yfrh2dB3fx5RBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecf1ec78add9a2a748ad249dbb2cabf16d4a5763a1e5a989b69e077cab40983f","last_reissued_at":"2026-07-05T08:26:40.523103Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:26:40.523103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Applications of Sparse Hypergraph Colorings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Christian Clemen","submitted_at":"2024-06-03T16:26:59Z","abstract_excerpt":"Many problems in extremal combinatorics can be reduced to determining the independence number of a specific auxiliary hypergraph. We present two such problems, one from discrete geometry and one from hypergraph Tur\\'an theory. Using results on hypergraph colorings by Cooper-Mubayi and Li-Postle, we demonstrate that for those two problems the trivial lower bound on the independence number can be improved upon:\n  Erd\\H{o}s, Graham, Ruzsa and Taylor asked to determine the largest size, denoted by $g(n)$, of a subset $P$ of the grid $[n]^2$ such that every pair of points in $P$ span a different sl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.01499","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.01499/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":"2406.01499","created_at":"2026-07-05T08:26:40.523155+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.01499v1","created_at":"2026-07-05T08:26:40.523155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.01499","created_at":"2026-07-05T08:26:40.523155+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TY6Y6FN3GRK","created_at":"2026-07-05T08:26:40.523155+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TY6Y6FN3GRKOSFN","created_at":"2026-07-05T08:26:40.523155+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TY6Y6FN","created_at":"2026-07-05T08:26:40.523155+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.06935","citing_title":"On subsets of lattice cubes avoiding affine and spherical degeneracies","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5TY6Y6FN3GRKOSFNESO3WLFL6F","json":"https://pith.science/pith/5TY6Y6FN3GRKOSFNESO3WLFL6F.json","graph_json":"https://pith.science/api/pith-number/5TY6Y6FN3GRKOSFNESO3WLFL6F/graph.json","events_json":"https://pith.science/api/pith-number/5TY6Y6FN3GRKOSFNESO3WLFL6F/events.json","paper":"https://pith.science/paper/5TY6Y6FN"},"agent_actions":{"view_html":"https://pith.science/pith/5TY6Y6FN3GRKOSFNESO3WLFL6F","download_json":"https://pith.science/pith/5TY6Y6FN3GRKOSFNESO3WLFL6F.json","view_paper":"https://pith.science/paper/5TY6Y6FN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.01499&json=true","fetch_graph":"https://pith.science/api/pith-number/5TY6Y6FN3GRKOSFNESO3WLFL6F/graph.json","fetch_events":"https://pith.science/api/pith-number/5TY6Y6FN3GRKOSFNESO3WLFL6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TY6Y6FN3GRKOSFNESO3WLFL6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TY6Y6FN3GRKOSFNESO3WLFL6F/action/storage_attestation","attest_author":"https://pith.science/pith/5TY6Y6FN3GRKOSFNESO3WLFL6F/action/author_attestation","sign_citation":"https://pith.science/pith/5TY6Y6FN3GRKOSFNESO3WLFL6F/action/citation_signature","submit_replication":"https://pith.science/pith/5TY6Y6FN3GRKOSFNESO3WLFL6F/action/replication_record"}},"created_at":"2026-07-05T08:26:40.523155+00:00","updated_at":"2026-07-05T08:26:40.523155+00:00"}