{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DP2SCY5HWXO2JLX77ZMRUNQO27","short_pith_number":"pith:DP2SCY5H","schema_version":"1.0","canonical_sha256":"1bf52163a7b5dda4aefffe591a360ed7e2abce3dc012ef302a142a808802ccda","source":{"kind":"arxiv","id":"1011.3701","version":2},"attestation_state":"computed","paper":{"title":"Directed Spanners via Flow-Based Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Dinitz, Robert Krauthgamer","submitted_at":"2010-11-16T14:14:17Z","abstract_excerpt":"We examine directed spanners through flow-based linear programming relaxations. We design an $\\~O(n^{2/3})$-approximation algorithm for the directed $k$-spanner problem that works for all $k\\geq 1$, which is the first sublinear approximation for arbitrary edge-lengths. Even in the more restricted setting of unit edge-lengths, our algorithm improves over the previous $\\~O(n^{1-1/k})$ approximation of Bhattacharyya et al. when $k\\ge 4$. For the special case of $k=3$ we design a different algorithm achieving an $\\~O(\\sqrt{n})$-approximation, improving the previous $\\~O(n^{2/3})$. Both of our algo"},"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":"1011.3701","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-16T14:14:17Z","cross_cats_sorted":[],"title_canon_sha256":"402add54e1e10f7f92141d1941baf854dbe6e17696ff2eb15278e98d815e4319","abstract_canon_sha256":"32f151d29b69e65cfe1a74c6e1095f77721c671b2e0054b1fb1ef2f53feeff6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:04.412802Z","signature_b64":"IPZyKO9VNZvjcoFLW3Vatlu5KRwb7EN1XuYcElHdluhAar+08B2Vwc0RH/8DWEIOzImfAaYquN0nHI3jnJORBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bf52163a7b5dda4aefffe591a360ed7e2abce3dc012ef302a142a808802ccda","last_reissued_at":"2026-05-18T04:35:04.412226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:04.412226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Directed Spanners via Flow-Based Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Dinitz, Robert Krauthgamer","submitted_at":"2010-11-16T14:14:17Z","abstract_excerpt":"We examine directed spanners through flow-based linear programming relaxations. We design an $\\~O(n^{2/3})$-approximation algorithm for the directed $k$-spanner problem that works for all $k\\geq 1$, which is the first sublinear approximation for arbitrary edge-lengths. Even in the more restricted setting of unit edge-lengths, our algorithm improves over the previous $\\~O(n^{1-1/k})$ approximation of Bhattacharyya et al. when $k\\ge 4$. For the special case of $k=3$ we design a different algorithm achieving an $\\~O(\\sqrt{n})$-approximation, improving the previous $\\~O(n^{2/3})$. Both of our algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3701","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":""},"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":"1011.3701","created_at":"2026-05-18T04:35:04.412301+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3701v2","created_at":"2026-05-18T04:35:04.412301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3701","created_at":"2026-05-18T04:35:04.412301+00:00"},{"alias_kind":"pith_short_12","alias_value":"DP2SCY5HWXO2","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DP2SCY5HWXO2JLX7","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DP2SCY5H","created_at":"2026-05-18T12:26:06.534383+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/DP2SCY5HWXO2JLX77ZMRUNQO27","json":"https://pith.science/pith/DP2SCY5HWXO2JLX77ZMRUNQO27.json","graph_json":"https://pith.science/api/pith-number/DP2SCY5HWXO2JLX77ZMRUNQO27/graph.json","events_json":"https://pith.science/api/pith-number/DP2SCY5HWXO2JLX77ZMRUNQO27/events.json","paper":"https://pith.science/paper/DP2SCY5H"},"agent_actions":{"view_html":"https://pith.science/pith/DP2SCY5HWXO2JLX77ZMRUNQO27","download_json":"https://pith.science/pith/DP2SCY5HWXO2JLX77ZMRUNQO27.json","view_paper":"https://pith.science/paper/DP2SCY5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3701&json=true","fetch_graph":"https://pith.science/api/pith-number/DP2SCY5HWXO2JLX77ZMRUNQO27/graph.json","fetch_events":"https://pith.science/api/pith-number/DP2SCY5HWXO2JLX77ZMRUNQO27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DP2SCY5HWXO2JLX77ZMRUNQO27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DP2SCY5HWXO2JLX77ZMRUNQO27/action/storage_attestation","attest_author":"https://pith.science/pith/DP2SCY5HWXO2JLX77ZMRUNQO27/action/author_attestation","sign_citation":"https://pith.science/pith/DP2SCY5HWXO2JLX77ZMRUNQO27/action/citation_signature","submit_replication":"https://pith.science/pith/DP2SCY5HWXO2JLX77ZMRUNQO27/action/replication_record"}},"created_at":"2026-05-18T04:35:04.412301+00:00","updated_at":"2026-05-18T04:35:04.412301+00:00"}