{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4W6WJTWYY6Q7PLH5XFMZ5ISZYK","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":"b4b1ab812a1c59b20fc8c7d4aacbb5213a7642bc43baacc3837b580b2477b774","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-05T13:47:44Z","title_canon_sha256":"0097bef46748b1f3f3e55fcf122dfa92f3332b45a080354df637d15d62d73bbb"},"schema_version":"1.0","source":{"id":"1204.1228","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1228","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1228v2","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1228","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"4W6WJTWYY6Q7","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4W6WJTWYY6Q7PLH5","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4W6WJTWY","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:6e185250863ebf37953f792a6d89f40ece732573215e1c2d6017f332863f73b4","target":"graph","created_at":"2026-05-18T01:03:06Z","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":"Given a rigid realisation of a graph $G$ in ${\\mathbb R}^2$, it is an open problem to determine the maximum number of pairwise non-congruent realisations which have the same edge lengths as the given realisation. This problem can be restated as finding the number of solutions of a related system of quadratic equations and in this context it is natural to consider the number of solutions in ${\\mathbb C}^2$ rather that ${\\mathbb R}^2$. We show that the number of complex solutions, $c(G)$, is the same for all generic realisations of a rigid graph $G$, characterise the graphs $G$ for which $c(G)=1","authors_text":"Bill Jackson, J. C. Owen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-05T13:47:44Z","title":"The number of equivalent realisations of a rigid graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1228","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:5821c31f9029da50d27fd7194bb516eaa55ea6564d3fe8d7ebbac96244bd7ad7","target":"record","created_at":"2026-05-18T01:03:06Z","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":"b4b1ab812a1c59b20fc8c7d4aacbb5213a7642bc43baacc3837b580b2477b774","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-05T13:47:44Z","title_canon_sha256":"0097bef46748b1f3f3e55fcf122dfa92f3332b45a080354df637d15d62d73bbb"},"schema_version":"1.0","source":{"id":"1204.1228","kind":"arxiv","version":2}},"canonical_sha256":"e5bd64ced8c7a1f7acfdb9599ea259c2bb5781bc5f3f9e6e3e69208adc5846be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5bd64ced8c7a1f7acfdb9599ea259c2bb5781bc5f3f9e6e3e69208adc5846be","first_computed_at":"2026-05-18T01:03:06.779725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:06.779725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lBoZ20SSb4T3cjereokcn+WVYC3l4PzBqBFYWtIixrzFfUy5z2O9E3VOaTVz6NypXyYaCYeWxN7hMPuCslbeCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:06.780343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1228","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5821c31f9029da50d27fd7194bb516eaa55ea6564d3fe8d7ebbac96244bd7ad7","sha256:6e185250863ebf37953f792a6d89f40ece732573215e1c2d6017f332863f73b4"],"state_sha256":"18672a3014bcc3184a6d337da36a467e63ff91daa088a1146e1051048eee248e"}