{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UQHLMZ6AHOUBNI5G2I2HRSU777","short_pith_number":"pith:UQHLMZ6A","schema_version":"1.0","canonical_sha256":"a40eb667c03ba816a3a6d23478ca9fffc59e29f79d0f04f68dbe6723bc9c03dd","source":{"kind":"arxiv","id":"2607.18563","version":1},"attestation_state":"computed","paper":{"title":"Revisit escape path for infinite unit strip forest and unit broadworm","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Zhipeng Deng","submitted_at":"2026-07-20T22:53:02Z","abstract_excerpt":"Building on our previous general computational solution to Bellman's Lost-in-a-Forest Problem, we present a new approach and analytical formulas for the previously well-known escape path for the infinite unit-strip forest and unit broadworm by Zalgaller. Earlier studies addressed these problems exclusively through geometric methods. We reformulated the problem as an interval-cover problem and then formulated it as a constrained functional minimization problem. This constrained functional minimization can be directly discretized and subsequently solved as a convex optimization. Furthermore, we "},"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.18563","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-20T22:53:02Z","cross_cats_sorted":[],"title_canon_sha256":"371af01781ae5939e15805d1f77d7dd9ac64393d1b02068f91c8fe77ee8d10a1","abstract_canon_sha256":"32adba0ff2c2f23f13458351ec143868c5aaee2576d2eb1bbb63995a94ce489c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-22T00:22:54.480929Z","signature_b64":"z9VVy7t+on7BGf3hrdCc9dynu8LFKTW3Q4joMGJylwk7DcUxKY9O/0bsNPR+gZsmVjWwXvbUDJ3f8OKtdnw7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a40eb667c03ba816a3a6d23478ca9fffc59e29f79d0f04f68dbe6723bc9c03dd","last_reissued_at":"2026-07-22T00:22:54.480096Z","signature_status":"signed_v1","first_computed_at":"2026-07-22T00:22:54.480096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisit escape path for infinite unit strip forest and unit broadworm","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Zhipeng Deng","submitted_at":"2026-07-20T22:53:02Z","abstract_excerpt":"Building on our previous general computational solution to Bellman's Lost-in-a-Forest Problem, we present a new approach and analytical formulas for the previously well-known escape path for the infinite unit-strip forest and unit broadworm by Zalgaller. Earlier studies addressed these problems exclusively through geometric methods. We reformulated the problem as an interval-cover problem and then formulated it as a constrained functional minimization problem. This constrained functional minimization can be directly discretized and subsequently solved as a convex optimization. Furthermore, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.18563","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.18563/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.18563","created_at":"2026-07-22T00:22:54.480537+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.18563v1","created_at":"2026-07-22T00:22:54.480537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.18563","created_at":"2026-07-22T00:22:54.480537+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQHLMZ6AHOUB","created_at":"2026-07-22T00:22:54.480537+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQHLMZ6AHOUBNI5G","created_at":"2026-07-22T00:22:54.480537+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQHLMZ6A","created_at":"2026-07-22T00:22:54.480537+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01393","citing_title":"Universal Triangle Covering Curve and Polygonal Chain: Escaping Forest and Fitting Worm","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UQHLMZ6AHOUBNI5G2I2HRSU777","json":"https://pith.science/pith/UQHLMZ6AHOUBNI5G2I2HRSU777.json","graph_json":"https://pith.science/api/pith-number/UQHLMZ6AHOUBNI5G2I2HRSU777/graph.json","events_json":"https://pith.science/api/pith-number/UQHLMZ6AHOUBNI5G2I2HRSU777/events.json","paper":"https://pith.science/paper/UQHLMZ6A"},"agent_actions":{"view_html":"https://pith.science/pith/UQHLMZ6AHOUBNI5G2I2HRSU777","download_json":"https://pith.science/pith/UQHLMZ6AHOUBNI5G2I2HRSU777.json","view_paper":"https://pith.science/paper/UQHLMZ6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.18563&json=true","fetch_graph":"https://pith.science/api/pith-number/UQHLMZ6AHOUBNI5G2I2HRSU777/graph.json","fetch_events":"https://pith.science/api/pith-number/UQHLMZ6AHOUBNI5G2I2HRSU777/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQHLMZ6AHOUBNI5G2I2HRSU777/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQHLMZ6AHOUBNI5G2I2HRSU777/action/storage_attestation","attest_author":"https://pith.science/pith/UQHLMZ6AHOUBNI5G2I2HRSU777/action/author_attestation","sign_citation":"https://pith.science/pith/UQHLMZ6AHOUBNI5G2I2HRSU777/action/citation_signature","submit_replication":"https://pith.science/pith/UQHLMZ6AHOUBNI5G2I2HRSU777/action/replication_record"}},"created_at":"2026-07-22T00:22:54.480537+00:00","updated_at":"2026-07-22T00:22:54.480537+00:00"}