{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:P4ITCXS7TSSRIKVLFHOIBTOF7R","short_pith_number":"pith:P4ITCXS7","canonical_record":{"source":{"id":"1409.0461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-01T16:01:42Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"40f25bf2675c5cf26044a47b3ed95f78e5a1698db77e34712382167bd3950711","abstract_canon_sha256":"462dd539f5a2142abfb947a00444334c5607877d57b00c3692456c7ba8e12def"},"schema_version":"1.0"},"canonical_sha256":"7f11315e5f9ca5142aab29dc80cdc5fc417ae990e44b2778b06ceb13e475a6ea","source":{"kind":"arxiv","id":"1409.0461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0461","created_at":"2026-05-18T02:43:52Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0461v1","created_at":"2026-05-18T02:43:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0461","created_at":"2026-05-18T02:43:52Z"},{"alias_kind":"pith_short_12","alias_value":"P4ITCXS7TSSR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P4ITCXS7TSSRIKVL","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P4ITCXS7","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:P4ITCXS7TSSRIKVLFHOIBTOF7R","target":"record","payload":{"canonical_record":{"source":{"id":"1409.0461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-01T16:01:42Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"40f25bf2675c5cf26044a47b3ed95f78e5a1698db77e34712382167bd3950711","abstract_canon_sha256":"462dd539f5a2142abfb947a00444334c5607877d57b00c3692456c7ba8e12def"},"schema_version":"1.0"},"canonical_sha256":"7f11315e5f9ca5142aab29dc80cdc5fc417ae990e44b2778b06ceb13e475a6ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:52.722364Z","signature_b64":"IZIHuzRsw5R306vlTes7wxqjyOZ3pV6SqKl5JOU1tJMgnIgLo+WcmSea1JnRsh6zOoFKGICQ1698GD4pGJtnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f11315e5f9ca5142aab29dc80cdc5fc417ae990e44b2778b06ceb13e475a6ea","last_reissued_at":"2026-05-18T02:43:52.721951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:52.721951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.0461","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-18T02:43:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+3LkHYXAynpnE1PP5YrofBzNPMux2awYH36eXYoNXG7o6rc7xfwOOdBL3H7E2zHRjx/K893a7uea4r1Uv8LAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:50:57.601599Z"},"content_sha256":"ba8bd399d1b7747860f434bbbaa7a6d7b3f0694bff32c696c706a61b5f23e34f","schema_version":"1.0","event_id":"sha256:ba8bd399d1b7747860f434bbbaa7a6d7b3f0694bff32c696c706a61b5f23e34f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:P4ITCXS7TSSRIKVLFHOIBTOF7R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Luca Grilli, Michael A. Bekos, Michael Kaufmann, Sabine Cornelsen, Seok-Hee Hong","submitted_at":"2014-09-01T16:01:42Z","abstract_excerpt":"Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed more than once, is crossed by a bundle of two or more edges incident to a common vertex. A graph is outer-fan-planar if it has a fan-planar embedding in which every vertex is on the outer face. If, in addition, the insertion of an edge destroys its outer-fan-planarity, then it is maximal outer-fan-planar. In this paper, we present a polynomial-time algorithm to test whether a given graph is maximal outer-fan-planar. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0461","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-18T02:43:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2W55jL3KJsFnrc4tzYZnUF2AbU5VtGpBM9QOpksXIgIQjQWBGPqlx9epElGsKfGT5mtlnVLOdyfg30sBYV4eCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:50:57.601939Z"},"content_sha256":"060975e79e4e23089535bd8471a2bec89aeae2a31ea4eaca72cff402a6cb63ac","schema_version":"1.0","event_id":"sha256:060975e79e4e23089535bd8471a2bec89aeae2a31ea4eaca72cff402a6cb63ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P4ITCXS7TSSRIKVLFHOIBTOF7R/bundle.json","state_url":"https://pith.science/pith/P4ITCXS7TSSRIKVLFHOIBTOF7R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P4ITCXS7TSSRIKVLFHOIBTOF7R/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-28T00:50:57Z","links":{"resolver":"https://pith.science/pith/P4ITCXS7TSSRIKVLFHOIBTOF7R","bundle":"https://pith.science/pith/P4ITCXS7TSSRIKVLFHOIBTOF7R/bundle.json","state":"https://pith.science/pith/P4ITCXS7TSSRIKVLFHOIBTOF7R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P4ITCXS7TSSRIKVLFHOIBTOF7R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:P4ITCXS7TSSRIKVLFHOIBTOF7R","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":"462dd539f5a2142abfb947a00444334c5607877d57b00c3692456c7ba8e12def","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-01T16:01:42Z","title_canon_sha256":"40f25bf2675c5cf26044a47b3ed95f78e5a1698db77e34712382167bd3950711"},"schema_version":"1.0","source":{"id":"1409.0461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0461","created_at":"2026-05-18T02:43:52Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0461v1","created_at":"2026-05-18T02:43:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0461","created_at":"2026-05-18T02:43:52Z"},{"alias_kind":"pith_short_12","alias_value":"P4ITCXS7TSSR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P4ITCXS7TSSRIKVL","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P4ITCXS7","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:060975e79e4e23089535bd8471a2bec89aeae2a31ea4eaca72cff402a6cb63ac","target":"graph","created_at":"2026-05-18T02:43:52Z","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":"Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed more than once, is crossed by a bundle of two or more edges incident to a common vertex. A graph is outer-fan-planar if it has a fan-planar embedding in which every vertex is on the outer face. If, in addition, the insertion of an edge destroys its outer-fan-planarity, then it is maximal outer-fan-planar. In this paper, we present a polynomial-time algorithm to test whether a given graph is maximal outer-fan-planar. The","authors_text":"Luca Grilli, Michael A. Bekos, Michael Kaufmann, Sabine Cornelsen, Seok-Hee Hong","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-01T16:01:42Z","title":"On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0461","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:ba8bd399d1b7747860f434bbbaa7a6d7b3f0694bff32c696c706a61b5f23e34f","target":"record","created_at":"2026-05-18T02:43:52Z","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":"462dd539f5a2142abfb947a00444334c5607877d57b00c3692456c7ba8e12def","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-01T16:01:42Z","title_canon_sha256":"40f25bf2675c5cf26044a47b3ed95f78e5a1698db77e34712382167bd3950711"},"schema_version":"1.0","source":{"id":"1409.0461","kind":"arxiv","version":1}},"canonical_sha256":"7f11315e5f9ca5142aab29dc80cdc5fc417ae990e44b2778b06ceb13e475a6ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f11315e5f9ca5142aab29dc80cdc5fc417ae990e44b2778b06ceb13e475a6ea","first_computed_at":"2026-05-18T02:43:52.721951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:52.721951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IZIHuzRsw5R306vlTes7wxqjyOZ3pV6SqKl5JOU1tJMgnIgLo+WcmSea1JnRsh6zOoFKGICQ1698GD4pGJtnCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:52.722364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.0461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba8bd399d1b7747860f434bbbaa7a6d7b3f0694bff32c696c706a61b5f23e34f","sha256:060975e79e4e23089535bd8471a2bec89aeae2a31ea4eaca72cff402a6cb63ac"],"state_sha256":"90feb4bbdc0158e5ddd15dc25e571111dee85d045a6e99f9e04672db6b0398d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xn6Ic9Y/nyLpbs1pQIaZaje4YZQJbq4GpEu6Eoh7aY3S2XYrN/IciTUiaCu7hymPsEXQVEpPDNAn3S/76UQ2DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:50:57.603804Z","bundle_sha256":"6eb8211e69a5c93ec32aa3046a9e2a8bfbb015319674eea83e938f7b7888dfa3"}}