{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SQBSWSXFGQJGLIDWC5PUZBRJJR","short_pith_number":"pith:SQBSWSXF","canonical_record":{"source":{"id":"1702.01275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-04T11:51:44Z","cross_cats_sorted":[],"title_canon_sha256":"1d2613dd6ab43b50ef60f77c0a08b943378ad911c2aa899f3ae290d03c385f2b","abstract_canon_sha256":"e7185c813f0ecf354249f28b2c9daa2220ce3bd86cbc61cb712ecfda3f7a0a8c"},"schema_version":"1.0"},"canonical_sha256":"94032b4ae5341265a076175f4c86294c67d186f5d6bf433d4c95e34da168c7ae","source":{"kind":"arxiv","id":"1702.01275","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SQBSWSXFGQJGLIDWC5PUZBRJJR","target":"record","payload":{"canonical_record":{"source":{"id":"1702.01275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-04T11:51:44Z","cross_cats_sorted":[],"title_canon_sha256":"1d2613dd6ab43b50ef60f77c0a08b943378ad911c2aa899f3ae290d03c385f2b","abstract_canon_sha256":"e7185c813f0ecf354249f28b2c9daa2220ce3bd86cbc61cb712ecfda3f7a0a8c"},"schema_version":"1.0"},"canonical_sha256":"94032b4ae5341265a076175f4c86294c67d186f5d6bf433d4c95e34da168c7ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:20.973961Z","signature_b64":"I2+8Vdaw8c+Ulmy4U+uoqxh1fncNFQtfA8Qc6A6crfrtsNZSG4jtWQA5fJYcXx5JvhamV0LCmxoqblrNBkrgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94032b4ae5341265a076175f4c86294c67d186f5d6bf433d4c95e34da168c7ae","last_reissued_at":"2026-05-18T00:38:20.973476Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:20.973476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.01275","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:38:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BBZmcLynSyywZih8xERmX5vDk2RYfP3JB/Kjtp6UQs3jNrGKXDmYWMvhfoV9UtgXtFj+2Tij74J4P4ie4tIMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:03:17.845461Z"},"content_sha256":"0354caf49e866d7ac3035c995827ab48c978d6d8062f61b1bb762d16b579ccbd","schema_version":"1.0","event_id":"sha256:0354caf49e866d7ac3035c995827ab48c978d6d8062f61b1bb762d16b579ccbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SQBSWSXFGQJGLIDWC5PUZBRJJR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometric Biplane Graphs I: Maximal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alfredo Garc\\'ia, Csaba D. T\\'oth, Ferran Hurtado, In\\^es Matos, Javier Tejel, Maria Saumell, Matias Korman, Rodrigo I. Silveira","submitted_at":"2017-02-04T11:51:44Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01275","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:38:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGfjrX0BxqBr/whOey7rZhic/ZqZlYAPyMJ/6SiPV3mT90rIy4pKMU8qRkShvdLecCF+BQKB+m8IeXf+HboNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:03:17.846139Z"},"content_sha256":"2a88e24d8316087f985eb2382c6dbb055b6f56e7ef7805023539e41f437ca038","schema_version":"1.0","event_id":"sha256:2a88e24d8316087f985eb2382c6dbb055b6f56e7ef7805023539e41f437ca038"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQBSWSXFGQJGLIDWC5PUZBRJJR/bundle.json","state_url":"https://pith.science/pith/SQBSWSXFGQJGLIDWC5PUZBRJJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQBSWSXFGQJGLIDWC5PUZBRJJR/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-05-26T05:03:17Z","links":{"resolver":"https://pith.science/pith/SQBSWSXFGQJGLIDWC5PUZBRJJR","bundle":"https://pith.science/pith/SQBSWSXFGQJGLIDWC5PUZBRJJR/bundle.json","state":"https://pith.science/pith/SQBSWSXFGQJGLIDWC5PUZBRJJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQBSWSXFGQJGLIDWC5PUZBRJJR/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OMdp/pWO/WGOh0d3AhdzXUUEQIyCFbyc4GWKLeB5jWYOmXjex3wl6JP1Np7Q1cZIhGqF1QrooBxgL0WCFGRaAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:03:17.850029Z","bundle_sha256":"49ad6439e72d4396064685717df1e299763a58cacec56ba1a66fd76875e60170"}}