{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZQBB2PCXZ5EFXSVLVE2L5KYEEI","short_pith_number":"pith:ZQBB2PCX","canonical_record":{"source":{"id":"1907.11078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T14:14:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"09c93762d198477ed0d3ae33ced39f3ecd5cc12b4e9f4abef21b4d18cf006414","abstract_canon_sha256":"56b9bb0f5ddfb14811a92ee6c26d4ec49ed3d260bd903d366c0426e7b3922826"},"schema_version":"1.0"},"canonical_sha256":"cc021d3c57cf485bcaaba934beab04223dc69ee3880ee888c9374d499e5fb0ef","source":{"kind":"arxiv","id":"1907.11078","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11078","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11078v1","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11078","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZQBB2PCXZ5EF","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZQBB2PCXZ5EFXSVL","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZQBB2PCX","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZQBB2PCXZ5EFXSVLVE2L5KYEEI","target":"record","payload":{"canonical_record":{"source":{"id":"1907.11078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T14:14:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"09c93762d198477ed0d3ae33ced39f3ecd5cc12b4e9f4abef21b4d18cf006414","abstract_canon_sha256":"56b9bb0f5ddfb14811a92ee6c26d4ec49ed3d260bd903d366c0426e7b3922826"},"schema_version":"1.0"},"canonical_sha256":"cc021d3c57cf485bcaaba934beab04223dc69ee3880ee888c9374d499e5fb0ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:33.549461Z","signature_b64":"TKbfSN1zlKhkE6Qy+iHHrCWwneWDrmFmxYO5sJvJxgE1R6NdpvdggEUxiQ0JGJDp0hkqPPrAzBnth9gOFimxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc021d3c57cf485bcaaba934beab04223dc69ee3880ee888c9374d499e5fb0ef","last_reissued_at":"2026-05-17T23:39:33.548814Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:33.548814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.11078","source_version":1,"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-17T23:39:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XkiLuFgo1BkAJwfJ8tA3nqAuvmiS1PVLkDpszwo0SkvHz7hNwmbhMZmWTphLN880BY8pHu8TkJPi6xLn434DAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:42:32.150731Z"},"content_sha256":"ace1e74384f2a1f7ceec826c02f5a112f87692b604807a7c2e290d8f5a88782a","schema_version":"1.0","event_id":"sha256:ace1e74384f2a1f7ceec826c02f5a112f87692b604807a7c2e290d8f5a88782a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZQBB2PCXZ5EFXSVLVE2L5KYEEI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Karl Bringmann, Karol W\\k{e}grzycki, Marvin K\\\"unnemann","submitted_at":"2019-07-25T14:14:06Z","abstract_excerpt":"Zwick's $(1+\\varepsilon)$-approximation algorithm for the All Pairs Shortest Path (APSP) problem runs in time $\\widetilde{O}(\\frac{n^\\omega}{\\varepsilon} \\log{W})$, where $\\omega \\le 2.373$ is the exponent of matrix multiplication and $W$ denotes the largest weight. This can be used to approximate several graph characteristics including the diameter, radius, median, minimum-weight triangle, and minimum-weight cycle in the same time bound.\n  Since Zwick's algorithm uses the scaling technique, it has a factor $\\log W$ in the running time. In this paper, we study whether APSP and related problems"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11078","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"},"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-17T23:39:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UcQrT5QiuwSyPrBTFtsgXYq0An8jlflyC/eI+enJrt3kQUjVvPVdN6DV1p/xN+rwMqnhu8cspP/bmU/SFDZ/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:42:32.151404Z"},"content_sha256":"ae7d2471f8abcc231ef66de46dcdc9ac88871c9f99619141a61010717ce8321b","schema_version":"1.0","event_id":"sha256:ae7d2471f8abcc231ef66de46dcdc9ac88871c9f99619141a61010717ce8321b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQBB2PCXZ5EFXSVLVE2L5KYEEI/bundle.json","state_url":"https://pith.science/pith/ZQBB2PCXZ5EFXSVLVE2L5KYEEI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQBB2PCXZ5EFXSVLVE2L5KYEEI/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-05-26T06:42:32Z","links":{"resolver":"https://pith.science/pith/ZQBB2PCXZ5EFXSVLVE2L5KYEEI","bundle":"https://pith.science/pith/ZQBB2PCXZ5EFXSVLVE2L5KYEEI/bundle.json","state":"https://pith.science/pith/ZQBB2PCXZ5EFXSVLVE2L5KYEEI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQBB2PCXZ5EFXSVLVE2L5KYEEI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZQBB2PCXZ5EFXSVLVE2L5KYEEI","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":"56b9bb0f5ddfb14811a92ee6c26d4ec49ed3d260bd903d366c0426e7b3922826","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T14:14:06Z","title_canon_sha256":"09c93762d198477ed0d3ae33ced39f3ecd5cc12b4e9f4abef21b4d18cf006414"},"schema_version":"1.0","source":{"id":"1907.11078","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11078","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11078v1","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11078","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZQBB2PCXZ5EF","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZQBB2PCXZ5EFXSVL","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZQBB2PCX","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:ae7d2471f8abcc231ef66de46dcdc9ac88871c9f99619141a61010717ce8321b","target":"graph","created_at":"2026-05-17T23:39:33Z","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":"Zwick's $(1+\\varepsilon)$-approximation algorithm for the All Pairs Shortest Path (APSP) problem runs in time $\\widetilde{O}(\\frac{n^\\omega}{\\varepsilon} \\log{W})$, where $\\omega \\le 2.373$ is the exponent of matrix multiplication and $W$ denotes the largest weight. This can be used to approximate several graph characteristics including the diameter, radius, median, minimum-weight triangle, and minimum-weight cycle in the same time bound.\n  Since Zwick's algorithm uses the scaling technique, it has a factor $\\log W$ in the running time. In this paper, we study whether APSP and related problems","authors_text":"Karl Bringmann, Karol W\\k{e}grzycki, Marvin K\\\"unnemann","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T14:14:06Z","title":"Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11078","kind":"arxiv","version":1},"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:ace1e74384f2a1f7ceec826c02f5a112f87692b604807a7c2e290d8f5a88782a","target":"record","created_at":"2026-05-17T23:39:33Z","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":"56b9bb0f5ddfb14811a92ee6c26d4ec49ed3d260bd903d366c0426e7b3922826","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T14:14:06Z","title_canon_sha256":"09c93762d198477ed0d3ae33ced39f3ecd5cc12b4e9f4abef21b4d18cf006414"},"schema_version":"1.0","source":{"id":"1907.11078","kind":"arxiv","version":1}},"canonical_sha256":"cc021d3c57cf485bcaaba934beab04223dc69ee3880ee888c9374d499e5fb0ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc021d3c57cf485bcaaba934beab04223dc69ee3880ee888c9374d499e5fb0ef","first_computed_at":"2026-05-17T23:39:33.548814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:33.548814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TKbfSN1zlKhkE6Qy+iHHrCWwneWDrmFmxYO5sJvJxgE1R6NdpvdggEUxiQ0JGJDp0hkqPPrAzBnth9gOFimxCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:33.549461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11078","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ace1e74384f2a1f7ceec826c02f5a112f87692b604807a7c2e290d8f5a88782a","sha256:ae7d2471f8abcc231ef66de46dcdc9ac88871c9f99619141a61010717ce8321b"],"state_sha256":"c23777b6b931bd8eb03fcf57306b8d701a8773e4055e17fecbbe6b38f281f644"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NvqR8IkzcXqHrrnULcN2H4AEvzYrFGSABY6vk4QUhvRZifKLCOiiKDhfpgZECRCkjbNv4djmZibvT02Rub30Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:42:32.154887Z","bundle_sha256":"78afd7b3d11de306a745f6c5c4376f906fde905c77f8875c6cc675ddc3d48d86"}}