{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GJ4NIM43AJ3NON6UKTGH5Y2IST","short_pith_number":"pith:GJ4NIM43","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"},"canonical_sha256":"3278d4339b0276d737d454cc7ee34894ecf41a5b69c9bd6a9e8f2bafd9302ba6","source":{"kind":"arxiv","id":"1608.08161","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08161","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08161v2","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08161","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"pith_short_12","alias_value":"GJ4NIM43AJ3N","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GJ4NIM43AJ3NON6U","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GJ4NIM43","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GJ4NIM43AJ3NON6UKTGH5Y2IST","target":"record","payload":{"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"},"canonical_sha256":"3278d4339b0276d737d454cc7ee34894ecf41a5b69c9bd6a9e8f2bafd9302ba6","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"},"source_kind":"arxiv","source_id":"1608.08161","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:06:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0KywzkN7M/quqTxoyFyQfwSDIaGq1VKCh2A8jKbtgBI/mnTen8etxED6qihAryGYwALvLW1j2dH2vCAkBXGlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:52:31.132768Z"},"content_sha256":"aa8fb3ff18dd13e50344121ebe04c7e59c2fcf855f526cb71c962abd22dd42d8","schema_version":"1.0","event_id":"sha256:aa8fb3ff18dd13e50344121ebe04c7e59c2fcf855f526cb71c962abd22dd42d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GJ4NIM43AJ3NON6UKTGH5Y2IST","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:06:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jI6zbumo38MabUcrvWC6zOHqImpbj0z6wMNedLtcgl0tmkxeV4WkQDbOhTa5Zr4Mt9LOAWvSPiVrV1to2WeGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:52:31.133117Z"},"content_sha256":"435e9b3859bb77e4692a83e4b78ce3e6dc1d4a9016d347abd47916692fd5e3df","schema_version":"1.0","event_id":"sha256:435e9b3859bb77e4692a83e4b78ce3e6dc1d4a9016d347abd47916692fd5e3df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJ4NIM43AJ3NON6UKTGH5Y2IST/bundle.json","state_url":"https://pith.science/pith/GJ4NIM43AJ3NON6UKTGH5Y2IST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJ4NIM43AJ3NON6UKTGH5Y2IST/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T11:52:31Z","links":{"resolver":"https://pith.science/pith/GJ4NIM43AJ3NON6UKTGH5Y2IST","bundle":"https://pith.science/pith/GJ4NIM43AJ3NON6UKTGH5Y2IST/bundle.json","state":"https://pith.science/pith/GJ4NIM43AJ3NON6UKTGH5Y2IST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJ4NIM43AJ3NON6UKTGH5Y2IST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GJ4NIM43AJ3NON6UKTGH5Y2IST","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"591843484d7c186ee071a9cb9acd53131eacaa2fde9510b8eb6af1b2d6722eac","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-29T18:07:48Z","title_canon_sha256":"05b882f6fd65b1fca2a1e58a5a94d7c4434a12ff02794d7d89a2cc7c53a70bfc"},"schema_version":"1.0","source":{"id":"1608.08161","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08161","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08161v2","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08161","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"pith_short_12","alias_value":"GJ4NIM43AJ3N","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GJ4NIM43AJ3NON6U","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GJ4NIM43","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:435e9b3859bb77e4692a83e4b78ce3e6dc1d4a9016d347abd47916692fd5e3df","target":"graph","created_at":"2026-05-18T01:06:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Martin Fink, Md. Jawaherul Alam, Sergey Pupyrev","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-29T18:07:48Z","title":"The Bundled Crossing Number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08161","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:aa8fb3ff18dd13e50344121ebe04c7e59c2fcf855f526cb71c962abd22dd42d8","target":"record","created_at":"2026-05-18T01:06:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"591843484d7c186ee071a9cb9acd53131eacaa2fde9510b8eb6af1b2d6722eac","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-29T18:07:48Z","title_canon_sha256":"05b882f6fd65b1fca2a1e58a5a94d7c4434a12ff02794d7d89a2cc7c53a70bfc"},"schema_version":"1.0","source":{"id":"1608.08161","kind":"arxiv","version":2}},"canonical_sha256":"3278d4339b0276d737d454cc7ee34894ecf41a5b69c9bd6a9e8f2bafd9302ba6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3278d4339b0276d737d454cc7ee34894ecf41a5b69c9bd6a9e8f2bafd9302ba6","first_computed_at":"2026-05-18T01:06:28.310930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:28.310930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mjJHAhR66v4XcI7qGJoTnkKUHe0WtTSN3yB5j1dLmnmKNxdUjMW77zoNx77oYd8hsxC5v/4ZpbA+oQjBja3vDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:28.311394Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.08161","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa8fb3ff18dd13e50344121ebe04c7e59c2fcf855f526cb71c962abd22dd42d8","sha256:435e9b3859bb77e4692a83e4b78ce3e6dc1d4a9016d347abd47916692fd5e3df"],"state_sha256":"710be9d4140e3fa7f146a98d24d02009d4825336879a81a0e9af864b421aa5fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MOGhhDulCzfPIMg9JZX9r7PncXF1n4x6w5jfjqUrQoLGMKrA+nL9nJelL1yS2a4A6PogLJ8dw0TjgmkLWWTVAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:52:31.135098Z","bundle_sha256":"b8c8bb65e11a11fd6934f2174d8958e0e791d225fb309d0e9515460a053eb982"}}