{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:DP2SCY5HWXO2JLX77ZMRUNQO27","short_pith_number":"pith:DP2SCY5H","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"},"canonical_sha256":"1bf52163a7b5dda4aefffe591a360ed7e2abce3dc012ef302a142a808802ccda","source":{"kind":"arxiv","id":"1011.3701","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3701","created_at":"2026-05-18T04:35:04Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3701v2","created_at":"2026-05-18T04:35:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3701","created_at":"2026-05-18T04:35:04Z"},{"alias_kind":"pith_short_12","alias_value":"DP2SCY5HWXO2","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DP2SCY5HWXO2JLX7","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DP2SCY5H","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:DP2SCY5HWXO2JLX77ZMRUNQO27","target":"record","payload":{"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"},"canonical_sha256":"1bf52163a7b5dda4aefffe591a360ed7e2abce3dc012ef302a142a808802ccda","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"},"source_kind":"arxiv","source_id":"1011.3701","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:35:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MfVbHeOl5HieYqVO9ZcM/cblT62Z2UiTD1E7rOQOhk1+rwO+1B8EISQzoa0w6bWColvGhDhcBc8L9xyc6OWkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:53:19.272614Z"},"content_sha256":"05030bc96acac1d89e6e693fa0bc630fdf981690fa70f7f160a340b9d7eb8b1b","schema_version":"1.0","event_id":"sha256:05030bc96acac1d89e6e693fa0bc630fdf981690fa70f7f160a340b9d7eb8b1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:DP2SCY5HWXO2JLX77ZMRUNQO27","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:35:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGw3qf2zlwwOjyki37DD++j8mIDlKWirsQkPweBQnDPeEM9zU2zh8Fq83E6AZzNLuHPEaNdar+nEMwyPSRGCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:53:19.273329Z"},"content_sha256":"4df16d36226602c756dad99e2795b0b0665b5972b61862e79b742887e6891953","schema_version":"1.0","event_id":"sha256:4df16d36226602c756dad99e2795b0b0665b5972b61862e79b742887e6891953"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DP2SCY5HWXO2JLX77ZMRUNQO27/bundle.json","state_url":"https://pith.science/pith/DP2SCY5HWXO2JLX77ZMRUNQO27/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DP2SCY5HWXO2JLX77ZMRUNQO27/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T15:53:19Z","links":{"resolver":"https://pith.science/pith/DP2SCY5HWXO2JLX77ZMRUNQO27","bundle":"https://pith.science/pith/DP2SCY5HWXO2JLX77ZMRUNQO27/bundle.json","state":"https://pith.science/pith/DP2SCY5HWXO2JLX77ZMRUNQO27/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DP2SCY5HWXO2JLX77ZMRUNQO27/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:DP2SCY5HWXO2JLX77ZMRUNQO27","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":"32f151d29b69e65cfe1a74c6e1095f77721c671b2e0054b1fb1ef2f53feeff6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-16T14:14:17Z","title_canon_sha256":"402add54e1e10f7f92141d1941baf854dbe6e17696ff2eb15278e98d815e4319"},"schema_version":"1.0","source":{"id":"1011.3701","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3701","created_at":"2026-05-18T04:35:04Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3701v2","created_at":"2026-05-18T04:35:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3701","created_at":"2026-05-18T04:35:04Z"},{"alias_kind":"pith_short_12","alias_value":"DP2SCY5HWXO2","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DP2SCY5HWXO2JLX7","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DP2SCY5H","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:4df16d36226602c756dad99e2795b0b0665b5972b61862e79b742887e6891953","target":"graph","created_at":"2026-05-18T04:35:04Z","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"},"paper":{"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","authors_text":"Michael Dinitz, Robert Krauthgamer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-16T14:14:17Z","title":"Directed Spanners via Flow-Based Linear Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3701","kind":"arxiv","version":2},"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:05030bc96acac1d89e6e693fa0bc630fdf981690fa70f7f160a340b9d7eb8b1b","target":"record","created_at":"2026-05-18T04:35:04Z","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":"32f151d29b69e65cfe1a74c6e1095f77721c671b2e0054b1fb1ef2f53feeff6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-16T14:14:17Z","title_canon_sha256":"402add54e1e10f7f92141d1941baf854dbe6e17696ff2eb15278e98d815e4319"},"schema_version":"1.0","source":{"id":"1011.3701","kind":"arxiv","version":2}},"canonical_sha256":"1bf52163a7b5dda4aefffe591a360ed7e2abce3dc012ef302a142a808802ccda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bf52163a7b5dda4aefffe591a360ed7e2abce3dc012ef302a142a808802ccda","first_computed_at":"2026-05-18T04:35:04.412226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:04.412226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IPZyKO9VNZvjcoFLW3Vatlu5KRwb7EN1XuYcElHdluhAar+08B2Vwc0RH/8DWEIOzImfAaYquN0nHI3jnJORBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:04.412802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3701","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05030bc96acac1d89e6e693fa0bc630fdf981690fa70f7f160a340b9d7eb8b1b","sha256:4df16d36226602c756dad99e2795b0b0665b5972b61862e79b742887e6891953"],"state_sha256":"08b3b3d85d6f62690a6d33b2fe4248224dbc0582741c9c62741aafa520a79704"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTe9N9VNYT0z4UEHVLx99QTcnMVwylBU/d44ZmPP3hjkAefRG47+3kL7+lItqh1yPg7hh4uvv+jj5JBGvJBrBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:53:19.276618Z","bundle_sha256":"6ba2849f6d15e6827f47f91e8d932fffcfabda923ff89e5e2205ab958d807202"}}