{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BQFKMLR47LO6SHEWLMMMG3QEUD","short_pith_number":"pith:BQFKMLR4","schema_version":"1.0","canonical_sha256":"0c0aa62e3cfadde91c965b18c36e04a0c349e5c1bac3b8834d4dc8b2afcf53ba","source":{"kind":"arxiv","id":"1712.05936","version":1},"attestation_state":"computed","paper":{"title":"A fast and practical grid based algorithm for point-feature label placement problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Kemal Leblebicioglu, Yasemin Ozkan Aydin","submitted_at":"2017-12-16T10:48:47Z","abstract_excerpt":"Point-feature label placement (PFLP) is a major area of interest within the filed of automated cartography, geographic information systems (GIS), and computer graphics. The objective of a label placement problem is to assign a label to each point feature so as to avoid conflicts, considering the cartographic conventions. According to computational complexity analysis, the labeling problem has been shown to be NP-Hard. It is also very challenging to find a computationally efficient algorithm that is intended to be used for both static and dynamic map labeling. In this paper, we propose a heuris"},"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":"1712.05936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2017-12-16T10:48:47Z","cross_cats_sorted":[],"title_canon_sha256":"0c1d0db4576cd9fb341e28f63632febfdc7f91ff35445c54165b37300dd1d859","abstract_canon_sha256":"23addec1b0f990d351370931636fa6a334d85e2fbfed9a7eca147b0307a55354"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:51.457031Z","signature_b64":"m1VDjX7qOjgm+KHdJFmRou98WIFkuO421ViaI3Yppta8pTU/zSO2r9IuRgkOOHIPY3gGqi40RwQQu330DGyaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c0aa62e3cfadde91c965b18c36e04a0c349e5c1bac3b8834d4dc8b2afcf53ba","last_reissued_at":"2026-05-18T00:27:51.456517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:51.456517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast and practical grid based algorithm for point-feature label placement problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Kemal Leblebicioglu, Yasemin Ozkan Aydin","submitted_at":"2017-12-16T10:48:47Z","abstract_excerpt":"Point-feature label placement (PFLP) is a major area of interest within the filed of automated cartography, geographic information systems (GIS), and computer graphics. The objective of a label placement problem is to assign a label to each point feature so as to avoid conflicts, considering the cartographic conventions. According to computational complexity analysis, the labeling problem has been shown to be NP-Hard. It is also very challenging to find a computationally efficient algorithm that is intended to be used for both static and dynamic map labeling. In this paper, we propose a heuris"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05936","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":"1712.05936","created_at":"2026-05-18T00:27:51.456590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05936v1","created_at":"2026-05-18T00:27:51.456590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05936","created_at":"2026-05-18T00:27:51.456590+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQFKMLR47LO6","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQFKMLR47LO6SHEW","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQFKMLR4","created_at":"2026-05-18T12:31:08.081275+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/BQFKMLR47LO6SHEWLMMMG3QEUD","json":"https://pith.science/pith/BQFKMLR47LO6SHEWLMMMG3QEUD.json","graph_json":"https://pith.science/api/pith-number/BQFKMLR47LO6SHEWLMMMG3QEUD/graph.json","events_json":"https://pith.science/api/pith-number/BQFKMLR47LO6SHEWLMMMG3QEUD/events.json","paper":"https://pith.science/paper/BQFKMLR4"},"agent_actions":{"view_html":"https://pith.science/pith/BQFKMLR47LO6SHEWLMMMG3QEUD","download_json":"https://pith.science/pith/BQFKMLR47LO6SHEWLMMMG3QEUD.json","view_paper":"https://pith.science/paper/BQFKMLR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05936&json=true","fetch_graph":"https://pith.science/api/pith-number/BQFKMLR47LO6SHEWLMMMG3QEUD/graph.json","fetch_events":"https://pith.science/api/pith-number/BQFKMLR47LO6SHEWLMMMG3QEUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQFKMLR47LO6SHEWLMMMG3QEUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQFKMLR47LO6SHEWLMMMG3QEUD/action/storage_attestation","attest_author":"https://pith.science/pith/BQFKMLR47LO6SHEWLMMMG3QEUD/action/author_attestation","sign_citation":"https://pith.science/pith/BQFKMLR47LO6SHEWLMMMG3QEUD/action/citation_signature","submit_replication":"https://pith.science/pith/BQFKMLR47LO6SHEWLMMMG3QEUD/action/replication_record"}},"created_at":"2026-05-18T00:27:51.456590+00:00","updated_at":"2026-05-18T00:27:51.456590+00:00"}