{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AFKEXE6VOKDDWDD3WLIYPNALYD","short_pith_number":"pith:AFKEXE6V","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"},"canonical_sha256":"01544b93d572863b0c7bb2d187b40bc0e494f266113c568ab6004546c33cc7b2","source":{"kind":"arxiv","id":"1208.0395","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0395","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0395v2","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0395","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"AFKEXE6VOKDD","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AFKEXE6VOKDDWDD3","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AFKEXE6V","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AFKEXE6VOKDDWDD3WLIYPNALYD","target":"record","payload":{"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"},"canonical_sha256":"01544b93d572863b0c7bb2d187b40bc0e494f266113c568ab6004546c33cc7b2","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"},"source_kind":"arxiv","source_id":"1208.0395","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8/oFryWSxW/WV4s1r7KVuWwWQ9T/hTrXW4zqUeIsMGhp22b7JdSPbPjWkFR0S68APrpl0OMFuLq9PdmKukODAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:59:16.709242Z"},"content_sha256":"cdf049144ffade80194f40f6aa0d5e4f22d9681c804be8a7aad64b044de212c9","schema_version":"1.0","event_id":"sha256:cdf049144ffade80194f40f6aa0d5e4f22d9681c804be8a7aad64b044de212c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AFKEXE6VOKDDWDD3WLIYPNALYD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ZgExdi/ankkw6MZHg1Jrn8XypdbwiXovBwzi5f43a4DAvwnqTieHYRtZcPG/6ssmx8ZfYmsaCZut/00KOQiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:59:16.709614Z"},"content_sha256":"6ffd12c407c4ae315cdb7e3769e25a814b018354be0cf8d09537c050cd6f73e4","schema_version":"1.0","event_id":"sha256:6ffd12c407c4ae315cdb7e3769e25a814b018354be0cf8d09537c050cd6f73e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AFKEXE6VOKDDWDD3WLIYPNALYD/bundle.json","state_url":"https://pith.science/pith/AFKEXE6VOKDDWDD3WLIYPNALYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AFKEXE6VOKDDWDD3WLIYPNALYD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T06:59:16Z","links":{"resolver":"https://pith.science/pith/AFKEXE6VOKDDWDD3WLIYPNALYD","bundle":"https://pith.science/pith/AFKEXE6VOKDDWDD3WLIYPNALYD/bundle.json","state":"https://pith.science/pith/AFKEXE6VOKDDWDD3WLIYPNALYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AFKEXE6VOKDDWDD3WLIYPNALYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AFKEXE6VOKDDWDD3WLIYPNALYD","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":"1f0307d7e73d9d7f8e2ba2fdcfe2a373bae8bb84c80be7d8f94efe70f63463c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-08-02T04:15:47Z","title_canon_sha256":"0d2ebcda27168447f06e33a10eb5723f9a2cf4c6e60952494a8619fa01f8628d"},"schema_version":"1.0","source":{"id":"1208.0395","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0395","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0395v2","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0395","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"AFKEXE6VOKDD","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AFKEXE6VOKDDWDD3","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AFKEXE6V","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:6ffd12c407c4ae315cdb7e3769e25a814b018354be0cf8d09537c050cd6f73e4","target":"graph","created_at":"2026-05-18T03:17:24Z","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"},"paper":{"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","authors_text":"Marko Savi\\'c, Milo\\v{s} Stojakovi\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-08-02T04:15:47Z","title":"Linear Time Algorithm for Optimal Feed-link Placement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0395","kind":"arxiv","version":2},"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:cdf049144ffade80194f40f6aa0d5e4f22d9681c804be8a7aad64b044de212c9","target":"record","created_at":"2026-05-18T03:17:24Z","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":"1f0307d7e73d9d7f8e2ba2fdcfe2a373bae8bb84c80be7d8f94efe70f63463c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-08-02T04:15:47Z","title_canon_sha256":"0d2ebcda27168447f06e33a10eb5723f9a2cf4c6e60952494a8619fa01f8628d"},"schema_version":"1.0","source":{"id":"1208.0395","kind":"arxiv","version":2}},"canonical_sha256":"01544b93d572863b0c7bb2d187b40bc0e494f266113c568ab6004546c33cc7b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01544b93d572863b0c7bb2d187b40bc0e494f266113c568ab6004546c33cc7b2","first_computed_at":"2026-05-18T03:17:24.943269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:24.943269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XukqFuts8VOaFS7jrwO6em7kOIJpdkQWOpOh7ul98OZozc/miMNXOIT19XtZ5JW1aO83p+O30kVbFkID5dAkAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:24.943976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0395","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdf049144ffade80194f40f6aa0d5e4f22d9681c804be8a7aad64b044de212c9","sha256:6ffd12c407c4ae315cdb7e3769e25a814b018354be0cf8d09537c050cd6f73e4"],"state_sha256":"445491e94361f7cee343ed3648b4379381fe510b602c0a2ffae0b4623ae12a0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VSF+rs2zbl2rYyX7IRTDN68fKC2nt8GygHCrbsRye9apCieNwM44MOsWpgxT5qS27JAa5DF9nWaZ5psqg3vEBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:59:16.711745Z","bundle_sha256":"4fa7752900bf4401afc4ef9ff9e861b21c57bac86646cd0cae23fb6d4545a1b1"}}