{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:6X7HRSG7NBUSFD3G64QDURK7OV","short_pith_number":"pith:6X7HRSG7","schema_version":"1.0","canonical_sha256":"f5fe78c8df6869228f66f7203a455f75638e51886de37673d9f945fe560d22ea","source":{"kind":"arxiv","id":"0911.0626","version":2},"attestation_state":"computed","paper":{"title":"Visualizing Graphs with Node and Edge Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Yifan Hu","submitted_at":"2009-11-03T17:44:59Z","abstract_excerpt":"When drawing graphs whose edges and nodes contain text or graphics, such informa tion needs to be displayed without overlaps, either as part of the initial layout or as a post-processing step. The core problem in removing overlaps lies in retaining the structural information inherent in a layout, minimizing the additional area required, and keeping edges as straight as possible. This paper presents a unified node and edge overlap removal algorithm that does well at solving this problem."},"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":"0911.0626","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-11-03T17:44:59Z","cross_cats_sorted":[],"title_canon_sha256":"980e673eebf6dc29d1b54b9e7039ae4c11f2d6945ff0ce4eed8facb57737d9b3","abstract_canon_sha256":"1992ecc89f6c225cca01b5ae26acfe2a5ca83a0fd41312c085d16d8f29e6161f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:59.567740Z","signature_b64":"/PlehjHG14GjG7gGCibUX/48cUqiSuPR7NKi34OPcev/YDb+0ReeEg1Ds9iI1V294BelGoNsymjDeLiL/ar1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5fe78c8df6869228f66f7203a455f75638e51886de37673d9f945fe560d22ea","last_reissued_at":"2026-05-18T01:04:59.567260Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:59.567260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Visualizing Graphs with Node and Edge Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Yifan Hu","submitted_at":"2009-11-03T17:44:59Z","abstract_excerpt":"When drawing graphs whose edges and nodes contain text or graphics, such informa tion needs to be displayed without overlaps, either as part of the initial layout or as a post-processing step. The core problem in removing overlaps lies in retaining the structural information inherent in a layout, minimizing the additional area required, and keeping edges as straight as possible. This paper presents a unified node and edge overlap removal algorithm that does well at solving this problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.0626","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":"0911.0626","created_at":"2026-05-18T01:04:59.567345+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.0626v2","created_at":"2026-05-18T01:04:59.567345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.0626","created_at":"2026-05-18T01:04:59.567345+00:00"},{"alias_kind":"pith_short_12","alias_value":"6X7HRSG7NBUS","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"6X7HRSG7NBUSFD3G","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"6X7HRSG7","created_at":"2026-05-18T12:25:58.837520+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/6X7HRSG7NBUSFD3G64QDURK7OV","json":"https://pith.science/pith/6X7HRSG7NBUSFD3G64QDURK7OV.json","graph_json":"https://pith.science/api/pith-number/6X7HRSG7NBUSFD3G64QDURK7OV/graph.json","events_json":"https://pith.science/api/pith-number/6X7HRSG7NBUSFD3G64QDURK7OV/events.json","paper":"https://pith.science/paper/6X7HRSG7"},"agent_actions":{"view_html":"https://pith.science/pith/6X7HRSG7NBUSFD3G64QDURK7OV","download_json":"https://pith.science/pith/6X7HRSG7NBUSFD3G64QDURK7OV.json","view_paper":"https://pith.science/paper/6X7HRSG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.0626&json=true","fetch_graph":"https://pith.science/api/pith-number/6X7HRSG7NBUSFD3G64QDURK7OV/graph.json","fetch_events":"https://pith.science/api/pith-number/6X7HRSG7NBUSFD3G64QDURK7OV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6X7HRSG7NBUSFD3G64QDURK7OV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6X7HRSG7NBUSFD3G64QDURK7OV/action/storage_attestation","attest_author":"https://pith.science/pith/6X7HRSG7NBUSFD3G64QDURK7OV/action/author_attestation","sign_citation":"https://pith.science/pith/6X7HRSG7NBUSFD3G64QDURK7OV/action/citation_signature","submit_replication":"https://pith.science/pith/6X7HRSG7NBUSFD3G64QDURK7OV/action/replication_record"}},"created_at":"2026-05-18T01:04:59.567345+00:00","updated_at":"2026-05-18T01:04:59.567345+00:00"}