{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:S5HHMAYXXF5NEFYL3IE4LDBI4U","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":"f28d310ef0d125a0ecc3ba5b031a792ab2a46c915e06f9689d90a6d1e143805b","cross_cats_sorted":["cs.DC","cs.DS","math.LO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-06-03T18:15:07Z","title_canon_sha256":"96aee9eb8db6abae3a6bdf9625d5dcea4c3731289abb4a31237db4190253d48e"},"schema_version":"1.0","source":{"id":"2106.02066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.02066","created_at":"2026-07-05T02:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"2106.02066v1","created_at":"2026-07-05T02:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.02066","created_at":"2026-07-05T02:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"S5HHMAYXXF5N","created_at":"2026-07-05T02:46:14Z"},{"alias_kind":"pith_short_16","alias_value":"S5HHMAYXXF5NEFYL","created_at":"2026-07-05T02:46:14Z"},{"alias_kind":"pith_short_8","alias_value":"S5HHMAYX","created_at":"2026-07-05T02:46:14Z"}],"graph_snapshots":[{"event_id":"sha256:b35aa20b3a9b4d6bd7e8b749455e07e81b751abf5e015dd8090d81b5c64a7652","target":"graph","created_at":"2026-07-05T02:46:14Z","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/2106.02066/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study connections between distributed local algorithms, finitary factors of iid processes, and descriptive combinatorics in the context of regular trees.\n  We extend the Borel determinacy technique of Marks coming from descriptive combinatorics and adapt it to the area of distributed computing. Using this technique, we prove deterministic distributed $\\Omega(\\log n)$-round lower bounds for problems from a natural class of homomorphism problems. Interestingly, these lower bounds seem beyond the current reach of the powerful round elimination technique responsible for all substantial locality","authors_text":"Christoph Grunau, Jan Greb\\'ik, Sebastian Brandt, V\\'aclav Rozho\\v{n}, Yi-Jun Chang, Zolt\\'an Vidny\\'anszky","cross_cats":["cs.DC","cs.DS","math.LO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-06-03T18:15:07Z","title":"Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.02066","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:df8a0a26c968679d4c5f1ae5f3f71949facda5d0e351e5472c35c941639b6228","target":"record","created_at":"2026-07-05T02:46:14Z","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":"f28d310ef0d125a0ecc3ba5b031a792ab2a46c915e06f9689d90a6d1e143805b","cross_cats_sorted":["cs.DC","cs.DS","math.LO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-06-03T18:15:07Z","title_canon_sha256":"96aee9eb8db6abae3a6bdf9625d5dcea4c3731289abb4a31237db4190253d48e"},"schema_version":"1.0","source":{"id":"2106.02066","kind":"arxiv","version":1}},"canonical_sha256":"974e760317b97ad2170bda09c58c28e53d77da768187eaa6826bafd6f4eb6d9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"974e760317b97ad2170bda09c58c28e53d77da768187eaa6826bafd6f4eb6d9e","first_computed_at":"2026-07-05T02:46:14.914939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:46:14.914939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"okHpOYWFqylhLoaKcmPJHSlNoFjR24bRkUCFx9wdDZ4gT+ztxUH/mHcAjCqjLi1yH41IHWM0JXUbK+tz/5laCw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:46:14.915432Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.02066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df8a0a26c968679d4c5f1ae5f3f71949facda5d0e351e5472c35c941639b6228","sha256:b35aa20b3a9b4d6bd7e8b749455e07e81b751abf5e015dd8090d81b5c64a7652"],"state_sha256":"b77ae54cacb982c53b071fbd713cc981b7de03574cec338f8f7450ca29e49126"}