{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IZYQU7XTIXMKO6DFLMBODVX7HD","short_pith_number":"pith:IZYQU7XT","schema_version":"1.0","canonical_sha256":"46710a7ef345d8a778655b02e1d6ff38ef15f8a6be361ad00d8a6e6020ac6b7b","source":{"kind":"arxiv","id":"1402.1484","version":2},"attestation_state":"computed","paper":{"title":"Counting Euclidean embeddings of rigid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Ioannis Psarros, Ioannis Z. Emiris","submitted_at":"2014-02-06T20:50:22Z","abstract_excerpt":"A graph is called (generically) rigid in $\\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the problem of determining the maximum number of planar Euclidean embeddings as a function of the number of the vertices. We obtain polynomial systems which totally capture the structure of a given graph, by exploiting distance geometry theory. Consequently, counting the number of Euclidean embeddings of a given rigid graph, reduces to the problem of counting roo"},"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":"1402.1484","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-02-06T20:50:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d259761b90dd3f476ab89d28c0f270c9fa3f3ce8db1ca5734e0936629ca8a00d","abstract_canon_sha256":"b6d7cad931539ce0e5ecd3c65a50fd8a3c5470341d940c7695cf4040af5fbfe6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:08.711207Z","signature_b64":"medQrlCbMDcBwswF7zPB++HciVV4/w1ec/XnDlWr/dGHs0cu1+93ksUXmJrCEc0/AeSkZdqgREGd2FVwkmXzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46710a7ef345d8a778655b02e1d6ff38ef15f8a6be361ad00d8a6e6020ac6b7b","last_reissued_at":"2026-05-18T00:52:08.710649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:08.710649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Euclidean embeddings of rigid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Ioannis Psarros, Ioannis Z. Emiris","submitted_at":"2014-02-06T20:50:22Z","abstract_excerpt":"A graph is called (generically) rigid in $\\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the problem of determining the maximum number of planar Euclidean embeddings as a function of the number of the vertices. We obtain polynomial systems which totally capture the structure of a given graph, by exploiting distance geometry theory. Consequently, counting the number of Euclidean embeddings of a given rigid graph, reduces to the problem of counting roo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1484","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":"1402.1484","created_at":"2026-05-18T00:52:08.710740+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.1484v2","created_at":"2026-05-18T00:52:08.710740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1484","created_at":"2026-05-18T00:52:08.710740+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZYQU7XTIXMK","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZYQU7XTIXMKO6DF","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZYQU7XT","created_at":"2026-05-18T12:28:33.132498+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/IZYQU7XTIXMKO6DFLMBODVX7HD","json":"https://pith.science/pith/IZYQU7XTIXMKO6DFLMBODVX7HD.json","graph_json":"https://pith.science/api/pith-number/IZYQU7XTIXMKO6DFLMBODVX7HD/graph.json","events_json":"https://pith.science/api/pith-number/IZYQU7XTIXMKO6DFLMBODVX7HD/events.json","paper":"https://pith.science/paper/IZYQU7XT"},"agent_actions":{"view_html":"https://pith.science/pith/IZYQU7XTIXMKO6DFLMBODVX7HD","download_json":"https://pith.science/pith/IZYQU7XTIXMKO6DFLMBODVX7HD.json","view_paper":"https://pith.science/paper/IZYQU7XT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.1484&json=true","fetch_graph":"https://pith.science/api/pith-number/IZYQU7XTIXMKO6DFLMBODVX7HD/graph.json","fetch_events":"https://pith.science/api/pith-number/IZYQU7XTIXMKO6DFLMBODVX7HD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZYQU7XTIXMKO6DFLMBODVX7HD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZYQU7XTIXMKO6DFLMBODVX7HD/action/storage_attestation","attest_author":"https://pith.science/pith/IZYQU7XTIXMKO6DFLMBODVX7HD/action/author_attestation","sign_citation":"https://pith.science/pith/IZYQU7XTIXMKO6DFLMBODVX7HD/action/citation_signature","submit_replication":"https://pith.science/pith/IZYQU7XTIXMKO6DFLMBODVX7HD/action/replication_record"}},"created_at":"2026-05-18T00:52:08.710740+00:00","updated_at":"2026-05-18T00:52:08.710740+00:00"}