{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7PNCCZ4GXTZAO5F7U37KF6KDNU","short_pith_number":"pith:7PNCCZ4G","schema_version":"1.0","canonical_sha256":"fbda216786bcf20774bfa6fea2f9436d2c8e30c50f91b05934a1731ad798f4c8","source":{"kind":"arxiv","id":"2409.13795","version":2},"attestation_state":"computed","paper":{"title":"Local problems in trees across a wide range of distributed models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anubhav Dhar, Augusto Modanese, Eli Kujawa, Henrik Lievonen, Jan Studen\\'y, Jukka Suomela, Mikail Muftuoglu","submitted_at":"2024-09-20T12:34:21Z","abstract_excerpt":"The randomized online-LOCAL model captures a number of models of computing; it is at least as strong as all of these models:\n  - the classical LOCAL model of distributed graph algorithms,\n  - the quantum version of the LOCAL model,\n  - finitely dependent distributions [e.g. Holroyd 2016],\n  - any model that does not violate physical causality [Gavoille, Kosowski, Markiewicz, DISC 2009],\n  - the SLOCAL model [Ghaffari, Kuhn, Maus, STOC 2017], and\n  - the dynamic-LOCAL and online-LOCAL models [Akbari et al., ICALP 2023].\n  In general, the online-LOCAL model can be much stronger than the LOCAL mo"},"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":"2409.13795","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-09-20T12:34:21Z","cross_cats_sorted":[],"title_canon_sha256":"df4425ea26a86b4bb2f96ce4c6e1a03140d18ea350df5ac2698dc54b8ad88364","abstract_canon_sha256":"2eb52fdbba9221546e8a8a674cc52a7b655018140796c1b0ca4795331132ab6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:52.250652Z","signature_b64":"Qec308xz/2x2dDnTbEkf0+ff3arTrDHpzw7mV8WuurMxC9K3TX5TAqCLuT2rZ9jxC6a5M5X8fqwxcuakvfJICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbda216786bcf20774bfa6fea2f9436d2c8e30c50f91b05934a1731ad798f4c8","last_reissued_at":"2026-07-05T09:50:52.250159Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:52.250159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local problems in trees across a wide range of distributed models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anubhav Dhar, Augusto Modanese, Eli Kujawa, Henrik Lievonen, Jan Studen\\'y, Jukka Suomela, Mikail Muftuoglu","submitted_at":"2024-09-20T12:34:21Z","abstract_excerpt":"The randomized online-LOCAL model captures a number of models of computing; it is at least as strong as all of these models:\n  - the classical LOCAL model of distributed graph algorithms,\n  - the quantum version of the LOCAL model,\n  - finitely dependent distributions [e.g. Holroyd 2016],\n  - any model that does not violate physical causality [Gavoille, Kosowski, Markiewicz, DISC 2009],\n  - the SLOCAL model [Ghaffari, Kuhn, Maus, STOC 2017], and\n  - the dynamic-LOCAL and online-LOCAL models [Akbari et al., ICALP 2023].\n  In general, the online-LOCAL model can be much stronger than the LOCAL mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.13795","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/2409.13795/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2409.13795","created_at":"2026-07-05T09:50:52.250219+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.13795v2","created_at":"2026-07-05T09:50:52.250219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.13795","created_at":"2026-07-05T09:50:52.250219+00:00"},{"alias_kind":"pith_short_12","alias_value":"7PNCCZ4GXTZA","created_at":"2026-07-05T09:50:52.250219+00:00"},{"alias_kind":"pith_short_16","alias_value":"7PNCCZ4GXTZAO5F7","created_at":"2026-07-05T09:50:52.250219+00:00"},{"alias_kind":"pith_short_8","alias_value":"7PNCCZ4G","created_at":"2026-07-05T09:50:52.250219+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/7PNCCZ4GXTZAO5F7U37KF6KDNU","json":"https://pith.science/pith/7PNCCZ4GXTZAO5F7U37KF6KDNU.json","graph_json":"https://pith.science/api/pith-number/7PNCCZ4GXTZAO5F7U37KF6KDNU/graph.json","events_json":"https://pith.science/api/pith-number/7PNCCZ4GXTZAO5F7U37KF6KDNU/events.json","paper":"https://pith.science/paper/7PNCCZ4G"},"agent_actions":{"view_html":"https://pith.science/pith/7PNCCZ4GXTZAO5F7U37KF6KDNU","download_json":"https://pith.science/pith/7PNCCZ4GXTZAO5F7U37KF6KDNU.json","view_paper":"https://pith.science/paper/7PNCCZ4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.13795&json=true","fetch_graph":"https://pith.science/api/pith-number/7PNCCZ4GXTZAO5F7U37KF6KDNU/graph.json","fetch_events":"https://pith.science/api/pith-number/7PNCCZ4GXTZAO5F7U37KF6KDNU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7PNCCZ4GXTZAO5F7U37KF6KDNU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7PNCCZ4GXTZAO5F7U37KF6KDNU/action/storage_attestation","attest_author":"https://pith.science/pith/7PNCCZ4GXTZAO5F7U37KF6KDNU/action/author_attestation","sign_citation":"https://pith.science/pith/7PNCCZ4GXTZAO5F7U37KF6KDNU/action/citation_signature","submit_replication":"https://pith.science/pith/7PNCCZ4GXTZAO5F7U37KF6KDNU/action/replication_record"}},"created_at":"2026-07-05T09:50:52.250219+00:00","updated_at":"2026-07-05T09:50:52.250219+00:00"}