{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OX7ASJG2OHONYRPZ6RJLM5TIVY","short_pith_number":"pith:OX7ASJG2","schema_version":"1.0","canonical_sha256":"75fe0924da71dcdc45f9f452b67668ae3bf4600f6f5f54d98668d6486759dad2","source":{"kind":"arxiv","id":"1306.5460","version":1},"attestation_state":"computed","paper":{"title":"Self-Approaching Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anna Lubiw, Elyot Grant, Soroush Alamdari, Timothy M. Chan, Vinayak Pathak","submitted_at":"2013-06-23T19:14:51Z","abstract_excerpt":"In this paper we introduce self-approaching graph drawings. A straight-line drawing of a graph is self-approaching if, for any origin vertex s and any destination vertex t, there is an st-path in the graph such that, for any point q on the path, as a point p moves continuously along the path from the origin to q, the Euclidean distance from p to q is always decreasing. This is a more stringent condition than a greedy drawing (where only the distance between vertices on the path and the destination vertex must decrease), and guarantees that the drawing is a 5.33-spanner. We study three topics: "},"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":"1306.5460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-23T19:14:51Z","cross_cats_sorted":[],"title_canon_sha256":"244f4248b22f47e254c815a611359e10f2f3207f2e0d437fb3d9324f5a60752b","abstract_canon_sha256":"914d9e5f5f798b6e647b5ffe51f46562929aede8efd9aea7ad858def82fd5f59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:51.796771Z","signature_b64":"VvX7sBVSdPPyF/oJbbUljcG+OwIKFinFaRKGqId3KjKRMP2Q5jT2HTr0MFfdDhll0vgj3lnQPo4+FlHJtE7BAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75fe0924da71dcdc45f9f452b67668ae3bf4600f6f5f54d98668d6486759dad2","last_reissued_at":"2026-05-18T00:56:51.796285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:51.796285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Approaching Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anna Lubiw, Elyot Grant, Soroush Alamdari, Timothy M. Chan, Vinayak Pathak","submitted_at":"2013-06-23T19:14:51Z","abstract_excerpt":"In this paper we introduce self-approaching graph drawings. A straight-line drawing of a graph is self-approaching if, for any origin vertex s and any destination vertex t, there is an st-path in the graph such that, for any point q on the path, as a point p moves continuously along the path from the origin to q, the Euclidean distance from p to q is always decreasing. This is a more stringent condition than a greedy drawing (where only the distance between vertices on the path and the destination vertex must decrease), and guarantees that the drawing is a 5.33-spanner. We study three topics: "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5460","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":"1306.5460","created_at":"2026-05-18T00:56:51.796374+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5460v1","created_at":"2026-05-18T00:56:51.796374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5460","created_at":"2026-05-18T00:56:51.796374+00:00"},{"alias_kind":"pith_short_12","alias_value":"OX7ASJG2OHON","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OX7ASJG2OHONYRPZ","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OX7ASJG2","created_at":"2026-05-18T12:27:54.935989+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/OX7ASJG2OHONYRPZ6RJLM5TIVY","json":"https://pith.science/pith/OX7ASJG2OHONYRPZ6RJLM5TIVY.json","graph_json":"https://pith.science/api/pith-number/OX7ASJG2OHONYRPZ6RJLM5TIVY/graph.json","events_json":"https://pith.science/api/pith-number/OX7ASJG2OHONYRPZ6RJLM5TIVY/events.json","paper":"https://pith.science/paper/OX7ASJG2"},"agent_actions":{"view_html":"https://pith.science/pith/OX7ASJG2OHONYRPZ6RJLM5TIVY","download_json":"https://pith.science/pith/OX7ASJG2OHONYRPZ6RJLM5TIVY.json","view_paper":"https://pith.science/paper/OX7ASJG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5460&json=true","fetch_graph":"https://pith.science/api/pith-number/OX7ASJG2OHONYRPZ6RJLM5TIVY/graph.json","fetch_events":"https://pith.science/api/pith-number/OX7ASJG2OHONYRPZ6RJLM5TIVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OX7ASJG2OHONYRPZ6RJLM5TIVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OX7ASJG2OHONYRPZ6RJLM5TIVY/action/storage_attestation","attest_author":"https://pith.science/pith/OX7ASJG2OHONYRPZ6RJLM5TIVY/action/author_attestation","sign_citation":"https://pith.science/pith/OX7ASJG2OHONYRPZ6RJLM5TIVY/action/citation_signature","submit_replication":"https://pith.science/pith/OX7ASJG2OHONYRPZ6RJLM5TIVY/action/replication_record"}},"created_at":"2026-05-18T00:56:51.796374+00:00","updated_at":"2026-05-18T00:56:51.796374+00:00"}