{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NQ7OE2E5KZXA677OZI35TPSD3D","short_pith_number":"pith:NQ7OE2E5","schema_version":"1.0","canonical_sha256":"6c3ee2689d566e0f7feeca37d9be43d8f5e285eb710bd4600229409be2429102","source":{"kind":"arxiv","id":"2607.02883","version":1},"attestation_state":"computed","paper":{"title":"Paths and Intersections: Minimum Realization of Okamura-Seymour Instances","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DS","authors_text":"Pavlo Pylyavskyy, Yu Chen, Zihan Tan","submitted_at":"2026-07-03T02:29:36Z","abstract_excerpt":"We study the inverse problem for shortest-path metrics of Okamura-Seymour (OS) instances. Given an OS metric $D$ on a cyclically ordered terminal set $T$, the goal is to find minimum realizations of $D$, where minimum means having the fewest edges among all disk-embedded realizations with the prescribed terminal order. We show that $D$ determines a canonical medial graph template and every minimum realization is the primal graph of an arrangement of this template. Consequently, the underlying embedded graphs of minimum realizations of $D$ can be recovered, and for each such graph one can effic"},"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":"2607.02883","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-03T02:29:36Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"7e2c213a563617f509cd3914383c77e4c9fc65a3a0487105c448532114cc077e","abstract_canon_sha256":"77cb91692fea7a37533b4851cc53ddec20fa3c371f6b85302ee6e7c5ff2baeeb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T01:16:35.355064Z","signature_b64":"F9/l6JC76AUS96Rzef6ATIwa5XzMfM5HrI+SxFmaOBs1m5YWd62Y7quBQ2PkX+irg5VkullROh+4Z4ScxkgsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c3ee2689d566e0f7feeca37d9be43d8f5e285eb710bd4600229409be2429102","last_reissued_at":"2026-07-07T01:16:35.354500Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T01:16:35.354500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Paths and Intersections: Minimum Realization of Okamura-Seymour Instances","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DS","authors_text":"Pavlo Pylyavskyy, Yu Chen, Zihan Tan","submitted_at":"2026-07-03T02:29:36Z","abstract_excerpt":"We study the inverse problem for shortest-path metrics of Okamura-Seymour (OS) instances. Given an OS metric $D$ on a cyclically ordered terminal set $T$, the goal is to find minimum realizations of $D$, where minimum means having the fewest edges among all disk-embedded realizations with the prescribed terminal order. We show that $D$ determines a canonical medial graph template and every minimum realization is the primal graph of an arrangement of this template. Consequently, the underlying embedded graphs of minimum realizations of $D$ can be recovered, and for each such graph one can effic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02883","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.02883/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.02883","created_at":"2026-07-07T01:16:35.354571+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.02883v1","created_at":"2026-07-07T01:16:35.354571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02883","created_at":"2026-07-07T01:16:35.354571+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQ7OE2E5KZXA","created_at":"2026-07-07T01:16:35.354571+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQ7OE2E5KZXA677O","created_at":"2026-07-07T01:16:35.354571+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQ7OE2E5","created_at":"2026-07-07T01:16:35.354571+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/NQ7OE2E5KZXA677OZI35TPSD3D","json":"https://pith.science/pith/NQ7OE2E5KZXA677OZI35TPSD3D.json","graph_json":"https://pith.science/api/pith-number/NQ7OE2E5KZXA677OZI35TPSD3D/graph.json","events_json":"https://pith.science/api/pith-number/NQ7OE2E5KZXA677OZI35TPSD3D/events.json","paper":"https://pith.science/paper/NQ7OE2E5"},"agent_actions":{"view_html":"https://pith.science/pith/NQ7OE2E5KZXA677OZI35TPSD3D","download_json":"https://pith.science/pith/NQ7OE2E5KZXA677OZI35TPSD3D.json","view_paper":"https://pith.science/paper/NQ7OE2E5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.02883&json=true","fetch_graph":"https://pith.science/api/pith-number/NQ7OE2E5KZXA677OZI35TPSD3D/graph.json","fetch_events":"https://pith.science/api/pith-number/NQ7OE2E5KZXA677OZI35TPSD3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQ7OE2E5KZXA677OZI35TPSD3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQ7OE2E5KZXA677OZI35TPSD3D/action/storage_attestation","attest_author":"https://pith.science/pith/NQ7OE2E5KZXA677OZI35TPSD3D/action/author_attestation","sign_citation":"https://pith.science/pith/NQ7OE2E5KZXA677OZI35TPSD3D/action/citation_signature","submit_replication":"https://pith.science/pith/NQ7OE2E5KZXA677OZI35TPSD3D/action/replication_record"}},"created_at":"2026-07-07T01:16:35.354571+00:00","updated_at":"2026-07-07T01:16:35.354571+00:00"}