{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5U4RU2TODQS7U2VGAHFPQUMQKP","short_pith_number":"pith:5U4RU2TO","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"},"canonical_sha256":"ed391a6a6e1c25fa6aa601caf8519053d99d008aa403030d55079e3ae57559c6","source":{"kind":"arxiv","id":"1204.6527","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6527","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6527v2","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6527","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"5U4RU2TODQS7","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5U4RU2TODQS7U2VG","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5U4RU2TO","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5U4RU2TODQS7U2VGAHFPQUMQKP","target":"record","payload":{"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"},"canonical_sha256":"ed391a6a6e1c25fa6aa601caf8519053d99d008aa403030d55079e3ae57559c6","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"},"source_kind":"arxiv","source_id":"1204.6527","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SqqTcNpQimobP5QrnxXlsBv2gv/elY7mPRvi945svLynjlzj8kX1KbOpuBVzijxS0BoTDf/Iw77jrkwc8nZABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:02:16.276520Z"},"content_sha256":"9e76d7d9ab2763736984023d90c89009eb132ed98f597f1c1837acb266a57047","schema_version":"1.0","event_id":"sha256:9e76d7d9ab2763736984023d90c89009eb132ed98f597f1c1837acb266a57047"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5U4RU2TODQS7U2VGAHFPQUMQKP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A1eONt4Uls2OzoPzPo7tSiHUhDujhFAfHhRp0t3YjIGHg6XJl3Ssz/sK9wnN8NmXa/JemvG3Eu2YFibQdLvxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:02:16.276850Z"},"content_sha256":"eabf901b21e0370b66d776717076bf3b963da92e3ce85a8536c5aa067582a181","schema_version":"1.0","event_id":"sha256:eabf901b21e0370b66d776717076bf3b963da92e3ce85a8536c5aa067582a181"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5U4RU2TODQS7U2VGAHFPQUMQKP/bundle.json","state_url":"https://pith.science/pith/5U4RU2TODQS7U2VGAHFPQUMQKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5U4RU2TODQS7U2VGAHFPQUMQKP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T03:02:16Z","links":{"resolver":"https://pith.science/pith/5U4RU2TODQS7U2VGAHFPQUMQKP","bundle":"https://pith.science/pith/5U4RU2TODQS7U2VGAHFPQUMQKP/bundle.json","state":"https://pith.science/pith/5U4RU2TODQS7U2VGAHFPQUMQKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5U4RU2TODQS7U2VGAHFPQUMQKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5U4RU2TODQS7U2VGAHFPQUMQKP","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":"84dce89006edfaad390ea6659353f856e1230da8bbbd919ce0ef7897ef47fa47","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-29T23:04:49Z","title_canon_sha256":"29d0e2f8bf83a1b72fd91b096855cae5c2239fe2c4c87822659c20c07b29b48c"},"schema_version":"1.0","source":{"id":"1204.6527","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6527","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6527v2","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6527","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"5U4RU2TODQS7","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5U4RU2TODQS7U2VG","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5U4RU2TO","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:eabf901b21e0370b66d776717076bf3b963da92e3ce85a8536c5aa067582a181","target":"graph","created_at":"2026-05-18T02:39:32Z","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":"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.","authors_text":"Ioannis Z. Emiris, Stylianos C. Despotakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-29T23:04:49Z","title":"An upper bound on Euclidean embeddings of rigid graphs with 8 vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6527","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:9e76d7d9ab2763736984023d90c89009eb132ed98f597f1c1837acb266a57047","target":"record","created_at":"2026-05-18T02:39:32Z","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":"84dce89006edfaad390ea6659353f856e1230da8bbbd919ce0ef7897ef47fa47","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-29T23:04:49Z","title_canon_sha256":"29d0e2f8bf83a1b72fd91b096855cae5c2239fe2c4c87822659c20c07b29b48c"},"schema_version":"1.0","source":{"id":"1204.6527","kind":"arxiv","version":2}},"canonical_sha256":"ed391a6a6e1c25fa6aa601caf8519053d99d008aa403030d55079e3ae57559c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed391a6a6e1c25fa6aa601caf8519053d99d008aa403030d55079e3ae57559c6","first_computed_at":"2026-05-18T02:39:32.408157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:32.408157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+mO9Lwfa4kmEHOma1zGi8/ZD3G9K/U9++jtBkvyg5/yv2PDsQDZU95oDo2W/GEbBM983PNtDq+flJoS7IDoCDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:32.408630Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.6527","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e76d7d9ab2763736984023d90c89009eb132ed98f597f1c1837acb266a57047","sha256:eabf901b21e0370b66d776717076bf3b963da92e3ce85a8536c5aa067582a181"],"state_sha256":"491b6b25b5719595c5dfaa5dbfbd636a5715f796ce1c44063c1fecd4843b857b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fz/Z2goF0yiXyHwo0qy51dIeot3Cc+hOIqvPU4GusitYJcMoF6qvUX+7yzbhBuc44K6Mt82Q4IGz1T4JelSFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:02:16.278716Z","bundle_sha256":"196a570e6a8a202b12cd263b473dd6530df192d8c46d202998389e9a2c944ce2"}}