{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:55P7O6WNALVB2AKMGJZGNZDWCR","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":"87423592e7b9338b7b67e472cd2fc9311d57390ec76ecc93f8394ecdcce1d437","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-25T01:24:03Z","title_canon_sha256":"6d8e845af9941767cb6a7d034a265f05f4e624b3d76921fa1c1fdaad8c164fbf"},"schema_version":"1.0","source":{"id":"1702.07815","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07815","created_at":"2026-05-18T00:16:14Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07815v2","created_at":"2026-05-18T00:16:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07815","created_at":"2026-05-18T00:16:14Z"},{"alias_kind":"pith_short_12","alias_value":"55P7O6WNALVB","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"55P7O6WNALVB2AKM","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"55P7O6WN","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:742622a8688a28a12a6ec3c807cf598b312e84cfd42b3f21a8361dd4a65c32d7","target":"graph","created_at":"2026-05-18T00:16:14Z","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 show how to compute for $n$-vertex planar graphs in $O(n^{11/6}{\\rm polylog}(n))$ expected time the diameter and the sum of the pairwise distances. The algorithms work for directed graphs with real weights and no negative cycles. In $O(n^{15/8}{\\rm polylog}(n))$ expected time we can also compute the number of pairs of vertices at distance smaller than a given threshold. These are the first algorithms for these problems using time $O(n^c)$ for some constant $c<2$, even when restricted to undirected, unweighted planar graphs.","authors_text":"Sergio Cabello","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-25T01:24:03Z","title":"Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07815","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:5f105cac9c714ea399a2b4aea407854df0686e525a8bf78e2ee5c6e413e08716","target":"record","created_at":"2026-05-18T00:16:14Z","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":"87423592e7b9338b7b67e472cd2fc9311d57390ec76ecc93f8394ecdcce1d437","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-25T01:24:03Z","title_canon_sha256":"6d8e845af9941767cb6a7d034a265f05f4e624b3d76921fa1c1fdaad8c164fbf"},"schema_version":"1.0","source":{"id":"1702.07815","kind":"arxiv","version":2}},"canonical_sha256":"ef5ff77acd02ea1d014c327266e4761440b63a6c904bff0b69ac6513c5f4415d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef5ff77acd02ea1d014c327266e4761440b63a6c904bff0b69ac6513c5f4415d","first_computed_at":"2026-05-18T00:16:14.695918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:14.695918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cH0LGLon/tR4Hyh+4b/401jxDlPI67X4RQ6D9IS8Lo0IRMj6G6regpnJCtB6+ME8WxBeL9zbcH+h5QnL/3+oAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:14.696689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07815","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f105cac9c714ea399a2b4aea407854df0686e525a8bf78e2ee5c6e413e08716","sha256:742622a8688a28a12a6ec3c807cf598b312e84cfd42b3f21a8361dd4a65c32d7"],"state_sha256":"dd81a0d3542f53e5cf4e881cd02dc004444babf745c2d4ab1e254136e64670e3"}