{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7I3RXJ44A6CIMBBHWAKQQAGOSV","short_pith_number":"pith:7I3RXJ44","schema_version":"1.0","canonical_sha256":"fa371ba79c0784860427b0150800ce95573b0b2b182e104392c2e1be3a6f5800","source":{"kind":"arxiv","id":"1602.06407","version":2},"attestation_state":"computed","paper":{"title":"A Reduction System for Optimal 1-Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Franz J. Brandenburg","submitted_at":"2016-02-20T13:38:28Z","abstract_excerpt":"There is a graph reduction system so that every optimal 1-planar graph can be reduced to an irreducible extended wheel graph, provided the reductions are applied such that the given graph class is preserved. A graph is optimal 1-planar if it can be drawn in the plane with at most one crossing per edge and is optimal if it has the maximum of 4n-8 edges.\n  We show that the reduction system is context-sensitive so that the preservation of the graph class can be granted by local conditions which can be tested in constant time. Every optimal 1-planar graph G can be reduced to every extended wheel g"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1602.06407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-20T13:38:28Z","cross_cats_sorted":[],"title_canon_sha256":"745f805595dfaffdb85e96b58199d73685e805924c936dfe910ba49a39829a8e","abstract_canon_sha256":"5b2b30e69f8a54f6ce4bbc63e75c4e5d0fdc52626ad8a9ff99b2d732dc747eb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:08.634248Z","signature_b64":"GMBNKIY0/MvjD7y900ASDrSwOtinDoQbnBCr5iGw29mVH00BnuATJIDzSyDgcVqCCeoRiLik8Xh7dpQY0mlWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa371ba79c0784860427b0150800ce95573b0b2b182e104392c2e1be3a6f5800","last_reissued_at":"2026-05-18T01:01:08.633754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:08.633754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Reduction System for Optimal 1-Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Franz J. Brandenburg","submitted_at":"2016-02-20T13:38:28Z","abstract_excerpt":"There is a graph reduction system so that every optimal 1-planar graph can be reduced to an irreducible extended wheel graph, provided the reductions are applied such that the given graph class is preserved. A graph is optimal 1-planar if it can be drawn in the plane with at most one crossing per edge and is optimal if it has the maximum of 4n-8 edges.\n  We show that the reduction system is context-sensitive so that the preservation of the graph class can be granted by local conditions which can be tested in constant time. Every optimal 1-planar graph G can be reduced to every extended wheel g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06407","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.06407","created_at":"2026-05-18T01:01:08.633826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.06407v2","created_at":"2026-05-18T01:01:08.633826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06407","created_at":"2026-05-18T01:01:08.633826+00:00"},{"alias_kind":"pith_short_12","alias_value":"7I3RXJ44A6CI","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7I3RXJ44A6CIMBBH","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7I3RXJ44","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV","json":"https://pith.science/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV.json","graph_json":"https://pith.science/api/pith-number/7I3RXJ44A6CIMBBHWAKQQAGOSV/graph.json","events_json":"https://pith.science/api/pith-number/7I3RXJ44A6CIMBBHWAKQQAGOSV/events.json","paper":"https://pith.science/paper/7I3RXJ44"},"agent_actions":{"view_html":"https://pith.science/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV","download_json":"https://pith.science/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV.json","view_paper":"https://pith.science/paper/7I3RXJ44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.06407&json=true","fetch_graph":"https://pith.science/api/pith-number/7I3RXJ44A6CIMBBHWAKQQAGOSV/graph.json","fetch_events":"https://pith.science/api/pith-number/7I3RXJ44A6CIMBBHWAKQQAGOSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV/action/storage_attestation","attest_author":"https://pith.science/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV/action/author_attestation","sign_citation":"https://pith.science/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV/action/citation_signature","submit_replication":"https://pith.science/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV/action/replication_record"}},"created_at":"2026-05-18T01:01:08.633826+00:00","updated_at":"2026-05-18T01:01:08.633826+00:00"}