{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OWB37TBJFFKVLCZLOOX65PE6TT","short_pith_number":"pith:OWB37TBJ","schema_version":"1.0","canonical_sha256":"7583bfcc292955558b2b73afeebc9e9cee69946d99f1b5bae6b23403e2a28863","source":{"kind":"arxiv","id":"2607.25811","version":1},"attestation_state":"computed","paper":{"title":"Length-Constrained Network Design in Planar Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chandra Chekuri, Rhea Jain","submitted_at":"2026-07-28T14:57:36Z","abstract_excerpt":"We study length-constrained generalizations of Directed Steiner Tree (DST) and Directed Steiner Forest (DSF) in planar digraphs. In both problems, the input is a directed graph with edge costs. DST asks for a min-cost subgraph connecting a root to a given set of terminals, and DSF asks for a min-cost subgraph connecting each of a given set of source-sink terminal pairs. In the length-constrained setting, each edge has both a cost and a length, and the input includes a length bound $h$; the goal is to find a min-cost subgraph connecting each terminal pair via a path of length at most $h$. Our w"},"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.25811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-28T14:57:36Z","cross_cats_sorted":[],"title_canon_sha256":"0f412d2459522c7f3e07194222202ea3113af60bcc0ac4ad92ec3e92a5ed6c06","abstract_canon_sha256":"df4e2e3ae36a4c1da2783e3dd5afd7f685832c173dc8d9c2f2a306c2d94b848b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T01:26:04.031422Z","signature_b64":"RrdgNlxPBwhFmQdrBQKh6tjFOIhZjFSY8A1aJ7njr2Vq/27WQBTjisKEaMqXWwOKzkKCRNHzo3S5RDEycVp+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7583bfcc292955558b2b73afeebc9e9cee69946d99f1b5bae6b23403e2a28863","last_reissued_at":"2026-07-29T01:26:04.030600Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T01:26:04.030600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Length-Constrained Network Design in Planar Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chandra Chekuri, Rhea Jain","submitted_at":"2026-07-28T14:57:36Z","abstract_excerpt":"We study length-constrained generalizations of Directed Steiner Tree (DST) and Directed Steiner Forest (DSF) in planar digraphs. In both problems, the input is a directed graph with edge costs. DST asks for a min-cost subgraph connecting a root to a given set of terminals, and DSF asks for a min-cost subgraph connecting each of a given set of source-sink terminal pairs. In the length-constrained setting, each edge has both a cost and a length, and the input includes a length bound $h$; the goal is to find a min-cost subgraph connecting each terminal pair via a path of length at most $h$. Our w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25811","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.25811/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.25811","created_at":"2026-07-29T01:26:04.031017+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.25811v1","created_at":"2026-07-29T01:26:04.031017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25811","created_at":"2026-07-29T01:26:04.031017+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWB37TBJFFKV","created_at":"2026-07-29T01:26:04.031017+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWB37TBJFFKVLCZL","created_at":"2026-07-29T01:26:04.031017+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWB37TBJ","created_at":"2026-07-29T01:26:04.031017+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/OWB37TBJFFKVLCZLOOX65PE6TT","json":"https://pith.science/pith/OWB37TBJFFKVLCZLOOX65PE6TT.json","graph_json":"https://pith.science/api/pith-number/OWB37TBJFFKVLCZLOOX65PE6TT/graph.json","events_json":"https://pith.science/api/pith-number/OWB37TBJFFKVLCZLOOX65PE6TT/events.json","paper":"https://pith.science/paper/OWB37TBJ"},"agent_actions":{"view_html":"https://pith.science/pith/OWB37TBJFFKVLCZLOOX65PE6TT","download_json":"https://pith.science/pith/OWB37TBJFFKVLCZLOOX65PE6TT.json","view_paper":"https://pith.science/paper/OWB37TBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.25811&json=true","fetch_graph":"https://pith.science/api/pith-number/OWB37TBJFFKVLCZLOOX65PE6TT/graph.json","fetch_events":"https://pith.science/api/pith-number/OWB37TBJFFKVLCZLOOX65PE6TT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWB37TBJFFKVLCZLOOX65PE6TT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWB37TBJFFKVLCZLOOX65PE6TT/action/storage_attestation","attest_author":"https://pith.science/pith/OWB37TBJFFKVLCZLOOX65PE6TT/action/author_attestation","sign_citation":"https://pith.science/pith/OWB37TBJFFKVLCZLOOX65PE6TT/action/citation_signature","submit_replication":"https://pith.science/pith/OWB37TBJFFKVLCZLOOX65PE6TT/action/replication_record"}},"created_at":"2026-07-29T01:26:04.031017+00:00","updated_at":"2026-07-29T01:26:04.031017+00:00"}