{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7I3RXJ44A6CIMBBHWAKQQAGOSV","short_pith_number":"pith:7I3RXJ44","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"},"canonical_sha256":"fa371ba79c0784860427b0150800ce95573b0b2b182e104392c2e1be3a6f5800","source":{"kind":"arxiv","id":"1602.06407","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06407","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06407v2","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06407","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"pith_short_12","alias_value":"7I3RXJ44A6CI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7I3RXJ44A6CIMBBH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7I3RXJ44","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7I3RXJ44A6CIMBBHWAKQQAGOSV","target":"record","payload":{"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"},"canonical_sha256":"fa371ba79c0784860427b0150800ce95573b0b2b182e104392c2e1be3a6f5800","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"},"source_kind":"arxiv","source_id":"1602.06407","source_version":2,"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-18T01:01:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F5DY6jyqLBon6pzKjWJzegJN8yZNFyUoYKZxrDxJw0OSifv0lCu8R67wdeojMGcpEDWoFm4s2X2uGp25yeR9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:32:03.743786Z"},"content_sha256":"1b5dd6541f8ef27452d1e362ecf7709661bc202a4329a3b786112a374b31d8e8","schema_version":"1.0","event_id":"sha256:1b5dd6541f8ef27452d1e362ecf7709661bc202a4329a3b786112a374b31d8e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7I3RXJ44A6CIMBBHWAKQQAGOSV","target":"graph","payload":{"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"},"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-18T01:01:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMVC91oWdWQhVecLLgEe64sqqilTBHZbG0jMXVwkL0W2dN+o/0UXFxCQeDdvkUPz/WbiGYo6SP+97D7sNj21Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:32:03.744133Z"},"content_sha256":"dc7096b67b8810e0d220951e01cfede4ff5fa5b6f31c24933ae46280fc9034c5","schema_version":"1.0","event_id":"sha256:dc7096b67b8810e0d220951e01cfede4ff5fa5b6f31c24933ae46280fc9034c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV/bundle.json","state_url":"https://pith.science/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV/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-04T01:32:03Z","links":{"resolver":"https://pith.science/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV","bundle":"https://pith.science/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV/bundle.json","state":"https://pith.science/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7I3RXJ44A6CIMBBHWAKQQAGOSV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7I3RXJ44A6CIMBBHWAKQQAGOSV","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":"5b2b30e69f8a54f6ce4bbc63e75c4e5d0fdc52626ad8a9ff99b2d732dc747eb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-20T13:38:28Z","title_canon_sha256":"745f805595dfaffdb85e96b58199d73685e805924c936dfe910ba49a39829a8e"},"schema_version":"1.0","source":{"id":"1602.06407","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06407","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06407v2","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06407","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"pith_short_12","alias_value":"7I3RXJ44A6CI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7I3RXJ44A6CIMBBH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7I3RXJ44","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:dc7096b67b8810e0d220951e01cfede4ff5fa5b6f31c24933ae46280fc9034c5","target":"graph","created_at":"2026-05-18T01:01:08Z","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":"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","authors_text":"Franz J. Brandenburg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-20T13:38:28Z","title":"A Reduction System for Optimal 1-Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06407","kind":"arxiv","version":2},"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:1b5dd6541f8ef27452d1e362ecf7709661bc202a4329a3b786112a374b31d8e8","target":"record","created_at":"2026-05-18T01:01:08Z","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":"5b2b30e69f8a54f6ce4bbc63e75c4e5d0fdc52626ad8a9ff99b2d732dc747eb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-20T13:38:28Z","title_canon_sha256":"745f805595dfaffdb85e96b58199d73685e805924c936dfe910ba49a39829a8e"},"schema_version":"1.0","source":{"id":"1602.06407","kind":"arxiv","version":2}},"canonical_sha256":"fa371ba79c0784860427b0150800ce95573b0b2b182e104392c2e1be3a6f5800","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa371ba79c0784860427b0150800ce95573b0b2b182e104392c2e1be3a6f5800","first_computed_at":"2026-05-18T01:01:08.633754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:08.633754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GMBNKIY0/MvjD7y900ASDrSwOtinDoQbnBCr5iGw29mVH00BnuATJIDzSyDgcVqCCeoRiLik8Xh7dpQY0mlWDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:08.634248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06407","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b5dd6541f8ef27452d1e362ecf7709661bc202a4329a3b786112a374b31d8e8","sha256:dc7096b67b8810e0d220951e01cfede4ff5fa5b6f31c24933ae46280fc9034c5"],"state_sha256":"2e8ddcdd67cec7cad21ae3ca3e910d7adfab037f1d235945e4abf1db1be4db30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VGHEPWieGZOxU2EJVZGfudg1+Cscy7pHnYYsXI4NXTP43YxFd+5uWT4AOI7YQYPzWabcqjZV8hy5YjA8164eBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:32:03.746796Z","bundle_sha256":"e09ce31f925bd26ebbf3be2a11707a1919be356dc58ff63f0d7ddb4317c1d30a"}}