{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DCL425AME644S2JAPMPNEEPALC","short_pith_number":"pith:DCL425AM","schema_version":"1.0","canonical_sha256":"1897cd740c27b9c969207b1ed211e058b3acf575c08820fce41d0074832f8ea1","source":{"kind":"arxiv","id":"1705.07327","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Abdolhamid Ghodselahi, Fabian Kuhn","submitted_at":"2017-05-20T16:25:22Z","abstract_excerpt":"The Arrow protocol is a simple and elegant protocol to coordinate exclusive access to a shared object in a network. The protocol solves the underlying distributed queueing problem by using path reversal on a pre-computed spanning tree (or any other tree topology simulated on top of the given network).\n  It is known that the Arrow protocol solves the problem with a competitive ratio of O(log D) on trees of diameter D. This implies a distributed queueing algorithm with competitive ratio O(s*log D) for general networks with a spanning tree of diameter D and stretch s. In this work we show that wh"},"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":"1705.07327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-20T16:25:22Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"78ad6064d71898f43229d9a766321279dd684b2590facb7b90b2cfe225bce3a4","abstract_canon_sha256":"fbd69f479504265bd9313c98199d0a7e1d76d3254b5efce3037bcdb0cda80959"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:05.906016Z","signature_b64":"ke0sRoVMpPo8xjVesHL2PQMK7/VGSRF07AaJ/Pt52D0WEZJIL7d/0A64AiC8KVe58292Y8kFhw90KwhPyi41Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1897cd740c27b9c969207b1ed211e058b3acf575c08820fce41d0074832f8ea1","last_reissued_at":"2026-05-18T00:44:05.905381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:05.905381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Abdolhamid Ghodselahi, Fabian Kuhn","submitted_at":"2017-05-20T16:25:22Z","abstract_excerpt":"The Arrow protocol is a simple and elegant protocol to coordinate exclusive access to a shared object in a network. The protocol solves the underlying distributed queueing problem by using path reversal on a pre-computed spanning tree (or any other tree topology simulated on top of the given network).\n  It is known that the Arrow protocol solves the problem with a competitive ratio of O(log D) on trees of diameter D. This implies a distributed queueing algorithm with competitive ratio O(s*log D) for general networks with a spanning tree of diameter D and stretch s. In this work we show that wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07327","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.07327","created_at":"2026-05-18T00:44:05.905473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07327v1","created_at":"2026-05-18T00:44:05.905473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07327","created_at":"2026-05-18T00:44:05.905473+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCL425AME644","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCL425AME644S2JA","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCL425AM","created_at":"2026-05-18T12:31:10.602751+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/DCL425AME644S2JAPMPNEEPALC","json":"https://pith.science/pith/DCL425AME644S2JAPMPNEEPALC.json","graph_json":"https://pith.science/api/pith-number/DCL425AME644S2JAPMPNEEPALC/graph.json","events_json":"https://pith.science/api/pith-number/DCL425AME644S2JAPMPNEEPALC/events.json","paper":"https://pith.science/paper/DCL425AM"},"agent_actions":{"view_html":"https://pith.science/pith/DCL425AME644S2JAPMPNEEPALC","download_json":"https://pith.science/pith/DCL425AME644S2JAPMPNEEPALC.json","view_paper":"https://pith.science/paper/DCL425AM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07327&json=true","fetch_graph":"https://pith.science/api/pith-number/DCL425AME644S2JAPMPNEEPALC/graph.json","fetch_events":"https://pith.science/api/pith-number/DCL425AME644S2JAPMPNEEPALC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCL425AME644S2JAPMPNEEPALC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCL425AME644S2JAPMPNEEPALC/action/storage_attestation","attest_author":"https://pith.science/pith/DCL425AME644S2JAPMPNEEPALC/action/author_attestation","sign_citation":"https://pith.science/pith/DCL425AME644S2JAPMPNEEPALC/action/citation_signature","submit_replication":"https://pith.science/pith/DCL425AME644S2JAPMPNEEPALC/action/replication_record"}},"created_at":"2026-05-18T00:44:05.905473+00:00","updated_at":"2026-05-18T00:44:05.905473+00:00"}