{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:33K3FRWGX43L6C5Q5ML7OIV5RT","short_pith_number":"pith:33K3FRWG","canonical_record":{"source":{"id":"1510.02322","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-10-08T14:02:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"194b3014feefd5076e8bdfb9c9f9fc0d227e320e0e6120f82ee3d47ce748780c","abstract_canon_sha256":"1fd8076db8706f94e987bfb760f530316838e0d7c88f11c77bd251663de37a99"},"schema_version":"1.0"},"canonical_sha256":"ded5b2c6c6bf36bf0bb0eb17f722bd8ce9d70fe9f160fa3cea13319a39ac6b5a","source":{"kind":"arxiv","id":"1510.02322","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02322","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02322v2","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02322","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"33K3FRWGX43L","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"33K3FRWGX43L6C5Q","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"33K3FRWG","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:33K3FRWGX43L6C5Q5ML7OIV5RT","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02322","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-10-08T14:02:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"194b3014feefd5076e8bdfb9c9f9fc0d227e320e0e6120f82ee3d47ce748780c","abstract_canon_sha256":"1fd8076db8706f94e987bfb760f530316838e0d7c88f11c77bd251663de37a99"},"schema_version":"1.0"},"canonical_sha256":"ded5b2c6c6bf36bf0bb0eb17f722bd8ce9d70fe9f160fa3cea13319a39ac6b5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:33.803477Z","signature_b64":"6dVPyU3CWWUEDj8c55VnfK35PU+Xq3JepCHclkpfJHjwFH09DWbkDJNQQEiBhc5r5dGbvmQ0/WQqZEoHvORjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ded5b2c6c6bf36bf0bb0eb17f722bd8ce9d70fe9f160fa3cea13319a39ac6b5a","last_reissued_at":"2026-05-18T01:30:33.802773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:33.802773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02322","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:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74oxdP66GwfkoOi2fvq2zyQtQXBv0J7JGn3w1UWq0nzcRoIjzFlTZtDR4Sv5cQNkJmmkmy6Wf/ZAqREyLJB7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:33:09.138509Z"},"content_sha256":"64726f96ccfaee85f0189c18425397e67269414d36d27c9529f9070a38c080ab","schema_version":"1.0","event_id":"sha256:64726f96ccfaee85f0189c18425397e67269414d36d27c9529f9070a38c080ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:33K3FRWGX43L6C5Q5ML7OIV5RT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Small-Area Orthogonal Drawings of 3-Connected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Jens M. Schmidt, Therese Biedl","submitted_at":"2015-10-08T14:02:08Z","abstract_excerpt":"It is well-known that every graph with maximum degree 4 has an orthogonal drawing with area at most $\\frac{49}{64} n^2+O(n) \\approx 0.76n^2$. In this paper, we show that if the graph is 3-connected, then the area can be reduced even further to $\\frac{9}{16}n^2+O(n) \\approx 0.56n^2$. The drawing uses the 3-canonical order for (not necessarily planar) 3-connected graphs, which is a special Mondshein sequence and can hence be computed in linear time. To our knowledge, this is the first application of a Mondshein sequence in graph drawing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02322","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:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y8Qb8EKMWEEC1VmErCmdVYrQqSU0+33q1YZBv9lDpGXTkb6lYWvKs3jBvc+Xs4OZQM3o6Ic6EbUHZSaZ2YcpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:33:09.139437Z"},"content_sha256":"6261d81798d1fd1363d46af8d71fb6b8c7f31d815ad914c9d6bcb3e2c2504e18","schema_version":"1.0","event_id":"sha256:6261d81798d1fd1363d46af8d71fb6b8c7f31d815ad914c9d6bcb3e2c2504e18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33K3FRWGX43L6C5Q5ML7OIV5RT/bundle.json","state_url":"https://pith.science/pith/33K3FRWGX43L6C5Q5ML7OIV5RT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33K3FRWGX43L6C5Q5ML7OIV5RT/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-31T03:33:09Z","links":{"resolver":"https://pith.science/pith/33K3FRWGX43L6C5Q5ML7OIV5RT","bundle":"https://pith.science/pith/33K3FRWGX43L6C5Q5ML7OIV5RT/bundle.json","state":"https://pith.science/pith/33K3FRWGX43L6C5Q5ML7OIV5RT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33K3FRWGX43L6C5Q5ML7OIV5RT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:33K3FRWGX43L6C5Q5ML7OIV5RT","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":"1fd8076db8706f94e987bfb760f530316838e0d7c88f11c77bd251663de37a99","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-10-08T14:02:08Z","title_canon_sha256":"194b3014feefd5076e8bdfb9c9f9fc0d227e320e0e6120f82ee3d47ce748780c"},"schema_version":"1.0","source":{"id":"1510.02322","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02322","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02322v2","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02322","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"33K3FRWGX43L","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"33K3FRWGX43L6C5Q","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"33K3FRWG","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:6261d81798d1fd1363d46af8d71fb6b8c7f31d815ad914c9d6bcb3e2c2504e18","target":"graph","created_at":"2026-05-18T01:30:33Z","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":"It is well-known that every graph with maximum degree 4 has an orthogonal drawing with area at most $\\frac{49}{64} n^2+O(n) \\approx 0.76n^2$. In this paper, we show that if the graph is 3-connected, then the area can be reduced even further to $\\frac{9}{16}n^2+O(n) \\approx 0.56n^2$. The drawing uses the 3-canonical order for (not necessarily planar) 3-connected graphs, which is a special Mondshein sequence and can hence be computed in linear time. To our knowledge, this is the first application of a Mondshein sequence in graph drawing.","authors_text":"Jens M. Schmidt, Therese Biedl","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-10-08T14:02:08Z","title":"Small-Area Orthogonal Drawings of 3-Connected Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02322","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:64726f96ccfaee85f0189c18425397e67269414d36d27c9529f9070a38c080ab","target":"record","created_at":"2026-05-18T01:30:33Z","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":"1fd8076db8706f94e987bfb760f530316838e0d7c88f11c77bd251663de37a99","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-10-08T14:02:08Z","title_canon_sha256":"194b3014feefd5076e8bdfb9c9f9fc0d227e320e0e6120f82ee3d47ce748780c"},"schema_version":"1.0","source":{"id":"1510.02322","kind":"arxiv","version":2}},"canonical_sha256":"ded5b2c6c6bf36bf0bb0eb17f722bd8ce9d70fe9f160fa3cea13319a39ac6b5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ded5b2c6c6bf36bf0bb0eb17f722bd8ce9d70fe9f160fa3cea13319a39ac6b5a","first_computed_at":"2026-05-18T01:30:33.802773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:33.802773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6dVPyU3CWWUEDj8c55VnfK35PU+Xq3JepCHclkpfJHjwFH09DWbkDJNQQEiBhc5r5dGbvmQ0/WQqZEoHvORjAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:33.803477Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02322","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64726f96ccfaee85f0189c18425397e67269414d36d27c9529f9070a38c080ab","sha256:6261d81798d1fd1363d46af8d71fb6b8c7f31d815ad914c9d6bcb3e2c2504e18"],"state_sha256":"a669111d651583e17c85b88f608d3a41c82ef43d26c2ac6965c689aa047723b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l/QieFUErAguKI9IJNvte2JlztfdsQNy+NLgjYywA4TYZJBMqur+RM70+JGETICKtLHGWExq7uog9qE6707+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:33:09.142171Z","bundle_sha256":"6bec342bf131ed95e6c6b79792b79706f1cc645be5d574f60a9ace9b03da82d9"}}