{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Z3WCXQUCVESTCACOZ6R2LWHETX","short_pith_number":"pith:Z3WCXQUC","schema_version":"1.0","canonical_sha256":"ceec2bc282a92531004ecfa3a5d8e49dd922a9ad60ecd3e45ec80c16a2d289b8","source":{"kind":"arxiv","id":"1811.05115","version":3},"attestation_state":"computed","paper":{"title":"Parametric Shortest Paths in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jaikumar Radhakrishnan, Kshitij Gajjar","submitted_at":"2018-11-13T05:35:47Z","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 "},"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":"1811.05115","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-11-13T05:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"efe520b902ce14c05369d3f4493c49ac8d38c81c0acc68b7acb3fa7511ec6a73","abstract_canon_sha256":"2601e9a94d006323069007305aa7b2fd14ccee0c05e042dd3b89d858ac6d6139"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:58.633286Z","signature_b64":"A38Po5RyLJRUTqevDQWnX536VlvPZQmJc2mBrlA3eKPS7an4fDiHPus+/pAtcK+0+FlsqUQhJarSNJtVJU4qBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceec2bc282a92531004ecfa3a5d8e49dd922a9ad60ecd3e45ec80c16a2d289b8","last_reissued_at":"2026-05-17T23:42:58.632859Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:58.632859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parametric Shortest Paths in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jaikumar Radhakrishnan, Kshitij Gajjar","submitted_at":"2018-11-13T05:35:47Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05115","kind":"arxiv","version":3},"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":"1811.05115","created_at":"2026-05-17T23:42:58.632924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.05115v3","created_at":"2026-05-17T23:42:58.632924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05115","created_at":"2026-05-17T23:42:58.632924+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3WCXQUCVEST","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3WCXQUCVESTCACO","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3WCXQUC","created_at":"2026-05-18T12:33:04.347982+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/Z3WCXQUCVESTCACOZ6R2LWHETX","json":"https://pith.science/pith/Z3WCXQUCVESTCACOZ6R2LWHETX.json","graph_json":"https://pith.science/api/pith-number/Z3WCXQUCVESTCACOZ6R2LWHETX/graph.json","events_json":"https://pith.science/api/pith-number/Z3WCXQUCVESTCACOZ6R2LWHETX/events.json","paper":"https://pith.science/paper/Z3WCXQUC"},"agent_actions":{"view_html":"https://pith.science/pith/Z3WCXQUCVESTCACOZ6R2LWHETX","download_json":"https://pith.science/pith/Z3WCXQUCVESTCACOZ6R2LWHETX.json","view_paper":"https://pith.science/paper/Z3WCXQUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.05115&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3WCXQUCVESTCACOZ6R2LWHETX/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3WCXQUCVESTCACOZ6R2LWHETX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3WCXQUCVESTCACOZ6R2LWHETX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3WCXQUCVESTCACOZ6R2LWHETX/action/storage_attestation","attest_author":"https://pith.science/pith/Z3WCXQUCVESTCACOZ6R2LWHETX/action/author_attestation","sign_citation":"https://pith.science/pith/Z3WCXQUCVESTCACOZ6R2LWHETX/action/citation_signature","submit_replication":"https://pith.science/pith/Z3WCXQUCVESTCACOZ6R2LWHETX/action/replication_record"}},"created_at":"2026-05-17T23:42:58.632924+00:00","updated_at":"2026-05-17T23:42:58.632924+00:00"}