{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DAVMFNCD4BNAPJWRNLHY4MEBEW","short_pith_number":"pith:DAVMFNCD","schema_version":"1.0","canonical_sha256":"182ac2b443e05a07a6d16acf8e308125bc4fa7810f7aea56f369679a16cd16bc","source":{"kind":"arxiv","id":"1305.0750","version":4},"attestation_state":"computed","paper":{"title":"Multi-Sided Boundary Labeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Andr\\'e Schulz, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, Philipp Kindermann","submitted_at":"2013-05-03T15:33:56Z","abstract_excerpt":"In the Boundary Labeling problem, we are given a set of $n$ points, referred to as sites, inside an axis-parallel rectangle $R$, and a set of $n$ pairwise disjoint rectangular labels that are attached to $R$ from the outside. The task is to connect the sites to the labels by non-intersecting rectilinear paths, so-called leaders, with at most one bend.\n  In this paper, we study the Multi-Sided Boundary Labeling problem, with labels lying on at least two sides of the enclosing rectangle. We present a polynomial-time algorithm that computes a crossing-free leader layout if one exists. So far, suc"},"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":"1305.0750","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-03T15:33:56Z","cross_cats_sorted":[],"title_canon_sha256":"62e8fa67ca066cc3684bc33df58c7919f9381c201db451cd2869b43c809b6152","abstract_canon_sha256":"d4caa7fe010dc9ee18ca088220bfb8453a797aad958441b4ea67853137c927f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:21.185854Z","signature_b64":"1ySN9mEezb4DXINKd88ti47XFgV7Ej/hMf8qGS9QoLugO4r5SmM78ymcSUnpo8MhU7JBcvfsnL0yJaAfITZYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"182ac2b443e05a07a6d16acf8e308125bc4fa7810f7aea56f369679a16cd16bc","last_reissued_at":"2026-05-18T00:06:21.185513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:21.185513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Sided Boundary Labeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Andr\\'e Schulz, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, Philipp Kindermann","submitted_at":"2013-05-03T15:33:56Z","abstract_excerpt":"In the Boundary Labeling problem, we are given a set of $n$ points, referred to as sites, inside an axis-parallel rectangle $R$, and a set of $n$ pairwise disjoint rectangular labels that are attached to $R$ from the outside. The task is to connect the sites to the labels by non-intersecting rectilinear paths, so-called leaders, with at most one bend.\n  In this paper, we study the Multi-Sided Boundary Labeling problem, with labels lying on at least two sides of the enclosing rectangle. We present a polynomial-time algorithm that computes a crossing-free leader layout if one exists. So far, suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0750","kind":"arxiv","version":4},"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":"1305.0750","created_at":"2026-05-18T00:06:21.185568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0750v4","created_at":"2026-05-18T00:06:21.185568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0750","created_at":"2026-05-18T00:06:21.185568+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAVMFNCD4BNA","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAVMFNCD4BNAPJWR","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAVMFNCD","created_at":"2026-05-18T12:27:40.988391+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/DAVMFNCD4BNAPJWRNLHY4MEBEW","json":"https://pith.science/pith/DAVMFNCD4BNAPJWRNLHY4MEBEW.json","graph_json":"https://pith.science/api/pith-number/DAVMFNCD4BNAPJWRNLHY4MEBEW/graph.json","events_json":"https://pith.science/api/pith-number/DAVMFNCD4BNAPJWRNLHY4MEBEW/events.json","paper":"https://pith.science/paper/DAVMFNCD"},"agent_actions":{"view_html":"https://pith.science/pith/DAVMFNCD4BNAPJWRNLHY4MEBEW","download_json":"https://pith.science/pith/DAVMFNCD4BNAPJWRNLHY4MEBEW.json","view_paper":"https://pith.science/paper/DAVMFNCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0750&json=true","fetch_graph":"https://pith.science/api/pith-number/DAVMFNCD4BNAPJWRNLHY4MEBEW/graph.json","fetch_events":"https://pith.science/api/pith-number/DAVMFNCD4BNAPJWRNLHY4MEBEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAVMFNCD4BNAPJWRNLHY4MEBEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAVMFNCD4BNAPJWRNLHY4MEBEW/action/storage_attestation","attest_author":"https://pith.science/pith/DAVMFNCD4BNAPJWRNLHY4MEBEW/action/author_attestation","sign_citation":"https://pith.science/pith/DAVMFNCD4BNAPJWRNLHY4MEBEW/action/citation_signature","submit_replication":"https://pith.science/pith/DAVMFNCD4BNAPJWRNLHY4MEBEW/action/replication_record"}},"created_at":"2026-05-18T00:06:21.185568+00:00","updated_at":"2026-05-18T00:06:21.185568+00:00"}