{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z3WCXQUCVESTCACOZ6R2LWHETX","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":"2601e9a94d006323069007305aa7b2fd14ccee0c05e042dd3b89d858ac6d6139","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-11-13T05:35:47Z","title_canon_sha256":"efe520b902ce14c05369d3f4493c49ac8d38c81c0acc68b7acb3fa7511ec6a73"},"schema_version":"1.0","source":{"id":"1811.05115","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05115","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05115v3","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05115","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"pith_short_12","alias_value":"Z3WCXQUCVEST","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z3WCXQUCVESTCACO","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z3WCXQUC","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:cf6f245b723c62e6864bdff1c5a38ae20ff7ec475aac3d4f2c7fb4fdc1b613a5","target":"graph","created_at":"2026-05-17T23:42:58Z","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 construct a family of planar graphs $\\{G_n\\}_{n\\geq 4}$, where $G_n$ has $n$ vertices including a source vertex $s$ and a sink vertex $t$, and edge weights that change linearly with a parameter $\\lambda$ such that, as $\\lambda$ varies in $(-\\infty,+\\infty)$, the piece-wise linear cost of the shortest path from $s$ to $t$ has $n^{\\Omega(\\log n)}$ pieces. This shows that lower bounds obtained earlier by Carstensen (1983) and Mulmuley \\& Shah (2001) for general graphs also hold for planar graphs, thereby refuting a conjecture of Nikolova (2009). Gusfield (1980) and Dean (2009) showed that the ","authors_text":"Jaikumar Radhakrishnan, Kshitij Gajjar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-11-13T05:35:47Z","title":"Parametric Shortest Paths in Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05115","kind":"arxiv","version":3},"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:7697aba02d0fe593bc58dee074bf0234a968df55ae3082adb7b00814e371cfa7","target":"record","created_at":"2026-05-17T23:42:58Z","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":"2601e9a94d006323069007305aa7b2fd14ccee0c05e042dd3b89d858ac6d6139","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-11-13T05:35:47Z","title_canon_sha256":"efe520b902ce14c05369d3f4493c49ac8d38c81c0acc68b7acb3fa7511ec6a73"},"schema_version":"1.0","source":{"id":"1811.05115","kind":"arxiv","version":3}},"canonical_sha256":"ceec2bc282a92531004ecfa3a5d8e49dd922a9ad60ecd3e45ec80c16a2d289b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ceec2bc282a92531004ecfa3a5d8e49dd922a9ad60ecd3e45ec80c16a2d289b8","first_computed_at":"2026-05-17T23:42:58.632859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:58.632859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A38Po5RyLJRUTqevDQWnX536VlvPZQmJc2mBrlA3eKPS7an4fDiHPus+/pAtcK+0+FlsqUQhJarSNJtVJU4qBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:58.633286Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05115","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7697aba02d0fe593bc58dee074bf0234a968df55ae3082adb7b00814e371cfa7","sha256:cf6f245b723c62e6864bdff1c5a38ae20ff7ec475aac3d4f2c7fb4fdc1b613a5"],"state_sha256":"172e26edcca8259ebb5a2394c34b212584a595891b1efb6e0118d3525a8d84dc"}