{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:C6XSNFX2HGY2ICWMPFYGMMHFMK","short_pith_number":"pith:C6XSNFX2","canonical_record":{"source":{"id":"2504.21329","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-04-30T05:35:04Z","cross_cats_sorted":[],"title_canon_sha256":"1d68e747a5944646b933dcc49543d781fcdc63a3daa0d637e104ed09588b98ca","abstract_canon_sha256":"15ce7bfadae62f76d708d795883e368247554bbc9a6fa614d554f3238dd1c85b"},"schema_version":"1.0"},"canonical_sha256":"17af2696fa39b1a40acc79706630e562aa4e9498a67de24d0c1b413ec2cfc1e2","source":{"kind":"arxiv","id":"2504.21329","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.21329","created_at":"2026-07-05T11:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"2504.21329v2","created_at":"2026-07-05T11:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21329","created_at":"2026-07-05T11:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"C6XSNFX2HGY2","created_at":"2026-07-05T11:04:50Z"},{"alias_kind":"pith_short_16","alias_value":"C6XSNFX2HGY2ICWM","created_at":"2026-07-05T11:04:50Z"},{"alias_kind":"pith_short_8","alias_value":"C6XSNFX2","created_at":"2026-07-05T11:04:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:C6XSNFX2HGY2ICWMPFYGMMHFMK","target":"record","payload":{"canonical_record":{"source":{"id":"2504.21329","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-04-30T05:35:04Z","cross_cats_sorted":[],"title_canon_sha256":"1d68e747a5944646b933dcc49543d781fcdc63a3daa0d637e104ed09588b98ca","abstract_canon_sha256":"15ce7bfadae62f76d708d795883e368247554bbc9a6fa614d554f3238dd1c85b"},"schema_version":"1.0"},"canonical_sha256":"17af2696fa39b1a40acc79706630e562aa4e9498a67de24d0c1b413ec2cfc1e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:50.234832Z","signature_b64":"ICucAZEHfxica1GGTi1E6LUGO1Z02ql7uZp2HXl5cVgih9zY1YstXFgEEabV5PsBg/YSq0aO7ra9MpH8p8fTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17af2696fa39b1a40acc79706630e562aa4e9498a67de24d0c1b413ec2cfc1e2","last_reissued_at":"2026-07-05T11:04:50.234376Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:50.234376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.21329","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-07-05T11:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WhwMxlZLxfPcV36HU6/XumjeOhRm0lVX6xhk0MWsmN2zbpJY2xxtSi6j/ekcrwol3I81duGItbpLfutqL2R5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:37:19.419726Z"},"content_sha256":"97bed63f25eeacbd55e84c3f09bafef6e392fe100fee1ef6a3386aea058218dc","schema_version":"1.0","event_id":"sha256:97bed63f25eeacbd55e84c3f09bafef6e392fe100fee1ef6a3386aea058218dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:C6XSNFX2HGY2ICWMPFYGMMHFMK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Drawing Reeb Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Brittany Terese Fasy, Erfan Hosseini Sereshgi, Erin Chambers, Maarten L\\\"offler","submitted_at":"2025-04-30T05:35:04Z","abstract_excerpt":"Reeb graphs are simple topological descriptors with applications in many areas like topological data analysis and computational geometry. Despite their prevalence, visualization of Reeb graphs has received less attention. In this paper, we bridge an essential gap in the literature by exploring the complexity of drawing Reeb graphs. Specifically, we demonstrate that Reeb graph crossing number minimization is NP-hard, both for straight-lined and curved edges. On the other hand, we identify specific classes of Reeb graphs, namely paths and caterpillars, for which crossing-free drawings exist. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21329","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.21329/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"},"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-07-05T11:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CYgBqmwfERiCzwwrkmC1GjVv7g0rHjYWolV1t3m8GyANHcocXZ2MdSU68JgWV7rR3UMv2GD3e9Wqb/B6tUqCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:37:19.420106Z"},"content_sha256":"4354bed0095fd6c8826c62f9b87b72e6e69b76b344663d82a2b5890c48d6614c","schema_version":"1.0","event_id":"sha256:4354bed0095fd6c8826c62f9b87b72e6e69b76b344663d82a2b5890c48d6614c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C6XSNFX2HGY2ICWMPFYGMMHFMK/bundle.json","state_url":"https://pith.science/pith/C6XSNFX2HGY2ICWMPFYGMMHFMK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C6XSNFX2HGY2ICWMPFYGMMHFMK/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-07-07T09:37:19Z","links":{"resolver":"https://pith.science/pith/C6XSNFX2HGY2ICWMPFYGMMHFMK","bundle":"https://pith.science/pith/C6XSNFX2HGY2ICWMPFYGMMHFMK/bundle.json","state":"https://pith.science/pith/C6XSNFX2HGY2ICWMPFYGMMHFMK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C6XSNFX2HGY2ICWMPFYGMMHFMK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:C6XSNFX2HGY2ICWMPFYGMMHFMK","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":"15ce7bfadae62f76d708d795883e368247554bbc9a6fa614d554f3238dd1c85b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-04-30T05:35:04Z","title_canon_sha256":"1d68e747a5944646b933dcc49543d781fcdc63a3daa0d637e104ed09588b98ca"},"schema_version":"1.0","source":{"id":"2504.21329","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.21329","created_at":"2026-07-05T11:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"2504.21329v2","created_at":"2026-07-05T11:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21329","created_at":"2026-07-05T11:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"C6XSNFX2HGY2","created_at":"2026-07-05T11:04:50Z"},{"alias_kind":"pith_short_16","alias_value":"C6XSNFX2HGY2ICWM","created_at":"2026-07-05T11:04:50Z"},{"alias_kind":"pith_short_8","alias_value":"C6XSNFX2","created_at":"2026-07-05T11:04:50Z"}],"graph_snapshots":[{"event_id":"sha256:4354bed0095fd6c8826c62f9b87b72e6e69b76b344663d82a2b5890c48d6614c","target":"graph","created_at":"2026-07-05T11:04:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.21329/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Reeb graphs are simple topological descriptors with applications in many areas like topological data analysis and computational geometry. Despite their prevalence, visualization of Reeb graphs has received less attention. In this paper, we bridge an essential gap in the literature by exploring the complexity of drawing Reeb graphs. Specifically, we demonstrate that Reeb graph crossing number minimization is NP-hard, both for straight-lined and curved edges. On the other hand, we identify specific classes of Reeb graphs, namely paths and caterpillars, for which crossing-free drawings exist. We ","authors_text":"Brittany Terese Fasy, Erfan Hosseini Sereshgi, Erin Chambers, Maarten L\\\"offler","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-04-30T05:35:04Z","title":"Drawing Reeb Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21329","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:97bed63f25eeacbd55e84c3f09bafef6e392fe100fee1ef6a3386aea058218dc","target":"record","created_at":"2026-07-05T11:04:50Z","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":"15ce7bfadae62f76d708d795883e368247554bbc9a6fa614d554f3238dd1c85b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-04-30T05:35:04Z","title_canon_sha256":"1d68e747a5944646b933dcc49543d781fcdc63a3daa0d637e104ed09588b98ca"},"schema_version":"1.0","source":{"id":"2504.21329","kind":"arxiv","version":2}},"canonical_sha256":"17af2696fa39b1a40acc79706630e562aa4e9498a67de24d0c1b413ec2cfc1e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17af2696fa39b1a40acc79706630e562aa4e9498a67de24d0c1b413ec2cfc1e2","first_computed_at":"2026-07-05T11:04:50.234376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:04:50.234376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ICucAZEHfxica1GGTi1E6LUGO1Z02ql7uZp2HXl5cVgih9zY1YstXFgEEabV5PsBg/YSq0aO7ra9MpH8p8fTAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:04:50.234832Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.21329","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97bed63f25eeacbd55e84c3f09bafef6e392fe100fee1ef6a3386aea058218dc","sha256:4354bed0095fd6c8826c62f9b87b72e6e69b76b344663d82a2b5890c48d6614c"],"state_sha256":"7d16f59e597e255e1bb1b6e49cd90cd4c3b87b6321ca29b0034bbfa0b31db8af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QTcVcM2XOqjfbxRS7Oy4JiNYPZR/zUDXlhY+SXxZz5/DdESMmLtCuenVGeUuxiCcnCnmKftCi0Sw2w+PLG5vBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:37:19.422955Z","bundle_sha256":"5d6752fa4827c03beb5c162cbc4e7b56fdf22a57001d8b32d4e7eac05c086320"}}