{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PJ4H6EGVZEHCTTK3H246XY5H5H","short_pith_number":"pith:PJ4H6EGV","canonical_record":{"source":{"id":"1602.06778","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-22T13:58:39Z","cross_cats_sorted":["cs.DM","math.CO","math.GT"],"title_canon_sha256":"c4a97bc9479cb0addb99c4f3b7f38d149522928a0ea0641a6849c6883e9a60c1","abstract_canon_sha256":"b474fdb75bb67df0f9c7f5d8cde87a5cde59b0725cf31acee5d8634119b6a4da"},"schema_version":"1.0"},"canonical_sha256":"7a787f10d5c90e29cd5b3eb9ebe3a7e9df0d2bf529e03f358c55a7c29d521380","source":{"kind":"arxiv","id":"1602.06778","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06778","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06778v3","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06778","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"pith_short_12","alias_value":"PJ4H6EGVZEHC","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PJ4H6EGVZEHCTTK3","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PJ4H6EGV","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PJ4H6EGVZEHCTTK3H246XY5H5H","target":"record","payload":{"canonical_record":{"source":{"id":"1602.06778","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-22T13:58:39Z","cross_cats_sorted":["cs.DM","math.CO","math.GT"],"title_canon_sha256":"c4a97bc9479cb0addb99c4f3b7f38d149522928a0ea0641a6849c6883e9a60c1","abstract_canon_sha256":"b474fdb75bb67df0f9c7f5d8cde87a5cde59b0725cf31acee5d8634119b6a4da"},"schema_version":"1.0"},"canonical_sha256":"7a787f10d5c90e29cd5b3eb9ebe3a7e9df0d2bf529e03f358c55a7c29d521380","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:41.486863Z","signature_b64":"Nrx5E85KDo4wTEw6iMaTgd7RGKJsTANhDdhniGikHnfr7FFWIeBcvs4+T30B1xnS6vbMjAIlX913SgLEGZYvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a787f10d5c90e29cd5b3eb9ebe3a7e9df0d2bf529e03f358c55a7c29d521380","last_reissued_at":"2026-05-18T00:36:41.486184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:41.486184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.06778","source_version":3,"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-18T00:36:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XDPtkF4FdTcrMRt00nrZo3rKNkdvlpLtin2ePjisLvel5OVy9pAFAhydGJuz/oAOyBwpEwpC3iQx0U33Gap1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:11:55.618216Z"},"content_sha256":"2059aae5303b74da0fb64a7e987a2a8c3753ef6d992a6e21d9f1e1dbe7a251ca","schema_version":"1.0","event_id":"sha256:2059aae5303b74da0fb64a7e987a2a8c3753ef6d992a6e21d9f1e1dbe7a251ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PJ4H6EGVZEHCTTK3H246XY5H5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortest path embeddings of graphs on surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.GT"],"primary_cat":"cs.CG","authors_text":"Alfredo Hubard, Arnaud de Mesmay, Martin Tancer, Vojt\\v{e}ch Kalu\\v{z}a","submitted_at":"2016-02-22T13:58:39Z","abstract_excerpt":"The classical theorem of F\\'{a}ry states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment. We consider generalizations of F\\'{a}ry's theorem to surfaces equipped with Riemannian metrics. In this setting, we require that every edge is drawn as a shortest path between its two endpoints and we call an embedding with this property a shortest path embedding. The main question addressed in this paper is whether given a closed surface S, there exists a Riemannian metric for which every topologically embeddable graph admits a shor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06778","kind":"arxiv","version":3},"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-18T00:36:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nssWlRD0pW4xCB6rjCz4tFaob/4BkV5GEv55uieWwelI8nH3xsjXRwi/Zp1elQ8Z8+21tmCAwsz0jldQa4U2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:11:55.618583Z"},"content_sha256":"63e0f14030772dc369b667542b2d6ee3b9a40c0cd2a21490ce30691de34350e2","schema_version":"1.0","event_id":"sha256:63e0f14030772dc369b667542b2d6ee3b9a40c0cd2a21490ce30691de34350e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJ4H6EGVZEHCTTK3H246XY5H5H/bundle.json","state_url":"https://pith.science/pith/PJ4H6EGVZEHCTTK3H246XY5H5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJ4H6EGVZEHCTTK3H246XY5H5H/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-06-01T10:11:55Z","links":{"resolver":"https://pith.science/pith/PJ4H6EGVZEHCTTK3H246XY5H5H","bundle":"https://pith.science/pith/PJ4H6EGVZEHCTTK3H246XY5H5H/bundle.json","state":"https://pith.science/pith/PJ4H6EGVZEHCTTK3H246XY5H5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJ4H6EGVZEHCTTK3H246XY5H5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PJ4H6EGVZEHCTTK3H246XY5H5H","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":"b474fdb75bb67df0f9c7f5d8cde87a5cde59b0725cf31acee5d8634119b6a4da","cross_cats_sorted":["cs.DM","math.CO","math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-22T13:58:39Z","title_canon_sha256":"c4a97bc9479cb0addb99c4f3b7f38d149522928a0ea0641a6849c6883e9a60c1"},"schema_version":"1.0","source":{"id":"1602.06778","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06778","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06778v3","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06778","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"pith_short_12","alias_value":"PJ4H6EGVZEHC","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PJ4H6EGVZEHCTTK3","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PJ4H6EGV","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:63e0f14030772dc369b667542b2d6ee3b9a40c0cd2a21490ce30691de34350e2","target":"graph","created_at":"2026-05-18T00:36:41Z","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":"The classical theorem of F\\'{a}ry states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment. We consider generalizations of F\\'{a}ry's theorem to surfaces equipped with Riemannian metrics. In this setting, we require that every edge is drawn as a shortest path between its two endpoints and we call an embedding with this property a shortest path embedding. The main question addressed in this paper is whether given a closed surface S, there exists a Riemannian metric for which every topologically embeddable graph admits a shor","authors_text":"Alfredo Hubard, Arnaud de Mesmay, Martin Tancer, Vojt\\v{e}ch Kalu\\v{z}a","cross_cats":["cs.DM","math.CO","math.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-22T13:58:39Z","title":"Shortest path embeddings of graphs on surfaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06778","kind":"arxiv","version":3},"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:2059aae5303b74da0fb64a7e987a2a8c3753ef6d992a6e21d9f1e1dbe7a251ca","target":"record","created_at":"2026-05-18T00:36:41Z","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":"b474fdb75bb67df0f9c7f5d8cde87a5cde59b0725cf31acee5d8634119b6a4da","cross_cats_sorted":["cs.DM","math.CO","math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-22T13:58:39Z","title_canon_sha256":"c4a97bc9479cb0addb99c4f3b7f38d149522928a0ea0641a6849c6883e9a60c1"},"schema_version":"1.0","source":{"id":"1602.06778","kind":"arxiv","version":3}},"canonical_sha256":"7a787f10d5c90e29cd5b3eb9ebe3a7e9df0d2bf529e03f358c55a7c29d521380","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a787f10d5c90e29cd5b3eb9ebe3a7e9df0d2bf529e03f358c55a7c29d521380","first_computed_at":"2026-05-18T00:36:41.486184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:41.486184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nrx5E85KDo4wTEw6iMaTgd7RGKJsTANhDdhniGikHnfr7FFWIeBcvs4+T30B1xnS6vbMjAIlX913SgLEGZYvBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:41.486863Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06778","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2059aae5303b74da0fb64a7e987a2a8c3753ef6d992a6e21d9f1e1dbe7a251ca","sha256:63e0f14030772dc369b667542b2d6ee3b9a40c0cd2a21490ce30691de34350e2"],"state_sha256":"d00fe2ee9243cf8a5433e3a1279e18f88f53149e1aec645ea243c9f85278d781"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rctCsKUpDF2IGV9ib9RYGi2wMBwHber+N4mu9iUtDWuRomoM/+DmkwuV7vKswShfFR9MFmtGhrIc2VXPEEBADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:11:55.620687Z","bundle_sha256":"54456f6c994f26acc2323070541288bbe20e53479193b80a44ed8b0cac92e9ac"}}