{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GYS7CK3R4NB5L6QPGGQLVCFXQ3","short_pith_number":"pith:GYS7CK3R","schema_version":"1.0","canonical_sha256":"3625f12b71e343d5fa0f31a0ba88b786fc78508e3a75a59003a37a85b9fc06d7","source":{"kind":"arxiv","id":"1309.3963","version":1},"attestation_state":"computed","paper":{"title":"Trajectory-Based Dynamic Map Labeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andreas Gemsa, Benjamin Niedermann, Martin N\\\"ollenburg","submitted_at":"2013-09-16T13:59:51Z","abstract_excerpt":"In this paper we introduce trajectory-based labeling, a new variant of dynamic map labeling, where a movement trajectory for the map viewport is given. We define a general labeling model and study the active range maximization problem in this model. The problem is NP-complete and W[1]-hard. In the restricted, yet practically relevant case that no more than k labels can be active at any time, we give polynomial-time algorithms. For the general case we present a practical ILP formulation with an experimental evaluation as well as approximation algorithms."},"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":"1309.3963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-09-16T13:59:51Z","cross_cats_sorted":[],"title_canon_sha256":"e55d9231d806456129b46f32e490aeff6f8ee0550653cd92a386bf7f472005d7","abstract_canon_sha256":"c4398b1c7426c60b73f29c49eb525ee5de59d3dcc08814bb730c3ec035342030"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:11.643471Z","signature_b64":"qesGcmh10FjddXdKxtROIaMV1PsgNrrnhKQ7dpdVdRu7iB0JmqBkMkQiHEr0xtV3WFnygajxwc7lNg+DLktLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3625f12b71e343d5fa0f31a0ba88b786fc78508e3a75a59003a37a85b9fc06d7","last_reissued_at":"2026-05-18T03:13:11.642913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:11.642913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trajectory-Based Dynamic Map Labeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andreas Gemsa, Benjamin Niedermann, Martin N\\\"ollenburg","submitted_at":"2013-09-16T13:59:51Z","abstract_excerpt":"In this paper we introduce trajectory-based labeling, a new variant of dynamic map labeling, where a movement trajectory for the map viewport is given. We define a general labeling model and study the active range maximization problem in this model. The problem is NP-complete and W[1]-hard. In the restricted, yet practically relevant case that no more than k labels can be active at any time, we give polynomial-time algorithms. For the general case we present a practical ILP formulation with an experimental evaluation as well as approximation algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3963","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":"1309.3963","created_at":"2026-05-18T03:13:11.642999+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.3963v1","created_at":"2026-05-18T03:13:11.642999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3963","created_at":"2026-05-18T03:13:11.642999+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYS7CK3R4NB5","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYS7CK3R4NB5L6QP","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYS7CK3R","created_at":"2026-05-18T12:27:46.883200+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/GYS7CK3R4NB5L6QPGGQLVCFXQ3","json":"https://pith.science/pith/GYS7CK3R4NB5L6QPGGQLVCFXQ3.json","graph_json":"https://pith.science/api/pith-number/GYS7CK3R4NB5L6QPGGQLVCFXQ3/graph.json","events_json":"https://pith.science/api/pith-number/GYS7CK3R4NB5L6QPGGQLVCFXQ3/events.json","paper":"https://pith.science/paper/GYS7CK3R"},"agent_actions":{"view_html":"https://pith.science/pith/GYS7CK3R4NB5L6QPGGQLVCFXQ3","download_json":"https://pith.science/pith/GYS7CK3R4NB5L6QPGGQLVCFXQ3.json","view_paper":"https://pith.science/paper/GYS7CK3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.3963&json=true","fetch_graph":"https://pith.science/api/pith-number/GYS7CK3R4NB5L6QPGGQLVCFXQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/GYS7CK3R4NB5L6QPGGQLVCFXQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYS7CK3R4NB5L6QPGGQLVCFXQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYS7CK3R4NB5L6QPGGQLVCFXQ3/action/storage_attestation","attest_author":"https://pith.science/pith/GYS7CK3R4NB5L6QPGGQLVCFXQ3/action/author_attestation","sign_citation":"https://pith.science/pith/GYS7CK3R4NB5L6QPGGQLVCFXQ3/action/citation_signature","submit_replication":"https://pith.science/pith/GYS7CK3R4NB5L6QPGGQLVCFXQ3/action/replication_record"}},"created_at":"2026-05-18T03:13:11.642999+00:00","updated_at":"2026-05-18T03:13:11.642999+00:00"}