{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:V3WTMIVDBRJRIELP2XGHIXTS4I","short_pith_number":"pith:V3WTMIVD","schema_version":"1.0","canonical_sha256":"aeed3622a30c5314116fd5cc745e72e226cbc9677dde4541d84dcac11943e734","source":{"kind":"arxiv","id":"1612.09277","version":2},"attestation_state":"computed","paper":{"title":"On Planar Greedy Drawings of 3-Connected Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anthony D'Angelo, Fabrizio Frati, Giordano Da Lozzo","submitted_at":"2016-12-29T20:22:16Z","abstract_excerpt":"A graph drawing is $\\textit{greedy}$ if, for every ordered pair of vertices $(x,y)$, there is a path from $x$ to $y$ such that the Euclidean distance to $y$ decreases monotonically at every vertex of the path. Greedy drawings support a simple geometric routing scheme, in which any node that has to send a packet to a destination \"greedily\" forwards the packet to any neighbor that is closer to the destination than itself, according to the Euclidean distance in the drawing. In a greedy drawing such a neighbor always exists and hence this routing scheme is guaranteed to succeed.\n  In 2004 Papadimi"},"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":"1612.09277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-29T20:22:16Z","cross_cats_sorted":[],"title_canon_sha256":"718414ce39abbb2cf26c0b75af1fed95574b30399cd2895aa49c9bebf26f090e","abstract_canon_sha256":"d5f6866c13476bb4316d4fcaea98f862f88e1fc6e940252a4fb49e33d33438c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:39.647944Z","signature_b64":"ApWGzW1hsonvbPWWDR2ituDxs6lvSAaDDqHd80o6XQPwk3Bbcg2NhkdSAJonWPedJAPaCEfKefzX7zf4+knlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aeed3622a30c5314116fd5cc745e72e226cbc9677dde4541d84dcac11943e734","last_reissued_at":"2026-05-18T00:53:39.647515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:39.647515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Planar Greedy Drawings of 3-Connected Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anthony D'Angelo, Fabrizio Frati, Giordano Da Lozzo","submitted_at":"2016-12-29T20:22:16Z","abstract_excerpt":"A graph drawing is $\\textit{greedy}$ if, for every ordered pair of vertices $(x,y)$, there is a path from $x$ to $y$ such that the Euclidean distance to $y$ decreases monotonically at every vertex of the path. Greedy drawings support a simple geometric routing scheme, in which any node that has to send a packet to a destination \"greedily\" forwards the packet to any neighbor that is closer to the destination than itself, according to the Euclidean distance in the drawing. In a greedy drawing such a neighbor always exists and hence this routing scheme is guaranteed to succeed.\n  In 2004 Papadimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09277","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":"1612.09277","created_at":"2026-05-18T00:53:39.647585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.09277v2","created_at":"2026-05-18T00:53:39.647585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09277","created_at":"2026-05-18T00:53:39.647585+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3WTMIVDBRJR","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3WTMIVDBRJRIELP","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3WTMIVD","created_at":"2026-05-18T12:30:46.583412+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/V3WTMIVDBRJRIELP2XGHIXTS4I","json":"https://pith.science/pith/V3WTMIVDBRJRIELP2XGHIXTS4I.json","graph_json":"https://pith.science/api/pith-number/V3WTMIVDBRJRIELP2XGHIXTS4I/graph.json","events_json":"https://pith.science/api/pith-number/V3WTMIVDBRJRIELP2XGHIXTS4I/events.json","paper":"https://pith.science/paper/V3WTMIVD"},"agent_actions":{"view_html":"https://pith.science/pith/V3WTMIVDBRJRIELP2XGHIXTS4I","download_json":"https://pith.science/pith/V3WTMIVDBRJRIELP2XGHIXTS4I.json","view_paper":"https://pith.science/paper/V3WTMIVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.09277&json=true","fetch_graph":"https://pith.science/api/pith-number/V3WTMIVDBRJRIELP2XGHIXTS4I/graph.json","fetch_events":"https://pith.science/api/pith-number/V3WTMIVDBRJRIELP2XGHIXTS4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3WTMIVDBRJRIELP2XGHIXTS4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3WTMIVDBRJRIELP2XGHIXTS4I/action/storage_attestation","attest_author":"https://pith.science/pith/V3WTMIVDBRJRIELP2XGHIXTS4I/action/author_attestation","sign_citation":"https://pith.science/pith/V3WTMIVDBRJRIELP2XGHIXTS4I/action/citation_signature","submit_replication":"https://pith.science/pith/V3WTMIVDBRJRIELP2XGHIXTS4I/action/replication_record"}},"created_at":"2026-05-18T00:53:39.647585+00:00","updated_at":"2026-05-18T00:53:39.647585+00:00"}