{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AZU32R74Z47Y5KSPWKKP62FUBL","short_pith_number":"pith:AZU32R74","canonical_record":{"source":{"id":"1506.06444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T02:20:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2053505114d809e3a72d3263efef900b3dbe381be59480db0d2da76f8a956910","abstract_canon_sha256":"36914fc7ce9ca89645833416ad74edb826990a5942b54c0b5ebe9a9eb5b3ea9f"},"schema_version":"1.0"},"canonical_sha256":"0669bd47fccf3f8eaa4fb294ff68b40aca44d0c2f4bc2c1f067dfd15637c35a3","source":{"kind":"arxiv","id":"1506.06444","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06444","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06444v1","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06444","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"pith_short_12","alias_value":"AZU32R74Z47Y","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"AZU32R74Z47Y5KSP","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"AZU32R74","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AZU32R74Z47Y5KSPWKKP62FUBL","target":"record","payload":{"canonical_record":{"source":{"id":"1506.06444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T02:20:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2053505114d809e3a72d3263efef900b3dbe381be59480db0d2da76f8a956910","abstract_canon_sha256":"36914fc7ce9ca89645833416ad74edb826990a5942b54c0b5ebe9a9eb5b3ea9f"},"schema_version":"1.0"},"canonical_sha256":"0669bd47fccf3f8eaa4fb294ff68b40aca44d0c2f4bc2c1f067dfd15637c35a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:45.211368Z","signature_b64":"UvXvO1GOhOjr/myVe04w/5mo3gQxQWf+p8/VL1ZoyW7C2Kbi/D0OsAOBznN5gnGMztYq71Xq9dAu81f2lJP1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0669bd47fccf3f8eaa4fb294ff68b40aca44d0c2f4bc2c1f067dfd15637c35a3","last_reissued_at":"2026-05-18T01:41:45.210744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:45.210744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.06444","source_version":1,"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-05-18T01:41:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PfzJFcUGeKI0Bh2/bxqaePKQleu99SReFrUbSeSzLmBP6Dq30Kyd4O14lPhtUYsovWn37D2ypfAlT4HrtcJ3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:42:38.443412Z"},"content_sha256":"c7c8258bfba4479b92ec14babacf454f20d5d68126259c7fe67a4ac726b45da2","schema_version":"1.0","event_id":"sha256:c7c8258bfba4479b92ec14babacf454f20d5d68126259c7fe67a4ac726b45da2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AZU32R74Z47Y5KSPWKKP62FUBL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Hypergraph Coloring under Low-discrepancy and Related Promises","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Euiwoong Lee, Venkatesan Guruswami, Vijay V. S. P. Bhattiprolu","submitted_at":"2015-06-22T02:20:22Z","abstract_excerpt":"A hypergraph is said to be $\\chi$-colorable if its vertices can be colored with $\\chi$ colors so that no hyperedge is monochromatic. $2$-colorability is a fundamental property (called Property B) of hypergraphs and is extensively studied in combinatorics. Algorithmically, however, given a $2$-colorable $k$-uniform hypergraph, it is NP-hard to find a $2$-coloring miscoloring fewer than a fraction $2^{-k+1}$ of hyperedges (which is achieved by a random $2$-coloring), and the best algorithms to color the hypergraph properly require $\\approx n^{1-1/k}$ colors, approaching the trivial bound of $n$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06444","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"},"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-05-18T01:41:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ScRKMfxNAwXoSxHRg5h8nJ4cpgzkgKu2udv2qVAVG+HZz6bOPQ2aiFiIMk6b9UcyLsq2P4yCUodVWIua9G1qCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:42:38.444096Z"},"content_sha256":"fcbdfd29eb11b91f0af926ebd10c21888b5f39d631fb3c4c530e77786a4a6a0c","schema_version":"1.0","event_id":"sha256:fcbdfd29eb11b91f0af926ebd10c21888b5f39d631fb3c4c530e77786a4a6a0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZU32R74Z47Y5KSPWKKP62FUBL/bundle.json","state_url":"https://pith.science/pith/AZU32R74Z47Y5KSPWKKP62FUBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZU32R74Z47Y5KSPWKKP62FUBL/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-06-09T07:42:38Z","links":{"resolver":"https://pith.science/pith/AZU32R74Z47Y5KSPWKKP62FUBL","bundle":"https://pith.science/pith/AZU32R74Z47Y5KSPWKKP62FUBL/bundle.json","state":"https://pith.science/pith/AZU32R74Z47Y5KSPWKKP62FUBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZU32R74Z47Y5KSPWKKP62FUBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AZU32R74Z47Y5KSPWKKP62FUBL","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":"36914fc7ce9ca89645833416ad74edb826990a5942b54c0b5ebe9a9eb5b3ea9f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T02:20:22Z","title_canon_sha256":"2053505114d809e3a72d3263efef900b3dbe381be59480db0d2da76f8a956910"},"schema_version":"1.0","source":{"id":"1506.06444","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06444","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06444v1","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06444","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"pith_short_12","alias_value":"AZU32R74Z47Y","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"AZU32R74Z47Y5KSP","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"AZU32R74","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:fcbdfd29eb11b91f0af926ebd10c21888b5f39d631fb3c4c530e77786a4a6a0c","target":"graph","created_at":"2026-05-18T01:41:45Z","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"},"paper":{"abstract_excerpt":"A hypergraph is said to be $\\chi$-colorable if its vertices can be colored with $\\chi$ colors so that no hyperedge is monochromatic. $2$-colorability is a fundamental property (called Property B) of hypergraphs and is extensively studied in combinatorics. Algorithmically, however, given a $2$-colorable $k$-uniform hypergraph, it is NP-hard to find a $2$-coloring miscoloring fewer than a fraction $2^{-k+1}$ of hyperedges (which is achieved by a random $2$-coloring), and the best algorithms to color the hypergraph properly require $\\approx n^{1-1/k}$ colors, approaching the trivial bound of $n$ ","authors_text":"Euiwoong Lee, Venkatesan Guruswami, Vijay V. S. P. Bhattiprolu","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T02:20:22Z","title":"Approximate Hypergraph Coloring under Low-discrepancy and Related Promises"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06444","kind":"arxiv","version":1},"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:c7c8258bfba4479b92ec14babacf454f20d5d68126259c7fe67a4ac726b45da2","target":"record","created_at":"2026-05-18T01:41:45Z","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":"36914fc7ce9ca89645833416ad74edb826990a5942b54c0b5ebe9a9eb5b3ea9f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T02:20:22Z","title_canon_sha256":"2053505114d809e3a72d3263efef900b3dbe381be59480db0d2da76f8a956910"},"schema_version":"1.0","source":{"id":"1506.06444","kind":"arxiv","version":1}},"canonical_sha256":"0669bd47fccf3f8eaa4fb294ff68b40aca44d0c2f4bc2c1f067dfd15637c35a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0669bd47fccf3f8eaa4fb294ff68b40aca44d0c2f4bc2c1f067dfd15637c35a3","first_computed_at":"2026-05-18T01:41:45.210744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:41:45.210744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UvXvO1GOhOjr/myVe04w/5mo3gQxQWf+p8/VL1ZoyW7C2Kbi/D0OsAOBznN5gnGMztYq71Xq9dAu81f2lJP1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:41:45.211368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.06444","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7c8258bfba4479b92ec14babacf454f20d5d68126259c7fe67a4ac726b45da2","sha256:fcbdfd29eb11b91f0af926ebd10c21888b5f39d631fb3c4c530e77786a4a6a0c"],"state_sha256":"da5119d16d9e7649bdcfa3260c3e9485c508c2ac9c77366187e09f1663c6c211"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fX5jFwYfesY43MGEJ6bT+zyh3l33a9GUuikbj1LvdHGpEh4x5DeCB2wMkmimLDTByxXEjjvwYHW9n7PkRMCJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:42:38.447835Z","bundle_sha256":"55bb9036fbe9f4aa7631a9def393e04dd0666a1eb4a11aa74158b1b6a8d19550"}}