{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PBBCVXVR5HP7K4FPW566JFJZ37","short_pith_number":"pith:PBBCVXVR","canonical_record":{"source":{"id":"1803.07032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-19T16:48:50Z","cross_cats_sorted":[],"title_canon_sha256":"1280f85d7256cc4c311f768dadc0e523a2a01c138884c153e96fdda71d3f0a60","abstract_canon_sha256":"456ed90ecd4b78fe3410a3a13f4cb573ec05e945a0053cfb0399be66e55f149b"},"schema_version":"1.0"},"canonical_sha256":"78422adeb1e9dff570afb77de49539dffcfcb3d43e93b5f76e613d5582a7b5d7","source":{"kind":"arxiv","id":"1803.07032","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07032","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07032v1","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07032","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"PBBCVXVR5HP7","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PBBCVXVR5HP7K4FP","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PBBCVXVR","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PBBCVXVR5HP7K4FPW566JFJZ37","target":"record","payload":{"canonical_record":{"source":{"id":"1803.07032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-19T16:48:50Z","cross_cats_sorted":[],"title_canon_sha256":"1280f85d7256cc4c311f768dadc0e523a2a01c138884c153e96fdda71d3f0a60","abstract_canon_sha256":"456ed90ecd4b78fe3410a3a13f4cb573ec05e945a0053cfb0399be66e55f149b"},"schema_version":"1.0"},"canonical_sha256":"78422adeb1e9dff570afb77de49539dffcfcb3d43e93b5f76e613d5582a7b5d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:40.512019Z","signature_b64":"cKMGGSrVsdMz5bhcn0BxDXNH64FywNXz4FRPiPSUXEgK5sbLA3A2aWwsBBacFOyBsQn5wzCnSaxLMMbfZGijDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78422adeb1e9dff570afb77de49539dffcfcb3d43e93b5f76e613d5582a7b5d7","last_reissued_at":"2026-05-18T00:20:40.511282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:40.511282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.07032","source_version":1,"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:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rtsPUtxYGf4ybjIU5OqPTe0oEOk+NfrT4difESUC5bkJM0ag6NK45GvYY+c/wSMQ0e8BO9QvNWiN1pNySIx+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:54:08.031009Z"},"content_sha256":"a6854d8a246c6de5c3bb0d9b9c563a8acff7524617b7544a074d11d097a3f7b1","schema_version":"1.0","event_id":"sha256:a6854d8a246c6de5c3bb0d9b9c563a8acff7524617b7544a074d11d097a3f7b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PBBCVXVR5HP7K4FPW566JFJZ37","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Embedding graphs into two-dimensional simplicial complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bojan Mohar, \\'Eric Colin de Verdi\\`ere, Thomas Magnard","submitted_at":"2018-03-19T16:48:50Z","abstract_excerpt":"We consider the problem of deciding whether an input graph G admits a topological embedding into a two-dimensional simplicial complex C. This problem includes, among others, the embeddability problem of a graph on a surface and the topological crossing number of a graph, but is more general.\n  The problem is NP-complete when C is part of the input, and we give a polynomial-time algorithm if the complex C is fixed.\n  Our strategy is to reduce the problem to an embedding extension problem on a surface, which has the following form: Given a subgraph H' of a graph G', and an embedding of H' on a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07032","kind":"arxiv","version":1},"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:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3KztR3QRIGLckZMt5VP+6+PT/VBs1NF+zEuT8JE73GxVkaHR0TDp1p3reu77QTVozUrLwnRbeKfuQ+R9IjQkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:54:08.031378Z"},"content_sha256":"d7b30c23576b36beb61328160ddefd3d7187a8101d592fdcab5bdd9c9a5f49cf","schema_version":"1.0","event_id":"sha256:d7b30c23576b36beb61328160ddefd3d7187a8101d592fdcab5bdd9c9a5f49cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PBBCVXVR5HP7K4FPW566JFJZ37/bundle.json","state_url":"https://pith.science/pith/PBBCVXVR5HP7K4FPW566JFJZ37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PBBCVXVR5HP7K4FPW566JFJZ37/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-20T02:54:08Z","links":{"resolver":"https://pith.science/pith/PBBCVXVR5HP7K4FPW566JFJZ37","bundle":"https://pith.science/pith/PBBCVXVR5HP7K4FPW566JFJZ37/bundle.json","state":"https://pith.science/pith/PBBCVXVR5HP7K4FPW566JFJZ37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PBBCVXVR5HP7K4FPW566JFJZ37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PBBCVXVR5HP7K4FPW566JFJZ37","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":"456ed90ecd4b78fe3410a3a13f4cb573ec05e945a0053cfb0399be66e55f149b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-19T16:48:50Z","title_canon_sha256":"1280f85d7256cc4c311f768dadc0e523a2a01c138884c153e96fdda71d3f0a60"},"schema_version":"1.0","source":{"id":"1803.07032","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07032","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07032v1","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07032","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"PBBCVXVR5HP7","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PBBCVXVR5HP7K4FP","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PBBCVXVR","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:d7b30c23576b36beb61328160ddefd3d7187a8101d592fdcab5bdd9c9a5f49cf","target":"graph","created_at":"2026-05-18T00:20:40Z","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 consider the problem of deciding whether an input graph G admits a topological embedding into a two-dimensional simplicial complex C. This problem includes, among others, the embeddability problem of a graph on a surface and the topological crossing number of a graph, but is more general.\n  The problem is NP-complete when C is part of the input, and we give a polynomial-time algorithm if the complex C is fixed.\n  Our strategy is to reduce the problem to an embedding extension problem on a surface, which has the following form: Given a subgraph H' of a graph G', and an embedding of H' on a s","authors_text":"Bojan Mohar, \\'Eric Colin de Verdi\\`ere, Thomas Magnard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-19T16:48:50Z","title":"Embedding graphs into two-dimensional simplicial complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07032","kind":"arxiv","version":1},"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:a6854d8a246c6de5c3bb0d9b9c563a8acff7524617b7544a074d11d097a3f7b1","target":"record","created_at":"2026-05-18T00:20:40Z","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":"456ed90ecd4b78fe3410a3a13f4cb573ec05e945a0053cfb0399be66e55f149b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-19T16:48:50Z","title_canon_sha256":"1280f85d7256cc4c311f768dadc0e523a2a01c138884c153e96fdda71d3f0a60"},"schema_version":"1.0","source":{"id":"1803.07032","kind":"arxiv","version":1}},"canonical_sha256":"78422adeb1e9dff570afb77de49539dffcfcb3d43e93b5f76e613d5582a7b5d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78422adeb1e9dff570afb77de49539dffcfcb3d43e93b5f76e613d5582a7b5d7","first_computed_at":"2026-05-18T00:20:40.511282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:40.511282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cKMGGSrVsdMz5bhcn0BxDXNH64FywNXz4FRPiPSUXEgK5sbLA3A2aWwsBBacFOyBsQn5wzCnSaxLMMbfZGijDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:40.512019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.07032","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6854d8a246c6de5c3bb0d9b9c563a8acff7524617b7544a074d11d097a3f7b1","sha256:d7b30c23576b36beb61328160ddefd3d7187a8101d592fdcab5bdd9c9a5f49cf"],"state_sha256":"196f63979bcd6cff502fd568839583ac898a47a1b5e89549f16edb1f76daa20c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xUzuxR1pdX7YebZVrFO5Q1QJcAWz2YjNbKRu2KyM2Pwkslfouxwp7UwZ9i2aMONq9nvq/GlXIUsHU3Z5YRieBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T02:54:08.033569Z","bundle_sha256":"7f231c046555597f1b2f6263037ec4daeaf9380da3f34d6521ea1f00e9243356"}}