{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GZ2QWLKEI2TOFGFRO4D45AWRNX","short_pith_number":"pith:GZ2QWLKE","schema_version":"1.0","canonical_sha256":"36750b2d4446a6e298b17707ce82d16dcf9f563693c22d43e137ad672c2c283a","source":{"kind":"arxiv","id":"1810.01731","version":1},"attestation_state":"computed","paper":{"title":"Judiciously 3-partitioning 3-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hunter Spink, Marius Tiba","submitted_at":"2018-10-03T13:33:05Z","abstract_excerpt":"Bollob\\'as, Reed and Thomason proved every $3$-uniform hypergraph $\\mathcal{H}$ with $m$ edges has a vertex-partition $V(\\mathcal{H})=V_1 \\sqcup V_2 \\sqcup V_3$ such that each part meets at least $\\frac{1}{3}(1-\\frac{1}{e})m$ edges, later improved to $0.6m$ by Halsegrave and improved asymptotically to $0.65m+o(m)$ by Ma and Yu. We improve this asymptotic bound to $\\frac{19}{27}m+o(m)$, which is best possible up to the error term, resolving a special case of a conjecture of Bollob\\'as and Scott."},"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":"1810.01731","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-03T13:33:05Z","cross_cats_sorted":[],"title_canon_sha256":"89a10822e7db09c0d308b45ad6aaecf3af6b2547450908403fea2e8b04815a56","abstract_canon_sha256":"dd188152dc8eae0a672e7e9a0becc895c8a5b3de0a3e4db331564c9cf6ab5e80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:11.152411Z","signature_b64":"MVPZJG2YmozVuJoqkLGBwgZsV4V+W5xCx4dunAEi7Uz++UAV/XSazc2iLaDLKJ1gEY7/kvvIV/NB9uudyT+fBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36750b2d4446a6e298b17707ce82d16dcf9f563693c22d43e137ad672c2c283a","last_reissued_at":"2026-05-18T00:04:11.151750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:11.151750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Judiciously 3-partitioning 3-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hunter Spink, Marius Tiba","submitted_at":"2018-10-03T13:33:05Z","abstract_excerpt":"Bollob\\'as, Reed and Thomason proved every $3$-uniform hypergraph $\\mathcal{H}$ with $m$ edges has a vertex-partition $V(\\mathcal{H})=V_1 \\sqcup V_2 \\sqcup V_3$ such that each part meets at least $\\frac{1}{3}(1-\\frac{1}{e})m$ edges, later improved to $0.6m$ by Halsegrave and improved asymptotically to $0.65m+o(m)$ by Ma and Yu. We improve this asymptotic bound to $\\frac{19}{27}m+o(m)$, which is best possible up to the error term, resolving a special case of a conjecture of Bollob\\'as and Scott."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01731","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":"1810.01731","created_at":"2026-05-18T00:04:11.151843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01731v1","created_at":"2026-05-18T00:04:11.151843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01731","created_at":"2026-05-18T00:04:11.151843+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZ2QWLKEI2TO","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZ2QWLKEI2TOFGFR","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZ2QWLKE","created_at":"2026-05-18T12:32:25.280505+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/GZ2QWLKEI2TOFGFRO4D45AWRNX","json":"https://pith.science/pith/GZ2QWLKEI2TOFGFRO4D45AWRNX.json","graph_json":"https://pith.science/api/pith-number/GZ2QWLKEI2TOFGFRO4D45AWRNX/graph.json","events_json":"https://pith.science/api/pith-number/GZ2QWLKEI2TOFGFRO4D45AWRNX/events.json","paper":"https://pith.science/paper/GZ2QWLKE"},"agent_actions":{"view_html":"https://pith.science/pith/GZ2QWLKEI2TOFGFRO4D45AWRNX","download_json":"https://pith.science/pith/GZ2QWLKEI2TOFGFRO4D45AWRNX.json","view_paper":"https://pith.science/paper/GZ2QWLKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01731&json=true","fetch_graph":"https://pith.science/api/pith-number/GZ2QWLKEI2TOFGFRO4D45AWRNX/graph.json","fetch_events":"https://pith.science/api/pith-number/GZ2QWLKEI2TOFGFRO4D45AWRNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZ2QWLKEI2TOFGFRO4D45AWRNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZ2QWLKEI2TOFGFRO4D45AWRNX/action/storage_attestation","attest_author":"https://pith.science/pith/GZ2QWLKEI2TOFGFRO4D45AWRNX/action/author_attestation","sign_citation":"https://pith.science/pith/GZ2QWLKEI2TOFGFRO4D45AWRNX/action/citation_signature","submit_replication":"https://pith.science/pith/GZ2QWLKEI2TOFGFRO4D45AWRNX/action/replication_record"}},"created_at":"2026-05-18T00:04:11.151843+00:00","updated_at":"2026-05-18T00:04:11.151843+00:00"}