{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SQBSWSXFGQJGLIDWC5PUZBRJJR","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":"e7185c813f0ecf354249f28b2c9daa2220ce3bd86cbc61cb712ecfda3f7a0a8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-04T11:51:44Z","title_canon_sha256":"1d2613dd6ab43b50ef60f77c0a08b943378ad911c2aa899f3ae290d03c385f2b"},"schema_version":"1.0","source":{"id":"1702.01275","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01275","created_at":"2026-05-18T00:38:20Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01275v1","created_at":"2026-05-18T00:38:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01275","created_at":"2026-05-18T00:38:20Z"},{"alias_kind":"pith_short_12","alias_value":"SQBSWSXFGQJG","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SQBSWSXFGQJGLIDW","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SQBSWSXF","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:2a88e24d8316087f985eb2382c6dbb055b6f56e7ef7805023539e41f437ca038","target":"graph","created_at":"2026-05-18T00:38:20Z","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":"We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the sense that no edge can be added while staying biplane---may differ in the number of edges, and we provide an efficient algorithm for adding edges to a biplane graph to make it maximal. We also study extremal properties of maximal biplane graphs such as the maximum number of edges and the largest maximum connectivity over $n$-element point sets.","authors_text":"Alfredo Garc\\'ia, Csaba D. T\\'oth, Ferran Hurtado, In\\^es Matos, Javier Tejel, Maria Saumell, Matias Korman, Rodrigo I. Silveira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-04T11:51:44Z","title":"Geometric Biplane Graphs I: Maximal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01275","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:0354caf49e866d7ac3035c995827ab48c978d6d8062f61b1bb762d16b579ccbd","target":"record","created_at":"2026-05-18T00:38:20Z","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":"e7185c813f0ecf354249f28b2c9daa2220ce3bd86cbc61cb712ecfda3f7a0a8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-04T11:51:44Z","title_canon_sha256":"1d2613dd6ab43b50ef60f77c0a08b943378ad911c2aa899f3ae290d03c385f2b"},"schema_version":"1.0","source":{"id":"1702.01275","kind":"arxiv","version":1}},"canonical_sha256":"94032b4ae5341265a076175f4c86294c67d186f5d6bf433d4c95e34da168c7ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94032b4ae5341265a076175f4c86294c67d186f5d6bf433d4c95e34da168c7ae","first_computed_at":"2026-05-18T00:38:20.973476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:20.973476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I2+8Vdaw8c+Ulmy4U+uoqxh1fncNFQtfA8Qc6A6crfrtsNZSG4jtWQA5fJYcXx5JvhamV0LCmxoqblrNBkrgBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:20.973961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01275","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0354caf49e866d7ac3035c995827ab48c978d6d8062f61b1bb762d16b579ccbd","sha256:2a88e24d8316087f985eb2382c6dbb055b6f56e7ef7805023539e41f437ca038"],"state_sha256":"e93ed14931091cde01877142bc09ad7a9553e9beea0a7d030d1773be1e3fb0e8"}