{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4W6WJTWYY6Q7PLH5XFMZ5ISZYK","short_pith_number":"pith:4W6WJTWY","schema_version":"1.0","canonical_sha256":"e5bd64ced8c7a1f7acfdb9599ea259c2bb5781bc5f3f9e6e3e69208adc5846be","source":{"kind":"arxiv","id":"1204.1228","version":2},"attestation_state":"computed","paper":{"title":"The number of equivalent realisations of a rigid graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bill Jackson, J. C. Owen","submitted_at":"2012-04-05T13:47:44Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1204.1228","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-05T13:47:44Z","cross_cats_sorted":[],"title_canon_sha256":"0097bef46748b1f3f3e55fcf122dfa92f3332b45a080354df637d15d62d73bbb","abstract_canon_sha256":"b4b1ab812a1c59b20fc8c7d4aacbb5213a7642bc43baacc3837b580b2477b774"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:06.780343Z","signature_b64":"lBoZ20SSb4T3cjereokcn+WVYC3l4PzBqBFYWtIixrzFfUy5z2O9E3VOaTVz6NypXyYaCYeWxN7hMPuCslbeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5bd64ced8c7a1f7acfdb9599ea259c2bb5781bc5f3f9e6e3e69208adc5846be","last_reissued_at":"2026-05-18T01:03:06.779725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:06.779725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The number of equivalent realisations of a rigid graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bill Jackson, J. C. Owen","submitted_at":"2012-04-05T13:47:44Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1228","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.1228","created_at":"2026-05-18T01:03:06.779819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.1228v2","created_at":"2026-05-18T01:03:06.779819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1228","created_at":"2026-05-18T01:03:06.779819+00:00"},{"alias_kind":"pith_short_12","alias_value":"4W6WJTWYY6Q7","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4W6WJTWYY6Q7PLH5","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4W6WJTWY","created_at":"2026-05-18T12:26:53.410803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4W6WJTWYY6Q7PLH5XFMZ5ISZYK","json":"https://pith.science/pith/4W6WJTWYY6Q7PLH5XFMZ5ISZYK.json","graph_json":"https://pith.science/api/pith-number/4W6WJTWYY6Q7PLH5XFMZ5ISZYK/graph.json","events_json":"https://pith.science/api/pith-number/4W6WJTWYY6Q7PLH5XFMZ5ISZYK/events.json","paper":"https://pith.science/paper/4W6WJTWY"},"agent_actions":{"view_html":"https://pith.science/pith/4W6WJTWYY6Q7PLH5XFMZ5ISZYK","download_json":"https://pith.science/pith/4W6WJTWYY6Q7PLH5XFMZ5ISZYK.json","view_paper":"https://pith.science/paper/4W6WJTWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.1228&json=true","fetch_graph":"https://pith.science/api/pith-number/4W6WJTWYY6Q7PLH5XFMZ5ISZYK/graph.json","fetch_events":"https://pith.science/api/pith-number/4W6WJTWYY6Q7PLH5XFMZ5ISZYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4W6WJTWYY6Q7PLH5XFMZ5ISZYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4W6WJTWYY6Q7PLH5XFMZ5ISZYK/action/storage_attestation","attest_author":"https://pith.science/pith/4W6WJTWYY6Q7PLH5XFMZ5ISZYK/action/author_attestation","sign_citation":"https://pith.science/pith/4W6WJTWYY6Q7PLH5XFMZ5ISZYK/action/citation_signature","submit_replication":"https://pith.science/pith/4W6WJTWYY6Q7PLH5XFMZ5ISZYK/action/replication_record"}},"created_at":"2026-05-18T01:03:06.779819+00:00","updated_at":"2026-05-18T01:03:06.779819+00:00"}