{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2IDZQJKQ6OP5TEQQOKPMIGNVBH","short_pith_number":"pith:2IDZQJKQ","schema_version":"1.0","canonical_sha256":"d207982550f39fd99210729ec419b509e9f4bf9db8f95cdd867ac4ba6bf1c0b0","source":{"kind":"arxiv","id":"2404.05026","version":2},"attestation_state":"computed","paper":{"title":"On two-coloring bipartite uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boyoon Lee, Brendan Nagle, Theodore Molla","submitted_at":"2024-04-07T17:38:03Z","abstract_excerpt":"Of a given bipartite graph $G = (V, E)$, it is elementary to construct a bipartition in time $O(|V| + |E|)$. For a given $k$-graph $H = H^{(k)}$ with $k \\geq 3$ fixed, Lov\\'asz proved that deciding whether $H$ is bipartite is NP-complete. Let $\\mathcal{B}_n$ denote the collection of all $[n]$-vertex bipartite $k$-graphs. We construct, of a given $H \\in \\mathcal{B}_n$, a bipartition in time averaging $O(n^k)$ over the class $\\mathcal{B}_n$. We provide two proofs of our result. When $k = 3$, this result expedites one of Person and Schacht."},"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":"2404.05026","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-07T17:38:03Z","cross_cats_sorted":[],"title_canon_sha256":"8e608db73b7e9013aa37f7d735fc585cff4249d6cb64e03d1976451a32ff3eb8","abstract_canon_sha256":"44c4a951493abefd4206c349909089fd181055d6f2caeb958506abc8871de4f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:38.490736Z","signature_b64":"sgzx/TF17V4Uqqh/Z5DbaqtGhxH8dqN3lfqNv/kb0l295tqXUf77JveItQIos+DI+LLtT4YGL11QO5Zmn1NsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d207982550f39fd99210729ec419b509e9f4bf9db8f95cdd867ac4ba6bf1c0b0","last_reissued_at":"2026-07-05T11:02:38.490221Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:38.490221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On two-coloring bipartite uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boyoon Lee, Brendan Nagle, Theodore Molla","submitted_at":"2024-04-07T17:38:03Z","abstract_excerpt":"Of a given bipartite graph $G = (V, E)$, it is elementary to construct a bipartition in time $O(|V| + |E|)$. For a given $k$-graph $H = H^{(k)}$ with $k \\geq 3$ fixed, Lov\\'asz proved that deciding whether $H$ is bipartite is NP-complete. Let $\\mathcal{B}_n$ denote the collection of all $[n]$-vertex bipartite $k$-graphs. We construct, of a given $H \\in \\mathcal{B}_n$, a bipartition in time averaging $O(n^k)$ over the class $\\mathcal{B}_n$. We provide two proofs of our result. When $k = 3$, this result expedites one of Person and Schacht."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05026","kind":"arxiv","version":2},"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/2404.05026/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":"2404.05026","created_at":"2026-07-05T11:02:38.490282+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.05026v2","created_at":"2026-07-05T11:02:38.490282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05026","created_at":"2026-07-05T11:02:38.490282+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IDZQJKQ6OP5","created_at":"2026-07-05T11:02:38.490282+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IDZQJKQ6OP5TEQQ","created_at":"2026-07-05T11:02:38.490282+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IDZQJKQ","created_at":"2026-07-05T11:02:38.490282+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.10691","citing_title":"A Fast Coloring Oracle for Average Case Hypergraphs","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH","json":"https://pith.science/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH.json","graph_json":"https://pith.science/api/pith-number/2IDZQJKQ6OP5TEQQOKPMIGNVBH/graph.json","events_json":"https://pith.science/api/pith-number/2IDZQJKQ6OP5TEQQOKPMIGNVBH/events.json","paper":"https://pith.science/paper/2IDZQJKQ"},"agent_actions":{"view_html":"https://pith.science/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH","download_json":"https://pith.science/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH.json","view_paper":"https://pith.science/paper/2IDZQJKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.05026&json=true","fetch_graph":"https://pith.science/api/pith-number/2IDZQJKQ6OP5TEQQOKPMIGNVBH/graph.json","fetch_events":"https://pith.science/api/pith-number/2IDZQJKQ6OP5TEQQOKPMIGNVBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH/action/storage_attestation","attest_author":"https://pith.science/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH/action/author_attestation","sign_citation":"https://pith.science/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH/action/citation_signature","submit_replication":"https://pith.science/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH/action/replication_record"}},"created_at":"2026-07-05T11:02:38.490282+00:00","updated_at":"2026-07-05T11:02:38.490282+00:00"}