{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OSWNXJKRTCMDCPNGWBLE6B3CDL","short_pith_number":"pith:OSWNXJKR","canonical_record":{"source":{"id":"1602.08022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-25T18:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"41afdb4bfe0b84a0b2819aeedccb8604f5f2055671a1da9af4d8e4796285ce4b","abstract_canon_sha256":"10cc6068a6e6c0d1d53e39666fdbecacd633e0fb7b44cdd601fbb3f8e4b1505e"},"schema_version":"1.0"},"canonical_sha256":"74acdba5519898313da6b0564f07621ad4e2809531ac7c7f3a3f83de79396310","source":{"kind":"arxiv","id":"1602.08022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08022","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08022v1","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08022","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"pith_short_12","alias_value":"OSWNXJKRTCMD","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OSWNXJKRTCMDCPNG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OSWNXJKR","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OSWNXJKRTCMDCPNGWBLE6B3CDL","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-25T18:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"41afdb4bfe0b84a0b2819aeedccb8604f5f2055671a1da9af4d8e4796285ce4b","abstract_canon_sha256":"10cc6068a6e6c0d1d53e39666fdbecacd633e0fb7b44cdd601fbb3f8e4b1505e"},"schema_version":"1.0"},"canonical_sha256":"74acdba5519898313da6b0564f07621ad4e2809531ac7c7f3a3f83de79396310","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:12.038982Z","signature_b64":"phdhmfm6GalS6a0Tt79/5j9wgZzXTc4i5hdvyGB8RuzhizeWkd28W0qwD/hq4LQPqH8SfV/yzFsfbXdj1BWcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74acdba5519898313da6b0564f07621ad4e2809531ac7c7f3a3f83de79396310","last_reissued_at":"2026-05-18T00:25:12.038567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:12.038567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08022","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:25:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t+22kpspCRw2jsZoo5JPVFmNXOM/sD/XIRG8eKln5QlYByvC7VlfTD+ZA15Hp3A5s5pI4ljL45wJO9jCJ1PLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:16:36.130461Z"},"content_sha256":"a35886f4d78eba6c12a1b28faa5c3144c6156c2d87f8e29d1f02402abbfb299c","schema_version":"1.0","event_id":"sha256:a35886f4d78eba6c12a1b28faa5c3144c6156c2d87f8e29d1f02402abbfb299c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OSWNXJKRTCMDCPNGWBLE6B3CDL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recognizing Optimal 1-Planar Graphs in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Franz J. Brandenburg","submitted_at":"2016-02-25T18:16:01Z","abstract_excerpt":"A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of 4n-8 edges.\n  We show that optimal 1-planar graphs can be recognized in linear time. Our algorithm implements a graph reduction system with two rules, which can be used to reduce every optimal 1-planar graph to an irreducible extended wheel graph. The graph reduction system is non-deterministic, constraint, and non-confluent."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08022","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:25:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sxYEChgVs/znJq5nLvmSqaFpEU5UA1gCfvz63Pa9b/gDfoCUC0t0+L1Uj3i96N0AIVvFTvc4VSG2GlPSOPMbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:16:36.131095Z"},"content_sha256":"84f803dfd69271af1c1439c7d02cdc9348cb06571123e2c7aec2dfdb6cffbd1d","schema_version":"1.0","event_id":"sha256:84f803dfd69271af1c1439c7d02cdc9348cb06571123e2c7aec2dfdb6cffbd1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OSWNXJKRTCMDCPNGWBLE6B3CDL/bundle.json","state_url":"https://pith.science/pith/OSWNXJKRTCMDCPNGWBLE6B3CDL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OSWNXJKRTCMDCPNGWBLE6B3CDL/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-04T06:16:36Z","links":{"resolver":"https://pith.science/pith/OSWNXJKRTCMDCPNGWBLE6B3CDL","bundle":"https://pith.science/pith/OSWNXJKRTCMDCPNGWBLE6B3CDL/bundle.json","state":"https://pith.science/pith/OSWNXJKRTCMDCPNGWBLE6B3CDL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OSWNXJKRTCMDCPNGWBLE6B3CDL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OSWNXJKRTCMDCPNGWBLE6B3CDL","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":"10cc6068a6e6c0d1d53e39666fdbecacd633e0fb7b44cdd601fbb3f8e4b1505e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-25T18:16:01Z","title_canon_sha256":"41afdb4bfe0b84a0b2819aeedccb8604f5f2055671a1da9af4d8e4796285ce4b"},"schema_version":"1.0","source":{"id":"1602.08022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08022","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08022v1","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08022","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"pith_short_12","alias_value":"OSWNXJKRTCMD","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OSWNXJKRTCMDCPNG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OSWNXJKR","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:84f803dfd69271af1c1439c7d02cdc9348cb06571123e2c7aec2dfdb6cffbd1d","target":"graph","created_at":"2026-05-18T00:25:12Z","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":"A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of 4n-8 edges.\n  We show that optimal 1-planar graphs can be recognized in linear time. Our algorithm implements a graph reduction system with two rules, which can be used to reduce every optimal 1-planar graph to an irreducible extended wheel graph. The graph reduction system is non-deterministic, constraint, and non-confluent.","authors_text":"Franz J. Brandenburg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-25T18:16:01Z","title":"Recognizing Optimal 1-Planar Graphs in Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08022","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:a35886f4d78eba6c12a1b28faa5c3144c6156c2d87f8e29d1f02402abbfb299c","target":"record","created_at":"2026-05-18T00:25:12Z","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":"10cc6068a6e6c0d1d53e39666fdbecacd633e0fb7b44cdd601fbb3f8e4b1505e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-25T18:16:01Z","title_canon_sha256":"41afdb4bfe0b84a0b2819aeedccb8604f5f2055671a1da9af4d8e4796285ce4b"},"schema_version":"1.0","source":{"id":"1602.08022","kind":"arxiv","version":1}},"canonical_sha256":"74acdba5519898313da6b0564f07621ad4e2809531ac7c7f3a3f83de79396310","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74acdba5519898313da6b0564f07621ad4e2809531ac7c7f3a3f83de79396310","first_computed_at":"2026-05-18T00:25:12.038567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:12.038567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"phdhmfm6GalS6a0Tt79/5j9wgZzXTc4i5hdvyGB8RuzhizeWkd28W0qwD/hq4LQPqH8SfV/yzFsfbXdj1BWcBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:12.038982Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a35886f4d78eba6c12a1b28faa5c3144c6156c2d87f8e29d1f02402abbfb299c","sha256:84f803dfd69271af1c1439c7d02cdc9348cb06571123e2c7aec2dfdb6cffbd1d"],"state_sha256":"0bf52cc2fe5327720a28f8aeac1175ccf66fccd3eafe972c85cad8ee2c3ccc47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7D+K/y5r5voEGcCdvu/iaB++eYf/strs+o6C9A7oN5QEHF3sKl7xhAFFYBnH3vlxfGVGI7vAVLz45/ZihVRADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:16:36.134194Z","bundle_sha256":"5649705836ef6682b9524abe3f2796b77653ed2319bdd2acbd4037eb48af50f6"}}