{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GJ4NIM43AJ3NON6UKTGH5Y2IST","short_pith_number":"pith:GJ4NIM43","schema_version":"1.0","canonical_sha256":"3278d4339b0276d737d454cc7ee34894ecf41a5b69c9bd6a9e8f2bafd9302ba6","source":{"kind":"arxiv","id":"1608.08161","version":2},"attestation_state":"computed","paper":{"title":"The Bundled Crossing Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Martin Fink, Md. Jawaherul Alam, Sergey Pupyrev","submitted_at":"2016-08-29T18:07:48Z","abstract_excerpt":"We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number is the minimum number of bundled crossings that group all crossings in a drawing of the graph.\n  We show that the bundled crossing number is closely related to the orientable genus of the graph. If multiple crossings and self-intersections of edges are allowed, the two values are identical; otherwise, the bundled crossing number can be higher than the genus.\n  We then investigate the problem of minimizing the number"},"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":"1608.08161","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-29T18:07:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"05b882f6fd65b1fca2a1e58a5a94d7c4434a12ff02794d7d89a2cc7c53a70bfc","abstract_canon_sha256":"591843484d7c186ee071a9cb9acd53131eacaa2fde9510b8eb6af1b2d6722eac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:28.311394Z","signature_b64":"mjJHAhR66v4XcI7qGJoTnkKUHe0WtTSN3yB5j1dLmnmKNxdUjMW77zoNx77oYd8hsxC5v/4ZpbA+oQjBja3vDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3278d4339b0276d737d454cc7ee34894ecf41a5b69c9bd6a9e8f2bafd9302ba6","last_reissued_at":"2026-05-18T01:06:28.310930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:28.310930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Bundled Crossing Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Martin Fink, Md. Jawaherul Alam, Sergey Pupyrev","submitted_at":"2016-08-29T18:07:48Z","abstract_excerpt":"We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number is the minimum number of bundled crossings that group all crossings in a drawing of the graph.\n  We show that the bundled crossing number is closely related to the orientable genus of the graph. If multiple crossings and self-intersections of edges are allowed, the two values are identical; otherwise, the bundled crossing number can be higher than the genus.\n  We then investigate the problem of minimizing the number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08161","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":"1608.08161","created_at":"2026-05-18T01:06:28.310999+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08161v2","created_at":"2026-05-18T01:06:28.310999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08161","created_at":"2026-05-18T01:06:28.310999+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJ4NIM43AJ3N","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJ4NIM43AJ3NON6U","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJ4NIM43","created_at":"2026-05-18T12:30:19.053100+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/GJ4NIM43AJ3NON6UKTGH5Y2IST","json":"https://pith.science/pith/GJ4NIM43AJ3NON6UKTGH5Y2IST.json","graph_json":"https://pith.science/api/pith-number/GJ4NIM43AJ3NON6UKTGH5Y2IST/graph.json","events_json":"https://pith.science/api/pith-number/GJ4NIM43AJ3NON6UKTGH5Y2IST/events.json","paper":"https://pith.science/paper/GJ4NIM43"},"agent_actions":{"view_html":"https://pith.science/pith/GJ4NIM43AJ3NON6UKTGH5Y2IST","download_json":"https://pith.science/pith/GJ4NIM43AJ3NON6UKTGH5Y2IST.json","view_paper":"https://pith.science/paper/GJ4NIM43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08161&json=true","fetch_graph":"https://pith.science/api/pith-number/GJ4NIM43AJ3NON6UKTGH5Y2IST/graph.json","fetch_events":"https://pith.science/api/pith-number/GJ4NIM43AJ3NON6UKTGH5Y2IST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJ4NIM43AJ3NON6UKTGH5Y2IST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJ4NIM43AJ3NON6UKTGH5Y2IST/action/storage_attestation","attest_author":"https://pith.science/pith/GJ4NIM43AJ3NON6UKTGH5Y2IST/action/author_attestation","sign_citation":"https://pith.science/pith/GJ4NIM43AJ3NON6UKTGH5Y2IST/action/citation_signature","submit_replication":"https://pith.science/pith/GJ4NIM43AJ3NON6UKTGH5Y2IST/action/replication_record"}},"created_at":"2026-05-18T01:06:28.310999+00:00","updated_at":"2026-05-18T01:06:28.310999+00:00"}