{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:TJWNFHJRY6CETKCKEA24HGZMII","short_pith_number":"pith:TJWNFHJR","canonical_record":{"source":{"id":"2103.10990","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-03-19T19:17:14Z","cross_cats_sorted":[],"title_canon_sha256":"a9951273b9b4de144f89f2433bca14dd88c3bceb7d05da189cb93e3d6261775c","abstract_canon_sha256":"9383f32ede6b65caf0ca79758594fee76122b457c0dcd8b8208d8dc170acc808"},"schema_version":"1.0"},"canonical_sha256":"9a6cd29d31c78449a84a2035c39b2c423cbb3e3eb525d5a3694ef6a275899009","source":{"kind":"arxiv","id":"2103.10990","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.10990","created_at":"2026-07-05T02:24:55Z"},{"alias_kind":"arxiv_version","alias_value":"2103.10990v1","created_at":"2026-07-05T02:24:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.10990","created_at":"2026-07-05T02:24:55Z"},{"alias_kind":"pith_short_12","alias_value":"TJWNFHJRY6CE","created_at":"2026-07-05T02:24:55Z"},{"alias_kind":"pith_short_16","alias_value":"TJWNFHJRY6CETKCK","created_at":"2026-07-05T02:24:55Z"},{"alias_kind":"pith_short_8","alias_value":"TJWNFHJR","created_at":"2026-07-05T02:24:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:TJWNFHJRY6CETKCKEA24HGZMII","target":"record","payload":{"canonical_record":{"source":{"id":"2103.10990","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-03-19T19:17:14Z","cross_cats_sorted":[],"title_canon_sha256":"a9951273b9b4de144f89f2433bca14dd88c3bceb7d05da189cb93e3d6261775c","abstract_canon_sha256":"9383f32ede6b65caf0ca79758594fee76122b457c0dcd8b8208d8dc170acc808"},"schema_version":"1.0"},"canonical_sha256":"9a6cd29d31c78449a84a2035c39b2c423cbb3e3eb525d5a3694ef6a275899009","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:24:55.791089Z","signature_b64":"j6/uwU6/0WeO8AQetyU5FrUsDwIb6xDsZH4WBmvO/hmShO6QxNHp52TCsR84d0x/fGyOaUd1IzgjKBqGdM79Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a6cd29d31c78449a84a2035c39b2c423cbb3e3eb525d5a3694ef6a275899009","last_reissued_at":"2026-07-05T02:24:55.790710Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:24:55.790710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.10990","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-07-05T02:24:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N+WQ4K8BJ+iyEM7vvmQhj6wtJXOJlBJyerASITdDc284AA0/l3MqlF4W6IK48trvOnjf8qEMrNTlA6s/QD/vAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T07:19:25.728817Z"},"content_sha256":"d50ef5ad1f76db1b9dc07ee50eff32aefa3dd34f6644cc84f1beabcf1895640c","schema_version":"1.0","event_id":"sha256:d50ef5ad1f76db1b9dc07ee50eff32aefa3dd34f6644cc84f1beabcf1895640c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:TJWNFHJRY6CETKCKEA24HGZMII","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Computation Algorithms for Coloring of Uniform Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrzej Dorobisz, Jakub Kozik","submitted_at":"2021-03-19T19:17:14Z","abstract_excerpt":"We present a progress on local computation algorithms for two coloring of $k$-uniform hypergraphs. We focus on instances that satisfy strengthened assumption of Local Lemma of the form $2^{1-\\alpha k} (\\Delta+1) e < 1$, where $\\Delta$ is the bound on the maximum edge degree of the hypergraph. We discuss how previous works on the subject can be used to obtain an algorithm that works in polylogarithmic time per query for $\\alpha$ up to about $0.139$. Then, we present a procedure that, within similar bounds on running time, solves wider range of instances by allowing $\\alpha$ at most about $0.227"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.10990","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.10990/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-05T02:24:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VInIukTsNbco6u5HiY/B6K+3oCVzGOFtw44Fr4Lf+IICMiL7IKjypqp7tII/KRSNx2gaKHqslAoBZE8SRGLvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T07:19:25.729569Z"},"content_sha256":"90c79a26fa607800ecf5ed323b4a959056de0bbbe447f86673dcd5f696e02bb5","schema_version":"1.0","event_id":"sha256:90c79a26fa607800ecf5ed323b4a959056de0bbbe447f86673dcd5f696e02bb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJWNFHJRY6CETKCKEA24HGZMII/bundle.json","state_url":"https://pith.science/pith/TJWNFHJRY6CETKCKEA24HGZMII/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJWNFHJRY6CETKCKEA24HGZMII/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-11T07:19:25Z","links":{"resolver":"https://pith.science/pith/TJWNFHJRY6CETKCKEA24HGZMII","bundle":"https://pith.science/pith/TJWNFHJRY6CETKCKEA24HGZMII/bundle.json","state":"https://pith.science/pith/TJWNFHJRY6CETKCKEA24HGZMII/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJWNFHJRY6CETKCKEA24HGZMII/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:TJWNFHJRY6CETKCKEA24HGZMII","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":"9383f32ede6b65caf0ca79758594fee76122b457c0dcd8b8208d8dc170acc808","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-03-19T19:17:14Z","title_canon_sha256":"a9951273b9b4de144f89f2433bca14dd88c3bceb7d05da189cb93e3d6261775c"},"schema_version":"1.0","source":{"id":"2103.10990","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.10990","created_at":"2026-07-05T02:24:55Z"},{"alias_kind":"arxiv_version","alias_value":"2103.10990v1","created_at":"2026-07-05T02:24:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.10990","created_at":"2026-07-05T02:24:55Z"},{"alias_kind":"pith_short_12","alias_value":"TJWNFHJRY6CE","created_at":"2026-07-05T02:24:55Z"},{"alias_kind":"pith_short_16","alias_value":"TJWNFHJRY6CETKCK","created_at":"2026-07-05T02:24:55Z"},{"alias_kind":"pith_short_8","alias_value":"TJWNFHJR","created_at":"2026-07-05T02:24:55Z"}],"graph_snapshots":[{"event_id":"sha256:90c79a26fa607800ecf5ed323b4a959056de0bbbe447f86673dcd5f696e02bb5","target":"graph","created_at":"2026-07-05T02:24:55Z","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/2103.10990/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a progress on local computation algorithms for two coloring of $k$-uniform hypergraphs. We focus on instances that satisfy strengthened assumption of Local Lemma of the form $2^{1-\\alpha k} (\\Delta+1) e < 1$, where $\\Delta$ is the bound on the maximum edge degree of the hypergraph. We discuss how previous works on the subject can be used to obtain an algorithm that works in polylogarithmic time per query for $\\alpha$ up to about $0.139$. Then, we present a procedure that, within similar bounds on running time, solves wider range of instances by allowing $\\alpha$ at most about $0.227","authors_text":"Andrzej Dorobisz, Jakub Kozik","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-03-19T19:17:14Z","title":"Local Computation Algorithms for Coloring of Uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.10990","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:d50ef5ad1f76db1b9dc07ee50eff32aefa3dd34f6644cc84f1beabcf1895640c","target":"record","created_at":"2026-07-05T02:24:55Z","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":"9383f32ede6b65caf0ca79758594fee76122b457c0dcd8b8208d8dc170acc808","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-03-19T19:17:14Z","title_canon_sha256":"a9951273b9b4de144f89f2433bca14dd88c3bceb7d05da189cb93e3d6261775c"},"schema_version":"1.0","source":{"id":"2103.10990","kind":"arxiv","version":1}},"canonical_sha256":"9a6cd29d31c78449a84a2035c39b2c423cbb3e3eb525d5a3694ef6a275899009","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a6cd29d31c78449a84a2035c39b2c423cbb3e3eb525d5a3694ef6a275899009","first_computed_at":"2026-07-05T02:24:55.790710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:24:55.790710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j6/uwU6/0WeO8AQetyU5FrUsDwIb6xDsZH4WBmvO/hmShO6QxNHp52TCsR84d0x/fGyOaUd1IzgjKBqGdM79Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T02:24:55.791089Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.10990","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d50ef5ad1f76db1b9dc07ee50eff32aefa3dd34f6644cc84f1beabcf1895640c","sha256:90c79a26fa607800ecf5ed323b4a959056de0bbbe447f86673dcd5f696e02bb5"],"state_sha256":"fa714bddd0cee8d5dbd2c9e5d6baddb04c6c81a53eaab25eac0b6febf6c9a1bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"py7oKlc1+UYpNfekYpFHk8nJQ4swQhV3X40EDJj3kA+QdZ05f0IOu7MYgLGw1xoP94p9Kh1HeGnVoBRCpHFrBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T07:19:25.734542Z","bundle_sha256":"04867760928bee29c01f3db0a874904e3d287ff04c672c7e657765f5a5e00ec5"}}