{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5U4RU2TODQS7U2VGAHFPQUMQKP","short_pith_number":"pith:5U4RU2TO","schema_version":"1.0","canonical_sha256":"ed391a6a6e1c25fa6aa601caf8519053d99d008aa403030d55079e3ae57559c6","source":{"kind":"arxiv","id":"1204.6527","version":2},"attestation_state":"computed","paper":{"title":"An upper bound on Euclidean embeddings of rigid graphs with 8 vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ioannis Z. Emiris, Stylianos C. Despotakis","submitted_at":"2012-04-29T23:04:49Z","abstract_excerpt":"A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in 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 of minimally rigid graphs with 8 vertices, because this is the smallest unknown case in the plane."},"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.6527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-29T23:04:49Z","cross_cats_sorted":[],"title_canon_sha256":"29d0e2f8bf83a1b72fd91b096855cae5c2239fe2c4c87822659c20c07b29b48c","abstract_canon_sha256":"84dce89006edfaad390ea6659353f856e1230da8bbbd919ce0ef7897ef47fa47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:32.408630Z","signature_b64":"+mO9Lwfa4kmEHOma1zGi8/ZD3G9K/U9++jtBkvyg5/yv2PDsQDZU95oDo2W/GEbBM983PNtDq+flJoS7IDoCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed391a6a6e1c25fa6aa601caf8519053d99d008aa403030d55079e3ae57559c6","last_reissued_at":"2026-05-18T02:39:32.408157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:32.408157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An upper bound on Euclidean embeddings of rigid graphs with 8 vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ioannis Z. Emiris, Stylianos C. Despotakis","submitted_at":"2012-04-29T23:04:49Z","abstract_excerpt":"A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in 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 of minimally rigid graphs with 8 vertices, because this is the smallest unknown case in the plane."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6527","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.6527","created_at":"2026-05-18T02:39:32.408213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.6527v2","created_at":"2026-05-18T02:39:32.408213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6527","created_at":"2026-05-18T02:39:32.408213+00:00"},{"alias_kind":"pith_short_12","alias_value":"5U4RU2TODQS7","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5U4RU2TODQS7U2VG","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5U4RU2TO","created_at":"2026-05-18T12:26:56.085431+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/5U4RU2TODQS7U2VGAHFPQUMQKP","json":"https://pith.science/pith/5U4RU2TODQS7U2VGAHFPQUMQKP.json","graph_json":"https://pith.science/api/pith-number/5U4RU2TODQS7U2VGAHFPQUMQKP/graph.json","events_json":"https://pith.science/api/pith-number/5U4RU2TODQS7U2VGAHFPQUMQKP/events.json","paper":"https://pith.science/paper/5U4RU2TO"},"agent_actions":{"view_html":"https://pith.science/pith/5U4RU2TODQS7U2VGAHFPQUMQKP","download_json":"https://pith.science/pith/5U4RU2TODQS7U2VGAHFPQUMQKP.json","view_paper":"https://pith.science/paper/5U4RU2TO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.6527&json=true","fetch_graph":"https://pith.science/api/pith-number/5U4RU2TODQS7U2VGAHFPQUMQKP/graph.json","fetch_events":"https://pith.science/api/pith-number/5U4RU2TODQS7U2VGAHFPQUMQKP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5U4RU2TODQS7U2VGAHFPQUMQKP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5U4RU2TODQS7U2VGAHFPQUMQKP/action/storage_attestation","attest_author":"https://pith.science/pith/5U4RU2TODQS7U2VGAHFPQUMQKP/action/author_attestation","sign_citation":"https://pith.science/pith/5U4RU2TODQS7U2VGAHFPQUMQKP/action/citation_signature","submit_replication":"https://pith.science/pith/5U4RU2TODQS7U2VGAHFPQUMQKP/action/replication_record"}},"created_at":"2026-05-18T02:39:32.408213+00:00","updated_at":"2026-05-18T02:39:32.408213+00:00"}