{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:MHEWGHYZG7GKC3QGGFV75W24I5","short_pith_number":"pith:MHEWGHYZ","schema_version":"1.0","canonical_sha256":"61c9631f1937cca16e06316bfedb5c4758d2f818ead2f889b92c2870b993e4ca","source":{"kind":"arxiv","id":"2108.00671","version":1},"attestation_state":"computed","paper":{"title":"Automatic Polygon Layout for Primal-Dual Visualization of Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Botong Qu, Eugene Zhang, Yue Zhang","submitted_at":"2021-08-02T07:16:23Z","abstract_excerpt":"N-ary relationships, which relate N entities where N is not necessarily two, can be visually represented as polygons whose vertices are the entities of the relationships. Manually generating a high-quality layout using this representation is labor-intensive. In this paper, we provide an automatic polygon layout generation algorithm for the visualization of N-ary relationships. At the core of our algorithm is a set of objective functions motivated by a number of design principles that we have identified. These objective functions are then used in an optimization framework that we develop to ach"},"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":"2108.00671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2021-08-02T07:16:23Z","cross_cats_sorted":[],"title_canon_sha256":"6cca2f45ab18f4e2e327effe80858c08ac90aa61bfbe2fc86675664f6262f890","abstract_canon_sha256":"9efbad3a803d955e7c1c2c8cd62cba0a49e9ab11ab5ffca769e675976342c265"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:02:25.699681Z","signature_b64":"HOoaoX8Czw8r5ehHqsdhcgt+VgyJxcdannJ/xP4kVe3XTlCFJiJXw57xV+kREEQC6rrb39HLP69sF/FUT/QQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61c9631f1937cca16e06316bfedb5c4758d2f818ead2f889b92c2870b993e4ca","last_reissued_at":"2026-07-05T03:02:25.699285Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:02:25.699285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Polygon Layout for Primal-Dual Visualization of Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Botong Qu, Eugene Zhang, Yue Zhang","submitted_at":"2021-08-02T07:16:23Z","abstract_excerpt":"N-ary relationships, which relate N entities where N is not necessarily two, can be visually represented as polygons whose vertices are the entities of the relationships. Manually generating a high-quality layout using this representation is labor-intensive. In this paper, we provide an automatic polygon layout generation algorithm for the visualization of N-ary relationships. At the core of our algorithm is a set of objective functions motivated by a number of design principles that we have identified. These objective functions are then used in an optimization framework that we develop to ach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.00671","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.00671/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2108.00671","created_at":"2026-07-05T03:02:25.699355+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.00671v1","created_at":"2026-07-05T03:02:25.699355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.00671","created_at":"2026-07-05T03:02:25.699355+00:00"},{"alias_kind":"pith_short_12","alias_value":"MHEWGHYZG7GK","created_at":"2026-07-05T03:02:25.699355+00:00"},{"alias_kind":"pith_short_16","alias_value":"MHEWGHYZG7GKC3QG","created_at":"2026-07-05T03:02:25.699355+00:00"},{"alias_kind":"pith_short_8","alias_value":"MHEWGHYZ","created_at":"2026-07-05T03:02:25.699355+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/MHEWGHYZG7GKC3QGGFV75W24I5","json":"https://pith.science/pith/MHEWGHYZG7GKC3QGGFV75W24I5.json","graph_json":"https://pith.science/api/pith-number/MHEWGHYZG7GKC3QGGFV75W24I5/graph.json","events_json":"https://pith.science/api/pith-number/MHEWGHYZG7GKC3QGGFV75W24I5/events.json","paper":"https://pith.science/paper/MHEWGHYZ"},"agent_actions":{"view_html":"https://pith.science/pith/MHEWGHYZG7GKC3QGGFV75W24I5","download_json":"https://pith.science/pith/MHEWGHYZG7GKC3QGGFV75W24I5.json","view_paper":"https://pith.science/paper/MHEWGHYZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.00671&json=true","fetch_graph":"https://pith.science/api/pith-number/MHEWGHYZG7GKC3QGGFV75W24I5/graph.json","fetch_events":"https://pith.science/api/pith-number/MHEWGHYZG7GKC3QGGFV75W24I5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MHEWGHYZG7GKC3QGGFV75W24I5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MHEWGHYZG7GKC3QGGFV75W24I5/action/storage_attestation","attest_author":"https://pith.science/pith/MHEWGHYZG7GKC3QGGFV75W24I5/action/author_attestation","sign_citation":"https://pith.science/pith/MHEWGHYZG7GKC3QGGFV75W24I5/action/citation_signature","submit_replication":"https://pith.science/pith/MHEWGHYZG7GKC3QGGFV75W24I5/action/replication_record"}},"created_at":"2026-07-05T03:02:25.699355+00:00","updated_at":"2026-07-05T03:02:25.699355+00:00"}