{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QUFGV3GVRSFASTATTHODM6SENM","short_pith_number":"pith:QUFGV3GV","schema_version":"1.0","canonical_sha256":"850a6aecd58c8a094c1399dc367a446b12b78039f3e554f8a4e8b15e659202f8","source":{"kind":"arxiv","id":"1710.08237","version":2},"attestation_state":"computed","paper":{"title":"Lower bounds on the number of realizations of rigid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.SC"],"primary_cat":"math.CO","authors_text":"Christoph Koutschan, Elias Tsigaridas, Georg Grasegger","submitted_at":"2017-10-23T12:40:04Z","abstract_excerpt":"Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the fastest available method, although its complexity is still exponential. Combining computational results with the theory of constructing new rigid graphs by gluing, we give a new lower bound on the maximal possible number of (complex) realizations for graphs with a given number of vertices. We extend these ideas to rigid graphs in three dimensions and we derive si"},"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":"1710.08237","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T12:40:04Z","cross_cats_sorted":["cs.CG","cs.SC"],"title_canon_sha256":"2f8d34a02632cdb42182c3bde6b9f335de12ab3108a8bf8f8edb9a0a6e89780d","abstract_canon_sha256":"c24ff4205efe1c32070c6e81ca4afc27fb98c988c10a07f0ca48c97a8447acac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:46.118479Z","signature_b64":"pYNQGB5AUKoqjLU7JPembUDBVryAsTjlfcwe8/hpxlOy4aTrBMvpqzmHJqCEPR3pJXk0MjTxeAigrqjusMa7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"850a6aecd58c8a094c1399dc367a446b12b78039f3e554f8a4e8b15e659202f8","last_reissued_at":"2026-05-18T00:18:46.117813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:46.117813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds on the number of realizations of rigid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.SC"],"primary_cat":"math.CO","authors_text":"Christoph Koutschan, Elias Tsigaridas, Georg Grasegger","submitted_at":"2017-10-23T12:40:04Z","abstract_excerpt":"Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the fastest available method, although its complexity is still exponential. Combining computational results with the theory of constructing new rigid graphs by gluing, we give a new lower bound on the maximal possible number of (complex) realizations for graphs with a given number of vertices. We extend these ideas to rigid graphs in three dimensions and we derive si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08237","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":"1710.08237","created_at":"2026-05-18T00:18:46.117914+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.08237v2","created_at":"2026-05-18T00:18:46.117914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08237","created_at":"2026-05-18T00:18:46.117914+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUFGV3GVRSFA","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUFGV3GVRSFASTAT","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUFGV3GV","created_at":"2026-05-18T12:31:39.905425+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/QUFGV3GVRSFASTATTHODM6SENM","json":"https://pith.science/pith/QUFGV3GVRSFASTATTHODM6SENM.json","graph_json":"https://pith.science/api/pith-number/QUFGV3GVRSFASTATTHODM6SENM/graph.json","events_json":"https://pith.science/api/pith-number/QUFGV3GVRSFASTATTHODM6SENM/events.json","paper":"https://pith.science/paper/QUFGV3GV"},"agent_actions":{"view_html":"https://pith.science/pith/QUFGV3GVRSFASTATTHODM6SENM","download_json":"https://pith.science/pith/QUFGV3GVRSFASTATTHODM6SENM.json","view_paper":"https://pith.science/paper/QUFGV3GV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.08237&json=true","fetch_graph":"https://pith.science/api/pith-number/QUFGV3GVRSFASTATTHODM6SENM/graph.json","fetch_events":"https://pith.science/api/pith-number/QUFGV3GVRSFASTATTHODM6SENM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUFGV3GVRSFASTATTHODM6SENM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUFGV3GVRSFASTATTHODM6SENM/action/storage_attestation","attest_author":"https://pith.science/pith/QUFGV3GVRSFASTATTHODM6SENM/action/author_attestation","sign_citation":"https://pith.science/pith/QUFGV3GVRSFASTATTHODM6SENM/action/citation_signature","submit_replication":"https://pith.science/pith/QUFGV3GVRSFASTATTHODM6SENM/action/replication_record"}},"created_at":"2026-05-18T00:18:46.117914+00:00","updated_at":"2026-05-18T00:18:46.117914+00:00"}