{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Z3WCXQUCVESTCACOZ6R2LWHETX","short_pith_number":"pith:Z3WCXQUC","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"},"canonical_sha256":"ceec2bc282a92531004ecfa3a5d8e49dd922a9ad60ecd3e45ec80c16a2d289b8","source":{"kind":"arxiv","id":"1811.05115","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Z3WCXQUCVESTCACOZ6R2LWHETX","target":"record","payload":{"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"},"canonical_sha256":"ceec2bc282a92531004ecfa3a5d8e49dd922a9ad60ecd3e45ec80c16a2d289b8","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"},"source_kind":"arxiv","source_id":"1811.05115","source_version":3,"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:42:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qGvYM6Ck0wesmdRFbxzLfTsXiSg5nbIHPLBgav2SOyfDXPJ3NJwDThvmR3zxf7pWHYo6bloLOJ3V4W4RiWV7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:55:28.663409Z"},"content_sha256":"7697aba02d0fe593bc58dee074bf0234a968df55ae3082adb7b00814e371cfa7","schema_version":"1.0","event_id":"sha256:7697aba02d0fe593bc58dee074bf0234a968df55ae3082adb7b00814e371cfa7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Z3WCXQUCVESTCACOZ6R2LWHETX","target":"graph","payload":{"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"},"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:42:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWGa8KKfG50bkNs2p9hGcR4cFUJ5uSRrXcNBkrWmenHUqjEmqFCM3LaJJ1jddfrpmyvbXd4miE25bH3wzMYpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:55:28.663902Z"},"content_sha256":"cf6f245b723c62e6864bdff1c5a38ae20ff7ec475aac3d4f2c7fb4fdc1b613a5","schema_version":"1.0","event_id":"sha256:cf6f245b723c62e6864bdff1c5a38ae20ff7ec475aac3d4f2c7fb4fdc1b613a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z3WCXQUCVESTCACOZ6R2LWHETX/bundle.json","state_url":"https://pith.science/pith/Z3WCXQUCVESTCACOZ6R2LWHETX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z3WCXQUCVESTCACOZ6R2LWHETX/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-04T19:55:28Z","links":{"resolver":"https://pith.science/pith/Z3WCXQUCVESTCACOZ6R2LWHETX","bundle":"https://pith.science/pith/Z3WCXQUCVESTCACOZ6R2LWHETX/bundle.json","state":"https://pith.science/pith/Z3WCXQUCVESTCACOZ6R2LWHETX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z3WCXQUCVESTCACOZ6R2LWHETX/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z6mDhl637w2guP0O9ivcGUxRDGbmMQZkRFrm2HsTE31Pmaebp9xkmHWsc47emF42Slul/OvwJH6JKGuSnvh7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:55:28.666469Z","bundle_sha256":"c03014899481e7effdfa0866a6d48a0664d83b7591a1f40062996228d811b1d2"}}