{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2IDZQJKQ6OP5TEQQOKPMIGNVBH","short_pith_number":"pith:2IDZQJKQ","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"},"canonical_sha256":"d207982550f39fd99210729ec419b509e9f4bf9db8f95cdd867ac4ba6bf1c0b0","source":{"kind":"arxiv","id":"2404.05026","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.05026","created_at":"2026-07-05T11:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"2404.05026v2","created_at":"2026-07-05T11:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05026","created_at":"2026-07-05T11:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"2IDZQJKQ6OP5","created_at":"2026-07-05T11:02:38Z"},{"alias_kind":"pith_short_16","alias_value":"2IDZQJKQ6OP5TEQQ","created_at":"2026-07-05T11:02:38Z"},{"alias_kind":"pith_short_8","alias_value":"2IDZQJKQ","created_at":"2026-07-05T11:02:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2IDZQJKQ6OP5TEQQOKPMIGNVBH","target":"record","payload":{"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"},"canonical_sha256":"d207982550f39fd99210729ec419b509e9f4bf9db8f95cdd867ac4ba6bf1c0b0","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"},"source_kind":"arxiv","source_id":"2404.05026","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCBN5smvVEk6p2+m/1n/+sAvOzf8+nu6++lSOsv4GW61DgabS28rl9/Iy3rwPKKMakxGgrXOpvJppGxs24NxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T07:46:11.412153Z"},"content_sha256":"b4e6007b6707ecb7da5edd4094b123d8b1b5e878c789a902383f8876599d8038","schema_version":"1.0","event_id":"sha256:b4e6007b6707ecb7da5edd4094b123d8b1b5e878c789a902383f8876599d8038"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2IDZQJKQ6OP5TEQQOKPMIGNVBH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NdmHvfjes4wgNDgFZe9lSNr+yXFG+Kkr/OygvKErWV65FBt2ItHJMv7NENblHBr6LobJVDsYWenO88SbejxLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T07:46:11.413362Z"},"content_sha256":"6baa44d6a54ff10685e5d481559675e23e5e64460c285b30ba923535e1e079be","schema_version":"1.0","event_id":"sha256:6baa44d6a54ff10685e5d481559675e23e5e64460c285b30ba923535e1e079be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH/bundle.json","state_url":"https://pith.science/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-21T07:46:11Z","links":{"resolver":"https://pith.science/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH","bundle":"https://pith.science/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH/bundle.json","state":"https://pith.science/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2IDZQJKQ6OP5TEQQOKPMIGNVBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2IDZQJKQ6OP5TEQQOKPMIGNVBH","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":"44c4a951493abefd4206c349909089fd181055d6f2caeb958506abc8871de4f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-07T17:38:03Z","title_canon_sha256":"8e608db73b7e9013aa37f7d735fc585cff4249d6cb64e03d1976451a32ff3eb8"},"schema_version":"1.0","source":{"id":"2404.05026","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.05026","created_at":"2026-07-05T11:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"2404.05026v2","created_at":"2026-07-05T11:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05026","created_at":"2026-07-05T11:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"2IDZQJKQ6OP5","created_at":"2026-07-05T11:02:38Z"},{"alias_kind":"pith_short_16","alias_value":"2IDZQJKQ6OP5TEQQ","created_at":"2026-07-05T11:02:38Z"},{"alias_kind":"pith_short_8","alias_value":"2IDZQJKQ","created_at":"2026-07-05T11:02:38Z"}],"graph_snapshots":[{"event_id":"sha256:6baa44d6a54ff10685e5d481559675e23e5e64460c285b30ba923535e1e079be","target":"graph","created_at":"2026-07-05T11:02:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.05026/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Boyoon Lee, Brendan Nagle, Theodore Molla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-07T17:38:03Z","title":"On two-coloring bipartite uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05026","kind":"arxiv","version":2},"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:b4e6007b6707ecb7da5edd4094b123d8b1b5e878c789a902383f8876599d8038","target":"record","created_at":"2026-07-05T11:02:38Z","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":"44c4a951493abefd4206c349909089fd181055d6f2caeb958506abc8871de4f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-07T17:38:03Z","title_canon_sha256":"8e608db73b7e9013aa37f7d735fc585cff4249d6cb64e03d1976451a32ff3eb8"},"schema_version":"1.0","source":{"id":"2404.05026","kind":"arxiv","version":2}},"canonical_sha256":"d207982550f39fd99210729ec419b509e9f4bf9db8f95cdd867ac4ba6bf1c0b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d207982550f39fd99210729ec419b509e9f4bf9db8f95cdd867ac4ba6bf1c0b0","first_computed_at":"2026-07-05T11:02:38.490221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:02:38.490221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sgzx/TF17V4Uqqh/Z5DbaqtGhxH8dqN3lfqNv/kb0l295tqXUf77JveItQIos+DI+LLtT4YGL11QO5Zmn1NsAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:02:38.490736Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.05026","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4e6007b6707ecb7da5edd4094b123d8b1b5e878c789a902383f8876599d8038","sha256:6baa44d6a54ff10685e5d481559675e23e5e64460c285b30ba923535e1e079be"],"state_sha256":"994b9e934c7526524edc4324573646d97292342a1eb2178cf6083fded1ecec51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3F9RXIfNbR5iFQycNiVXTsVd/GpnY8RcmmfkG/sDnBkvtvmGWVSPAyh6T49HX9ZOhWXEPC7NqXwH3lHcnXOyCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T07:46:11.419807Z","bundle_sha256":"cb81c7fa27a4c9f052eafc9a34cbadc0e21680ed0e58b29c9b5d4939969ee0f3"}}