{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KLLN4LFYBYKKYIIKSB5FTDA4PA","short_pith_number":"pith:KLLN4LFY","schema_version":"1.0","canonical_sha256":"52d6de2cb80e14ac210a907a598c1c783a484e6e156a75aa072919d4a09564a5","source":{"kind":"arxiv","id":"1807.10093","version":1},"attestation_state":"computed","paper":{"title":"Computing optimal shortcuts for networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alberto M\\'arquez, Delia Garijo, Natalia Rodr\\'iguez, Rodrigo I. Silveira","submitted_at":"2018-07-26T12:30:29Z","abstract_excerpt":"We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Problems of this type have received considerable attention recently, mostly for discrete variants of the problem.\n  We consider a fully continuous setting, where the problem of computing distances and placing a shortcut is much harder as all points on the network, instead of only the vertices, must be taken into account. We present the first results on the computation of optimal shortcuts for general networks in this "},"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":"1807.10093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-07-26T12:30:29Z","cross_cats_sorted":[],"title_canon_sha256":"c86b69abe668f3763de761773661e7dfffbc23aee0edc11d621548eda88d1503","abstract_canon_sha256":"5037f767d0ba4e9c8673a6975c3c26292c042b5ed787f62265321dc51dfdfcaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:45.458187Z","signature_b64":"HCO2AlpsMkagwW7f7jhunudVi8OqTqMxCB5En97e1tWwaaEEFgcHtaugP/Toor7x2cy2x6AyIJYu+LKEwJ1FCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52d6de2cb80e14ac210a907a598c1c783a484e6e156a75aa072919d4a09564a5","last_reissued_at":"2026-05-18T00:09:45.457458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:45.457458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing optimal shortcuts for networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alberto M\\'arquez, Delia Garijo, Natalia Rodr\\'iguez, Rodrigo I. Silveira","submitted_at":"2018-07-26T12:30:29Z","abstract_excerpt":"We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Problems of this type have received considerable attention recently, mostly for discrete variants of the problem.\n  We consider a fully continuous setting, where the problem of computing distances and placing a shortcut is much harder as all points on the network, instead of only the vertices, must be taken into account. We present the first results on the computation of optimal shortcuts for general networks in this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10093","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":""},"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":"1807.10093","created_at":"2026-05-18T00:09:45.457570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10093v1","created_at":"2026-05-18T00:09:45.457570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10093","created_at":"2026-05-18T00:09:45.457570+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLLN4LFYBYKK","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLLN4LFYBYKKYIIK","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLLN4LFY","created_at":"2026-05-18T12:32:33.847187+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/KLLN4LFYBYKKYIIKSB5FTDA4PA","json":"https://pith.science/pith/KLLN4LFYBYKKYIIKSB5FTDA4PA.json","graph_json":"https://pith.science/api/pith-number/KLLN4LFYBYKKYIIKSB5FTDA4PA/graph.json","events_json":"https://pith.science/api/pith-number/KLLN4LFYBYKKYIIKSB5FTDA4PA/events.json","paper":"https://pith.science/paper/KLLN4LFY"},"agent_actions":{"view_html":"https://pith.science/pith/KLLN4LFYBYKKYIIKSB5FTDA4PA","download_json":"https://pith.science/pith/KLLN4LFYBYKKYIIKSB5FTDA4PA.json","view_paper":"https://pith.science/paper/KLLN4LFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10093&json=true","fetch_graph":"https://pith.science/api/pith-number/KLLN4LFYBYKKYIIKSB5FTDA4PA/graph.json","fetch_events":"https://pith.science/api/pith-number/KLLN4LFYBYKKYIIKSB5FTDA4PA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLLN4LFYBYKKYIIKSB5FTDA4PA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLLN4LFYBYKKYIIKSB5FTDA4PA/action/storage_attestation","attest_author":"https://pith.science/pith/KLLN4LFYBYKKYIIKSB5FTDA4PA/action/author_attestation","sign_citation":"https://pith.science/pith/KLLN4LFYBYKKYIIKSB5FTDA4PA/action/citation_signature","submit_replication":"https://pith.science/pith/KLLN4LFYBYKKYIIKSB5FTDA4PA/action/replication_record"}},"created_at":"2026-05-18T00:09:45.457570+00:00","updated_at":"2026-05-18T00:09:45.457570+00:00"}