{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:X32D5RIDQ4ZGPMNIP3RVJWNDIK","short_pith_number":"pith:X32D5RID","schema_version":"1.0","canonical_sha256":"bef43ec503873267b1a87ee354d9a342aa71ec4704917f81f24dbbcffc9d6590","source":{"kind":"arxiv","id":"1501.06813","version":1},"attestation_state":"computed","paper":{"title":"Mixed Map Labeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Staals, Maarten L\\\"offler, Martin N\\\"ollenburg","submitted_at":"2015-01-27T16:40:19Z","abstract_excerpt":"Point feature map labeling is a geometric problem, in which a set of input points must be labeled with a set of disjoint rectangles (the bounding boxes of the label texts). Typically, labeling models either use internal labels, which must touch their feature point, or external (boundary) labels, which are placed on one of the four sides of the input points' bounding box and which are connected to their feature points by crossing-free leader lines. In this paper we study polynomial-time algorithms for maximizing the number of internal labels in a mixed labeling model that combines internal and "},"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":"1501.06813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-27T16:40:19Z","cross_cats_sorted":[],"title_canon_sha256":"54887b2e47be32427fc4c76c01fbad2468273fd83fe1b065ccfe37169d23a521","abstract_canon_sha256":"ea9a99921c2f6f1889a596fbaf4619cce8065ea17c6e125b158564146821ce96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:32.568671Z","signature_b64":"44Vtrik+hELpe1qO/rqQxM4UgF2MROG487GkCDccQTynGPzoUEEsv/YbtwJwnH+PoJ75nZBpSme76TAu0KCuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bef43ec503873267b1a87ee354d9a342aa71ec4704917f81f24dbbcffc9d6590","last_reissued_at":"2026-05-18T02:28:32.568035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:32.568035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixed Map Labeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Staals, Maarten L\\\"offler, Martin N\\\"ollenburg","submitted_at":"2015-01-27T16:40:19Z","abstract_excerpt":"Point feature map labeling is a geometric problem, in which a set of input points must be labeled with a set of disjoint rectangles (the bounding boxes of the label texts). Typically, labeling models either use internal labels, which must touch their feature point, or external (boundary) labels, which are placed on one of the four sides of the input points' bounding box and which are connected to their feature points by crossing-free leader lines. In this paper we study polynomial-time algorithms for maximizing the number of internal labels in a mixed labeling model that combines internal and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06813","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":"1501.06813","created_at":"2026-05-18T02:28:32.568148+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06813v1","created_at":"2026-05-18T02:28:32.568148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06813","created_at":"2026-05-18T02:28:32.568148+00:00"},{"alias_kind":"pith_short_12","alias_value":"X32D5RIDQ4ZG","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"X32D5RIDQ4ZGPMNI","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"X32D5RID","created_at":"2026-05-18T12:29:47.479230+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/X32D5RIDQ4ZGPMNIP3RVJWNDIK","json":"https://pith.science/pith/X32D5RIDQ4ZGPMNIP3RVJWNDIK.json","graph_json":"https://pith.science/api/pith-number/X32D5RIDQ4ZGPMNIP3RVJWNDIK/graph.json","events_json":"https://pith.science/api/pith-number/X32D5RIDQ4ZGPMNIP3RVJWNDIK/events.json","paper":"https://pith.science/paper/X32D5RID"},"agent_actions":{"view_html":"https://pith.science/pith/X32D5RIDQ4ZGPMNIP3RVJWNDIK","download_json":"https://pith.science/pith/X32D5RIDQ4ZGPMNIP3RVJWNDIK.json","view_paper":"https://pith.science/paper/X32D5RID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06813&json=true","fetch_graph":"https://pith.science/api/pith-number/X32D5RIDQ4ZGPMNIP3RVJWNDIK/graph.json","fetch_events":"https://pith.science/api/pith-number/X32D5RIDQ4ZGPMNIP3RVJWNDIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X32D5RIDQ4ZGPMNIP3RVJWNDIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X32D5RIDQ4ZGPMNIP3RVJWNDIK/action/storage_attestation","attest_author":"https://pith.science/pith/X32D5RIDQ4ZGPMNIP3RVJWNDIK/action/author_attestation","sign_citation":"https://pith.science/pith/X32D5RIDQ4ZGPMNIP3RVJWNDIK/action/citation_signature","submit_replication":"https://pith.science/pith/X32D5RIDQ4ZGPMNIP3RVJWNDIK/action/replication_record"}},"created_at":"2026-05-18T02:28:32.568148+00:00","updated_at":"2026-05-18T02:28:32.568148+00:00"}