{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EMPLPKSS4MYNKBBZHAQSA6QWXK","short_pith_number":"pith:EMPLPKSS","schema_version":"1.0","canonical_sha256":"231eb7aa52e330d504393821207a16baad9b6e7c09d04a1340d8b2799baea627","source":{"kind":"arxiv","id":"1907.10895","version":1},"attestation_state":"computed","paper":{"title":"Fast Deterministic Constructions of Linear-Size Spanners and Skeletons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Michael Elkin, Shaked Matar","submitted_at":"2019-07-25T08:21:54Z","abstract_excerpt":"In the distributed setting, the only existing constructions of \\textit{sparse skeletons}, (i.e., subgraphs with $O(n)$ edges) either use randomization or large messages, or require $\\Omega(D)$ time, where $D$ is the hop-diameter of the input graph $G$. We devise the first deterministic distributed algorithm in the CONGEST model (i.e., uses small messages) for constructing linear-size skeletons in time $2^{O(\\sqrt{{\\log n}\\cdot{\\log{\\log n}}})}$. We can also compute a linear-size spanner with stretch $polylog(n)$ in low deterministic polynomial time, i.e., $O(n^\\rho)$ for an arbitrarily small c"},"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":"1907.10895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-25T08:21:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c0ffc4dad76469d462682b2250ebc6f96575a43dc22fb4bb2b59d0f887d7ba47","abstract_canon_sha256":"33c7a9a73f70a2d6b2483a0517657ef3a656b4647587f3d45ff12da55c2045ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:34.136874Z","signature_b64":"x1J0ytPRkqh+G4uBqlq9wqZhXqetwmgp5UYkF4Uvq5j6CILBA4XX9JKreo2nstwOFN5V+V9fCt6J79ShKWslBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"231eb7aa52e330d504393821207a16baad9b6e7c09d04a1340d8b2799baea627","last_reissued_at":"2026-05-17T23:39:34.136440Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:34.136440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Deterministic Constructions of Linear-Size Spanners and Skeletons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Michael Elkin, Shaked Matar","submitted_at":"2019-07-25T08:21:54Z","abstract_excerpt":"In the distributed setting, the only existing constructions of \\textit{sparse skeletons}, (i.e., subgraphs with $O(n)$ edges) either use randomization or large messages, or require $\\Omega(D)$ time, where $D$ is the hop-diameter of the input graph $G$. We devise the first deterministic distributed algorithm in the CONGEST model (i.e., uses small messages) for constructing linear-size skeletons in time $2^{O(\\sqrt{{\\log n}\\cdot{\\log{\\log n}}})}$. We can also compute a linear-size spanner with stretch $polylog(n)$ in low deterministic polynomial time, i.e., $O(n^\\rho)$ for an arbitrarily small c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10895","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":"1907.10895","created_at":"2026-05-17T23:39:34.136507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.10895v1","created_at":"2026-05-17T23:39:34.136507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10895","created_at":"2026-05-17T23:39:34.136507+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMPLPKSS4MYN","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMPLPKSS4MYNKBBZ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMPLPKSS","created_at":"2026-05-18T12:33:15.570797+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/EMPLPKSS4MYNKBBZHAQSA6QWXK","json":"https://pith.science/pith/EMPLPKSS4MYNKBBZHAQSA6QWXK.json","graph_json":"https://pith.science/api/pith-number/EMPLPKSS4MYNKBBZHAQSA6QWXK/graph.json","events_json":"https://pith.science/api/pith-number/EMPLPKSS4MYNKBBZHAQSA6QWXK/events.json","paper":"https://pith.science/paper/EMPLPKSS"},"agent_actions":{"view_html":"https://pith.science/pith/EMPLPKSS4MYNKBBZHAQSA6QWXK","download_json":"https://pith.science/pith/EMPLPKSS4MYNKBBZHAQSA6QWXK.json","view_paper":"https://pith.science/paper/EMPLPKSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.10895&json=true","fetch_graph":"https://pith.science/api/pith-number/EMPLPKSS4MYNKBBZHAQSA6QWXK/graph.json","fetch_events":"https://pith.science/api/pith-number/EMPLPKSS4MYNKBBZHAQSA6QWXK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMPLPKSS4MYNKBBZHAQSA6QWXK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMPLPKSS4MYNKBBZHAQSA6QWXK/action/storage_attestation","attest_author":"https://pith.science/pith/EMPLPKSS4MYNKBBZHAQSA6QWXK/action/author_attestation","sign_citation":"https://pith.science/pith/EMPLPKSS4MYNKBBZHAQSA6QWXK/action/citation_signature","submit_replication":"https://pith.science/pith/EMPLPKSS4MYNKBBZHAQSA6QWXK/action/replication_record"}},"created_at":"2026-05-17T23:39:34.136507+00:00","updated_at":"2026-05-17T23:39:34.136507+00:00"}