{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UFXOSSCKBOWCWG2HDMXFTG6HUZ","short_pith_number":"pith:UFXOSSCK","schema_version":"1.0","canonical_sha256":"a16ee9484a0bac2b1b471b2e599bc7a6453d1e2113b6f95d3eda09b6c34da867","source":{"kind":"arxiv","id":"1512.04188","version":2},"attestation_state":"computed","paper":{"title":"Hypergraph Two-Coloring in the Streaming Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jaikumar Radhakrishnan, Rakesh Venkat, Saswata Shannigrahi","submitted_at":"2015-12-14T06:22:04Z","abstract_excerpt":"We consider space-efficient algorithms for two-coloring $n$-uniform hypergraphs $H=(V,E)$ in the streaming model, when the hyperedges arrive one at a time. It is known that any such hypergraph with at most $0.7 \\sqrt{\\frac{n}{\\ln n}} 2^n$ hyperedges has a two-coloring [Radhakrishnan & Srinivasan, RSA, 2000], which can be found deterministically in polynomial time, if allowed full access to the input.\n  1. Let $s^D(v, q, n)$ be the minimum space used by a deterministic one-pass streaming algorithm that on receiving an $n$-uniform hypergraph $H$ on $v$ vertices and $q$ hyperedges produces a prop"},"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":"1512.04188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-14T06:22:04Z","cross_cats_sorted":[],"title_canon_sha256":"7f762e5c0ad0c0fdac50ed6ecad8a34b9f97b0cc79fc7c1915e4a972b7a4c7a6","abstract_canon_sha256":"77aeee64c9559969091edc9921402684c9e0c7301490d4946e8cfae7aee57cee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:09.847682Z","signature_b64":"ro+cMoKSGl/N2oSeYlqEH1TMR1/qRT1KJQicISU59XvRiU2ihcQF/62G0zkYRTPZRLqhUJbuEwgjWI/2GEflBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a16ee9484a0bac2b1b471b2e599bc7a6453d1e2113b6f95d3eda09b6c34da867","last_reissued_at":"2026-05-18T00:16:09.847080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:09.847080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph Two-Coloring in the Streaming Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jaikumar Radhakrishnan, Rakesh Venkat, Saswata Shannigrahi","submitted_at":"2015-12-14T06:22:04Z","abstract_excerpt":"We consider space-efficient algorithms for two-coloring $n$-uniform hypergraphs $H=(V,E)$ in the streaming model, when the hyperedges arrive one at a time. It is known that any such hypergraph with at most $0.7 \\sqrt{\\frac{n}{\\ln n}} 2^n$ hyperedges has a two-coloring [Radhakrishnan & Srinivasan, RSA, 2000], which can be found deterministically in polynomial time, if allowed full access to the input.\n  1. Let $s^D(v, q, n)$ be the minimum space used by a deterministic one-pass streaming algorithm that on receiving an $n$-uniform hypergraph $H$ on $v$ vertices and $q$ hyperedges produces a prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04188","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":""},"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":"1512.04188","created_at":"2026-05-18T00:16:09.847193+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04188v2","created_at":"2026-05-18T00:16:09.847193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04188","created_at":"2026-05-18T00:16:09.847193+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFXOSSCKBOWC","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFXOSSCKBOWCWG2H","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFXOSSCK","created_at":"2026-05-18T12:29:44.643036+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/UFXOSSCKBOWCWG2HDMXFTG6HUZ","json":"https://pith.science/pith/UFXOSSCKBOWCWG2HDMXFTG6HUZ.json","graph_json":"https://pith.science/api/pith-number/UFXOSSCKBOWCWG2HDMXFTG6HUZ/graph.json","events_json":"https://pith.science/api/pith-number/UFXOSSCKBOWCWG2HDMXFTG6HUZ/events.json","paper":"https://pith.science/paper/UFXOSSCK"},"agent_actions":{"view_html":"https://pith.science/pith/UFXOSSCKBOWCWG2HDMXFTG6HUZ","download_json":"https://pith.science/pith/UFXOSSCKBOWCWG2HDMXFTG6HUZ.json","view_paper":"https://pith.science/paper/UFXOSSCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04188&json=true","fetch_graph":"https://pith.science/api/pith-number/UFXOSSCKBOWCWG2HDMXFTG6HUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UFXOSSCKBOWCWG2HDMXFTG6HUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFXOSSCKBOWCWG2HDMXFTG6HUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFXOSSCKBOWCWG2HDMXFTG6HUZ/action/storage_attestation","attest_author":"https://pith.science/pith/UFXOSSCKBOWCWG2HDMXFTG6HUZ/action/author_attestation","sign_citation":"https://pith.science/pith/UFXOSSCKBOWCWG2HDMXFTG6HUZ/action/citation_signature","submit_replication":"https://pith.science/pith/UFXOSSCKBOWCWG2HDMXFTG6HUZ/action/replication_record"}},"created_at":"2026-05-18T00:16:09.847193+00:00","updated_at":"2026-05-18T00:16:09.847193+00:00"}