{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:BTVF2Q2SR3JSQRLSTRU7BOQT6X","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":"e2d8ae061b07801d9bfdb5183be38e88ceef5d21dfe5c88bb52fb191030cd077","cross_cats_sorted":["math.AC"],"license":"","primary_cat":"math.CO","submitted_at":"2003-11-04T16:16:11Z","title_canon_sha256":"95bfda6210e0a56cfcb2194a3bb507a7bbe93816f791770c92b3fa56085adaef"},"schema_version":"1.0","source":{"id":"math/0311037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0311037","created_at":"2026-07-04T14:37:57Z"},{"alias_kind":"arxiv_version","alias_value":"math/0311037v1","created_at":"2026-07-04T14:37:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0311037","created_at":"2026-07-04T14:37:57Z"},{"alias_kind":"pith_short_12","alias_value":"BTVF2Q2SR3JS","created_at":"2026-07-04T14:37:57Z"},{"alias_kind":"pith_short_16","alias_value":"BTVF2Q2SR3JSQRLS","created_at":"2026-07-04T14:37:57Z"},{"alias_kind":"pith_short_8","alias_value":"BTVF2Q2S","created_at":"2026-07-04T14:37:57Z"}],"graph_snapshots":[{"event_id":"sha256:0f446f90b8a713e152e454db85606cc013287eca41ed89fbe973c0d9faf8ee56","target":"graph","created_at":"2026-07-04T14:37:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0311037/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that planar embeddable 3-connected CAD graphs are generically non-soluble. A CAD graph represents a configuration of points on the Euclidean plane with just enough distance dimensions between them to ensure rigidity. Formally, a CAD graph is a maximally independent graph, that is, one that satisfies the vertex-edge count 2v - 3 = e together with a corresponding inequality for each subgraph. The following main theorem of the paper resolves a conjecture of Owen in the planar case. Let G be a maximally independent 3-connected planar graph, with more than 3 vertices, together with a realis","authors_text":"Cambridge), John C. Owen (D-Cubed Ltd, Stephen C. Power (Lancaster University)","cross_cats":["math.AC"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2003-11-04T16:16:11Z","title":"Generic 3-connected planar constraint systems are not soluble by radicals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0311037","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:06013f70477ae0ddda99023da0092949970159ec52b21b46b3c3b40101dd6886","target":"record","created_at":"2026-07-04T14:37:57Z","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":"e2d8ae061b07801d9bfdb5183be38e88ceef5d21dfe5c88bb52fb191030cd077","cross_cats_sorted":["math.AC"],"license":"","primary_cat":"math.CO","submitted_at":"2003-11-04T16:16:11Z","title_canon_sha256":"95bfda6210e0a56cfcb2194a3bb507a7bbe93816f791770c92b3fa56085adaef"},"schema_version":"1.0","source":{"id":"math/0311037","kind":"arxiv","version":1}},"canonical_sha256":"0cea5d43528ed32845729c69f0ba13f5f0685b04c01ab7aef217c73eb7ac9383","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cea5d43528ed32845729c69f0ba13f5f0685b04c01ab7aef217c73eb7ac9383","first_computed_at":"2026-07-04T14:37:57.514010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:37:57.514010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lnaYhj+VEUTwqbKON1LYwBhQsLwz7jhR+ju5z5mPdCOEukAGkyXFoj3nzSoe+PpmTosyARxhkRJiMCpC50YzAQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:37:57.514467Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0311037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06013f70477ae0ddda99023da0092949970159ec52b21b46b3c3b40101dd6886","sha256:0f446f90b8a713e152e454db85606cc013287eca41ed89fbe973c0d9faf8ee56"],"state_sha256":"539bed90059f867ad575bff8c355d644bb47064855dd4af72c3752f274534863"}