{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MF35263R75FQB7GGPVEWJKTXB3","short_pith_number":"pith:MF35263R","schema_version":"1.0","canonical_sha256":"6177dd7b71ff4b00fcc67d4964aa770eca302c0f7fd4805a26659eddf7312322","source":{"kind":"arxiv","id":"1509.05635","version":2},"attestation_state":"computed","paper":{"title":"Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ignaz Rutter, Martin N\\\"ollenburg, Roman Prutkin","submitted_at":"2015-09-18T14:10:26Z","abstract_excerpt":"A greedily routable region (GRR) is a closed subset of $\\mathbb R^2$, in which each destination point can be reached from each starting point by choosing the direction with maximum reduction of the distance to the destination in each point of the path.\n  Recently, Tan and Kermarrec proposed a geographic routing protocol for dense wireless sensor networks based on decomposing the network area into a small number of interior-disjoint GRRs. They showed that minimum decomposition is NP-hard for polygons with holes.\n  We consider minimum GRR decomposition for plane straight-line drawings of graphs."},"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":"1509.05635","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-18T14:10:26Z","cross_cats_sorted":[],"title_canon_sha256":"3bc674bfa32ce7b70937365fb7aaf0308547bf6b83042f804af587df5d3933b2","abstract_canon_sha256":"cede70019e7b216692110c477c3778a896f36c793e8bdeb60d1a8ed9fc1605b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:52.560127Z","signature_b64":"UM4P+/2Z6jPqjyQk3OIw1U6DjV18o8xeZjod577pgwdVyCoXomu+xGPYwYUvBNLuXhVm+01HjiOIUq5mfv+dDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6177dd7b71ff4b00fcc67d4964aa770eca302c0f7fd4805a26659eddf7312322","last_reissued_at":"2026-05-18T00:49:52.559753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:52.559753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ignaz Rutter, Martin N\\\"ollenburg, Roman Prutkin","submitted_at":"2015-09-18T14:10:26Z","abstract_excerpt":"A greedily routable region (GRR) is a closed subset of $\\mathbb R^2$, in which each destination point can be reached from each starting point by choosing the direction with maximum reduction of the distance to the destination in each point of the path.\n  Recently, Tan and Kermarrec proposed a geographic routing protocol for dense wireless sensor networks based on decomposing the network area into a small number of interior-disjoint GRRs. They showed that minimum decomposition is NP-hard for polygons with holes.\n  We consider minimum GRR decomposition for plane straight-line drawings of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05635","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":"1509.05635","created_at":"2026-05-18T00:49:52.559810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05635v2","created_at":"2026-05-18T00:49:52.559810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05635","created_at":"2026-05-18T00:49:52.559810+00:00"},{"alias_kind":"pith_short_12","alias_value":"MF35263R75FQ","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MF35263R75FQB7GG","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MF35263R","created_at":"2026-05-18T12:29:32.376354+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/MF35263R75FQB7GGPVEWJKTXB3","json":"https://pith.science/pith/MF35263R75FQB7GGPVEWJKTXB3.json","graph_json":"https://pith.science/api/pith-number/MF35263R75FQB7GGPVEWJKTXB3/graph.json","events_json":"https://pith.science/api/pith-number/MF35263R75FQB7GGPVEWJKTXB3/events.json","paper":"https://pith.science/paper/MF35263R"},"agent_actions":{"view_html":"https://pith.science/pith/MF35263R75FQB7GGPVEWJKTXB3","download_json":"https://pith.science/pith/MF35263R75FQB7GGPVEWJKTXB3.json","view_paper":"https://pith.science/paper/MF35263R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05635&json=true","fetch_graph":"https://pith.science/api/pith-number/MF35263R75FQB7GGPVEWJKTXB3/graph.json","fetch_events":"https://pith.science/api/pith-number/MF35263R75FQB7GGPVEWJKTXB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MF35263R75FQB7GGPVEWJKTXB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MF35263R75FQB7GGPVEWJKTXB3/action/storage_attestation","attest_author":"https://pith.science/pith/MF35263R75FQB7GGPVEWJKTXB3/action/author_attestation","sign_citation":"https://pith.science/pith/MF35263R75FQB7GGPVEWJKTXB3/action/citation_signature","submit_replication":"https://pith.science/pith/MF35263R75FQB7GGPVEWJKTXB3/action/replication_record"}},"created_at":"2026-05-18T00:49:52.559810+00:00","updated_at":"2026-05-18T00:49:52.559810+00:00"}