{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AFKEXE6VOKDDWDD3WLIYPNALYD","short_pith_number":"pith:AFKEXE6V","schema_version":"1.0","canonical_sha256":"01544b93d572863b0c7bb2d187b40bc0e494f266113c568ab6004546c33cc7b2","source":{"kind":"arxiv","id":"1208.0395","version":2},"attestation_state":"computed","paper":{"title":"Linear Time Algorithm for Optimal Feed-link Placement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Marko Savi\\'c, Milo\\v{s} Stojakovi\\'c","submitted_at":"2012-08-02T04:15:47Z","abstract_excerpt":"Given a polygon representing a transportation network together with a point p in its interior, we aim to extend the network by inserting a line segment, called a feed-link, which connects p to the boundary of the polygon. Once a feed link is fixed, the geometric dilation of some point q on the boundary is the ratio between the length of the shortest path from p to q through the extended network, and their Euclidean distance. The utility of a feed-link is inversely proportional to the maximal dilation over all boundary points.\n  We give a linear time algorithm for computing the feed-link with t"},"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":"1208.0395","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-08-02T04:15:47Z","cross_cats_sorted":[],"title_canon_sha256":"0d2ebcda27168447f06e33a10eb5723f9a2cf4c6e60952494a8619fa01f8628d","abstract_canon_sha256":"1f0307d7e73d9d7f8e2ba2fdcfe2a373bae8bb84c80be7d8f94efe70f63463c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:24.943976Z","signature_b64":"XukqFuts8VOaFS7jrwO6em7kOIJpdkQWOpOh7ul98OZozc/miMNXOIT19XtZ5JW1aO83p+O30kVbFkID5dAkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01544b93d572863b0c7bb2d187b40bc0e494f266113c568ab6004546c33cc7b2","last_reissued_at":"2026-05-18T03:17:24.943269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:24.943269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Time Algorithm for Optimal Feed-link Placement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Marko Savi\\'c, Milo\\v{s} Stojakovi\\'c","submitted_at":"2012-08-02T04:15:47Z","abstract_excerpt":"Given a polygon representing a transportation network together with a point p in its interior, we aim to extend the network by inserting a line segment, called a feed-link, which connects p to the boundary of the polygon. Once a feed link is fixed, the geometric dilation of some point q on the boundary is the ratio between the length of the shortest path from p to q through the extended network, and their Euclidean distance. The utility of a feed-link is inversely proportional to the maximal dilation over all boundary points.\n  We give a linear time algorithm for computing the feed-link with t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0395","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.0395","created_at":"2026-05-18T03:17:24.943402+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0395v2","created_at":"2026-05-18T03:17:24.943402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0395","created_at":"2026-05-18T03:17:24.943402+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFKEXE6VOKDD","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFKEXE6VOKDDWDD3","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFKEXE6V","created_at":"2026-05-18T12:26:58.693483+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/AFKEXE6VOKDDWDD3WLIYPNALYD","json":"https://pith.science/pith/AFKEXE6VOKDDWDD3WLIYPNALYD.json","graph_json":"https://pith.science/api/pith-number/AFKEXE6VOKDDWDD3WLIYPNALYD/graph.json","events_json":"https://pith.science/api/pith-number/AFKEXE6VOKDDWDD3WLIYPNALYD/events.json","paper":"https://pith.science/paper/AFKEXE6V"},"agent_actions":{"view_html":"https://pith.science/pith/AFKEXE6VOKDDWDD3WLIYPNALYD","download_json":"https://pith.science/pith/AFKEXE6VOKDDWDD3WLIYPNALYD.json","view_paper":"https://pith.science/paper/AFKEXE6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0395&json=true","fetch_graph":"https://pith.science/api/pith-number/AFKEXE6VOKDDWDD3WLIYPNALYD/graph.json","fetch_events":"https://pith.science/api/pith-number/AFKEXE6VOKDDWDD3WLIYPNALYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFKEXE6VOKDDWDD3WLIYPNALYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFKEXE6VOKDDWDD3WLIYPNALYD/action/storage_attestation","attest_author":"https://pith.science/pith/AFKEXE6VOKDDWDD3WLIYPNALYD/action/author_attestation","sign_citation":"https://pith.science/pith/AFKEXE6VOKDDWDD3WLIYPNALYD/action/citation_signature","submit_replication":"https://pith.science/pith/AFKEXE6VOKDDWDD3WLIYPNALYD/action/replication_record"}},"created_at":"2026-05-18T03:17:24.943402+00:00","updated_at":"2026-05-18T03:17:24.943402+00:00"}