{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5KHSIVQULLNPXAN56KZY5MF3FP","short_pith_number":"pith:5KHSIVQU","schema_version":"1.0","canonical_sha256":"ea8f2456145adafb81bdf2b38eb0bb2bed94412d015130f29de0e7e03ac050f3","source":{"kind":"arxiv","id":"1306.5224","version":1},"attestation_state":"computed","paper":{"title":"Euclidean Greedy Drawings of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Martin N\\\"ollenburg, Roman Prutkin","submitted_at":"2013-06-21T19:48:07Z","abstract_excerpt":"Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each source-destination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t according to some distance metric. The existence of greedy embeddings in the Euclidean plane R^2 is known for certain graph classes such as 3-connected planar graphs. We completely characterize the trees that admit a greedy embedding in R^2. This answers a question by Angelini et al. (Graph Drawing 2009) and is a further step in characterizing the graphs that adm"},"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.5224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-21T19:48:07Z","cross_cats_sorted":[],"title_canon_sha256":"f92cc79a7d51e8432d7a6eeb804d8ea845c0bf5a9318e2a49c5dc81e1f6e5d7a","abstract_canon_sha256":"60935d627082eb2b3d55459472e618be1224baa5165e45fd2a593bb4851ac8a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:19.361173Z","signature_b64":"Vr9CDpQWIV5Njy45CUYAXtPczPsCL3lyD8ntUdvbqGkDNcO3hd8nfah2VIZEluHtDX1+UPZlWEqhtz6a0NQmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea8f2456145adafb81bdf2b38eb0bb2bed94412d015130f29de0e7e03ac050f3","last_reissued_at":"2026-05-18T03:20:19.360366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:19.360366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Euclidean Greedy Drawings of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Martin N\\\"ollenburg, Roman Prutkin","submitted_at":"2013-06-21T19:48:07Z","abstract_excerpt":"Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each source-destination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t according to some distance metric. The existence of greedy embeddings in the Euclidean plane R^2 is known for certain graph classes such as 3-connected planar graphs. We completely characterize the trees that admit a greedy embedding in R^2. This answers a question by Angelini et al. (Graph Drawing 2009) and is a further step in characterizing the graphs that adm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5224","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.5224","created_at":"2026-05-18T03:20:19.360505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5224v1","created_at":"2026-05-18T03:20:19.360505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5224","created_at":"2026-05-18T03:20:19.360505+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KHSIVQULLNP","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KHSIVQULLNPXAN5","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KHSIVQU","created_at":"2026-05-18T12:27:34.582898+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/5KHSIVQULLNPXAN56KZY5MF3FP","json":"https://pith.science/pith/5KHSIVQULLNPXAN56KZY5MF3FP.json","graph_json":"https://pith.science/api/pith-number/5KHSIVQULLNPXAN56KZY5MF3FP/graph.json","events_json":"https://pith.science/api/pith-number/5KHSIVQULLNPXAN56KZY5MF3FP/events.json","paper":"https://pith.science/paper/5KHSIVQU"},"agent_actions":{"view_html":"https://pith.science/pith/5KHSIVQULLNPXAN56KZY5MF3FP","download_json":"https://pith.science/pith/5KHSIVQULLNPXAN56KZY5MF3FP.json","view_paper":"https://pith.science/paper/5KHSIVQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5224&json=true","fetch_graph":"https://pith.science/api/pith-number/5KHSIVQULLNPXAN56KZY5MF3FP/graph.json","fetch_events":"https://pith.science/api/pith-number/5KHSIVQULLNPXAN56KZY5MF3FP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KHSIVQULLNPXAN56KZY5MF3FP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KHSIVQULLNPXAN56KZY5MF3FP/action/storage_attestation","attest_author":"https://pith.science/pith/5KHSIVQULLNPXAN56KZY5MF3FP/action/author_attestation","sign_citation":"https://pith.science/pith/5KHSIVQULLNPXAN56KZY5MF3FP/action/citation_signature","submit_replication":"https://pith.science/pith/5KHSIVQULLNPXAN56KZY5MF3FP/action/replication_record"}},"created_at":"2026-05-18T03:20:19.360505+00:00","updated_at":"2026-05-18T03:20:19.360505+00:00"}