{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XDRDNTFWSAW7FUBMKQNCKY6NNA","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":"e6e929ed904dfd1448173259b9a902114e5f30187b82ee9d34a8d65777fd3fe9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CV","submitted_at":"2026-06-17T15:19:13Z","title_canon_sha256":"0f84f198c37a7b50f7e4a6129a080a470dfbd98ebe716ecf567494630a2035fd"},"schema_version":"1.0","source":{"id":"2606.19178","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.19178","created_at":"2026-06-19T16:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.19178v1","created_at":"2026-06-19T16:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19178","created_at":"2026-06-19T16:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"XDRDNTFWSAW7","created_at":"2026-06-19T16:12:07Z"},{"alias_kind":"pith_short_16","alias_value":"XDRDNTFWSAW7FUBM","created_at":"2026-06-19T16:12:07Z"},{"alias_kind":"pith_short_8","alias_value":"XDRDNTFW","created_at":"2026-06-19T16:12:07Z"}],"graph_snapshots":[{"event_id":"sha256:a1abdaf04d5a770786307b9facb1db4b5888ce12dd8914c7aa643f8ad5d0099d","target":"graph","created_at":"2026-06-19T16:12:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.19178/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $f(z)=\\prod_{j=1}^{n}(z-a_j)$ be monic, with all zeros in the closed unit disk, and put $E_f=\\{z\\in\\mathbb{C}: |z|\\leq 1,\\ |f(z)|\\leq 1\\}$. Let $S(n)$ be the largest possible shortest length of a path in $E_f$ joining $0$ to $\\partial\\mathbb{D}$, where the maximum is taken over all such polynomials of degree $n$. We prove that, for all sufficiently large $n$, $c\\sqrt{\\log n}\\leq S(n)\\leq \\pi n$ with an absolute constant $c>0$. This proves the qualitative unboundedness predicted by Erd\\H{o}s. The proof combines an explicit geometric maze, Green-function and Faber-polynomial estimates, analy","authors_text":"Venkata Siddharth Pendyala","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CV","submitted_at":"2026-06-17T15:19:13Z","title":"Shortest paths in polynomial lemniscate sublevel sets and a problem of Erd\\H{o}s"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19178","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:44acd5de53fc33146dc8cd51e81815e0b53b916de0e3b2922d44bbf1d494ddbf","target":"record","created_at":"2026-06-19T16:12:07Z","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":"e6e929ed904dfd1448173259b9a902114e5f30187b82ee9d34a8d65777fd3fe9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CV","submitted_at":"2026-06-17T15:19:13Z","title_canon_sha256":"0f84f198c37a7b50f7e4a6129a080a470dfbd98ebe716ecf567494630a2035fd"},"schema_version":"1.0","source":{"id":"2606.19178","kind":"arxiv","version":1}},"canonical_sha256":"b8e236ccb6902df2d02c541a2563cd682a32b9425ea02eb73dc72ec96d96def5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8e236ccb6902df2d02c541a2563cd682a32b9425ea02eb73dc72ec96d96def5","first_computed_at":"2026-06-19T16:12:07.191796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:07.191796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P9/p9WMdNtIzAupssyPa/zkCtbBhh2b9rxfoAyJGPBBxtzJLSKUvX+HNvEHkMCO1lScRX9qaJoqTFhsoVtDyDQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:07.192146Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.19178","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44acd5de53fc33146dc8cd51e81815e0b53b916de0e3b2922d44bbf1d494ddbf","sha256:a1abdaf04d5a770786307b9facb1db4b5888ce12dd8914c7aa643f8ad5d0099d"],"state_sha256":"d4987926e1fd1cc34572be4cde9c35ed6e985e4f90ba9bc3519e3f2b928a0190"}