{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DGQ2VZPMD37XPHL46MPOSQMK6N","short_pith_number":"pith:DGQ2VZPM","canonical_record":{"source":{"id":"1709.09209","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-26T18:21:59Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"43646afc68a8f43fb41ffdb6efb7910961faecc891c6dc7907b69d3acc92b534","abstract_canon_sha256":"78572f03db2f3d6f8fadc93e79bb264edba7fe4860bbde1c5415865030dbaf96"},"schema_version":"1.0"},"canonical_sha256":"19a1aae5ec1eff779d7cf31ee9418af37e0c19879e9781f376871fc595723176","source":{"kind":"arxiv","id":"1709.09209","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09209","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09209v2","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09209","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"pith_short_12","alias_value":"DGQ2VZPMD37X","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DGQ2VZPMD37XPHL4","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DGQ2VZPM","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DGQ2VZPMD37XPHL46MPOSQMK6N","target":"record","payload":{"canonical_record":{"source":{"id":"1709.09209","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-26T18:21:59Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"43646afc68a8f43fb41ffdb6efb7910961faecc891c6dc7907b69d3acc92b534","abstract_canon_sha256":"78572f03db2f3d6f8fadc93e79bb264edba7fe4860bbde1c5415865030dbaf96"},"schema_version":"1.0"},"canonical_sha256":"19a1aae5ec1eff779d7cf31ee9418af37e0c19879e9781f376871fc595723176","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:58.905594Z","signature_b64":"s/+le45IsklK5j31+CT6hZAfWXvQIR4O4pEYNzYLHLIBk4m16gJ3WXu/LENQEIIT+onNKJd1I43reAWNnKRfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19a1aae5ec1eff779d7cf31ee9418af37e0c19879e9781f376871fc595723176","last_reissued_at":"2026-05-17T23:39:58.905003Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:58.905003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.09209","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-17T23:39:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wfOAFqzNgQ8dZMAvinO/gM2027E/gvUTG41qroR5iA8GgprnXKVJIUmcMioeLJmRiOTmLUVkM0KULw/dqu6+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:09:23.034385Z"},"content_sha256":"97a335fcb6235d0dcb122878ddc9e223e9b69ecf630f13cbf45d32e011d754e1","schema_version":"1.0","event_id":"sha256:97a335fcb6235d0dcb122878ddc9e223e9b69ecf630f13cbf45d32e011d754e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DGQ2VZPMD37XPHL46MPOSQMK6N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recognizing Weak Embeddings of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CG","authors_text":"Csaba D. T\\'oth, Hugo A. Akitaya, Radoslav Fulek","submitted_at":"2017-09-26T18:21:59Z","abstract_excerpt":"We present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding $\\varphi:G\\rightarrow M$ of a graph $G$ into a 2-manifold $M$ maps the vertices in $V(G)$ to distinct points and the edges in $E(G)$ to interior-disjoint Jordan arcs between the corresponding vertices. In applications in clustering, cartography, and visualization, nearby vertices and edges are often bundled to the same point or overlapping arcs, due to data compression or low resolution. This raises the computational problem of deciding whether a given map $\\varphi:G\\rightarro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09209","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-17T23:39:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tmvVMId+xQAU8eF5V+uifJ/+M18c6GCvGZkzkHeWFAFCXA+7tYB4adDbrkaO11MxiumNgHmfRbF03q+Ky1M5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:09:23.035014Z"},"content_sha256":"0d952962ed5f4608952beeec433935397fab2fe1c57ca8919da16af9dc4fd39a","schema_version":"1.0","event_id":"sha256:0d952962ed5f4608952beeec433935397fab2fe1c57ca8919da16af9dc4fd39a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DGQ2VZPMD37XPHL46MPOSQMK6N/bundle.json","state_url":"https://pith.science/pith/DGQ2VZPMD37XPHL46MPOSQMK6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DGQ2VZPMD37XPHL46MPOSQMK6N/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-27T16:09:23Z","links":{"resolver":"https://pith.science/pith/DGQ2VZPMD37XPHL46MPOSQMK6N","bundle":"https://pith.science/pith/DGQ2VZPMD37XPHL46MPOSQMK6N/bundle.json","state":"https://pith.science/pith/DGQ2VZPMD37XPHL46MPOSQMK6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DGQ2VZPMD37XPHL46MPOSQMK6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DGQ2VZPMD37XPHL46MPOSQMK6N","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":"78572f03db2f3d6f8fadc93e79bb264edba7fe4860bbde1c5415865030dbaf96","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-26T18:21:59Z","title_canon_sha256":"43646afc68a8f43fb41ffdb6efb7910961faecc891c6dc7907b69d3acc92b534"},"schema_version":"1.0","source":{"id":"1709.09209","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09209","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09209v2","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09209","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"pith_short_12","alias_value":"DGQ2VZPMD37X","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DGQ2VZPMD37XPHL4","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DGQ2VZPM","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:0d952962ed5f4608952beeec433935397fab2fe1c57ca8919da16af9dc4fd39a","target":"graph","created_at":"2026-05-17T23:39:58Z","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 present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding $\\varphi:G\\rightarrow M$ of a graph $G$ into a 2-manifold $M$ maps the vertices in $V(G)$ to distinct points and the edges in $E(G)$ to interior-disjoint Jordan arcs between the corresponding vertices. In applications in clustering, cartography, and visualization, nearby vertices and edges are often bundled to the same point or overlapping arcs, due to data compression or low resolution. This raises the computational problem of deciding whether a given map $\\varphi:G\\rightarro","authors_text":"Csaba D. T\\'oth, Hugo A. Akitaya, Radoslav Fulek","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-26T18:21:59Z","title":"Recognizing Weak Embeddings of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09209","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:97a335fcb6235d0dcb122878ddc9e223e9b69ecf630f13cbf45d32e011d754e1","target":"record","created_at":"2026-05-17T23:39:58Z","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":"78572f03db2f3d6f8fadc93e79bb264edba7fe4860bbde1c5415865030dbaf96","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-26T18:21:59Z","title_canon_sha256":"43646afc68a8f43fb41ffdb6efb7910961faecc891c6dc7907b69d3acc92b534"},"schema_version":"1.0","source":{"id":"1709.09209","kind":"arxiv","version":2}},"canonical_sha256":"19a1aae5ec1eff779d7cf31ee9418af37e0c19879e9781f376871fc595723176","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19a1aae5ec1eff779d7cf31ee9418af37e0c19879e9781f376871fc595723176","first_computed_at":"2026-05-17T23:39:58.905003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:58.905003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s/+le45IsklK5j31+CT6hZAfWXvQIR4O4pEYNzYLHLIBk4m16gJ3WXu/LENQEIIT+onNKJd1I43reAWNnKRfCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:58.905594Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09209","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97a335fcb6235d0dcb122878ddc9e223e9b69ecf630f13cbf45d32e011d754e1","sha256:0d952962ed5f4608952beeec433935397fab2fe1c57ca8919da16af9dc4fd39a"],"state_sha256":"c9a625e9992d3bd97401ca38bdfde0904d14232ff81a612633518d6a507103a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wLJbPzLQ+pmLrr7Lbkk5wRUA8TTAw3Ov8oyAMcgueMLegGl9BoUJwGP2PSwOwOmrzJqVj2qWdOusKw1d5uIVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:09:23.038550Z","bundle_sha256":"07a0570f95ada1c320d0e0aaa7e91b18a87ceeb14b2eeb3c4d40b03c444990c6"}}