{"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"}