{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QUFGV3GVRSFASTATTHODM6SENM","short_pith_number":"pith:QUFGV3GV","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"},"canonical_sha256":"850a6aecd58c8a094c1399dc367a446b12b78039f3e554f8a4e8b15e659202f8","source":{"kind":"arxiv","id":"1710.08237","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08237","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08237v2","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08237","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"QUFGV3GVRSFA","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUFGV3GVRSFASTAT","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUFGV3GV","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QUFGV3GVRSFASTATTHODM6SENM","target":"record","payload":{"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"},"canonical_sha256":"850a6aecd58c8a094c1399dc367a446b12b78039f3e554f8a4e8b15e659202f8","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"},"source_kind":"arxiv","source_id":"1710.08237","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-18T00:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDufSXE3P2nyJKQ9cBimwMfHxBiTctV2T2sv/YpNocc1R7gKTBu2sI2mhX3DS/WWTX1Re045mHd3JZdt5WUtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:24:19.493241Z"},"content_sha256":"640b214abff7952de0905910b9c6a016de9e7bb89b5f3e3eb2b6831f553e2408","schema_version":"1.0","event_id":"sha256:640b214abff7952de0905910b9c6a016de9e7bb89b5f3e3eb2b6831f553e2408"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QUFGV3GVRSFASTATTHODM6SENM","target":"graph","payload":{"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"},"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-18T00:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JCh8+y/OQmiuVV4LYYKt2XWKh1QsKqdZ0+calk94OqYh9gZDp9AK/w186ez1cIB07Z9iKt2VfJVB+w4hKZ2fBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:24:19.494001Z"},"content_sha256":"3bb2c43a98150a0b9fb12009558af2cb3e09fbebfae40e3b9deecfe5e46b8539","schema_version":"1.0","event_id":"sha256:3bb2c43a98150a0b9fb12009558af2cb3e09fbebfae40e3b9deecfe5e46b8539"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUFGV3GVRSFASTATTHODM6SENM/bundle.json","state_url":"https://pith.science/pith/QUFGV3GVRSFASTATTHODM6SENM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUFGV3GVRSFASTATTHODM6SENM/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-05-28T18:24:19Z","links":{"resolver":"https://pith.science/pith/QUFGV3GVRSFASTATTHODM6SENM","bundle":"https://pith.science/pith/QUFGV3GVRSFASTATTHODM6SENM/bundle.json","state":"https://pith.science/pith/QUFGV3GVRSFASTATTHODM6SENM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUFGV3GVRSFASTATTHODM6SENM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QUFGV3GVRSFASTATTHODM6SENM","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":"c24ff4205efe1c32070c6e81ca4afc27fb98c988c10a07f0ca48c97a8447acac","cross_cats_sorted":["cs.CG","cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T12:40:04Z","title_canon_sha256":"2f8d34a02632cdb42182c3bde6b9f335de12ab3108a8bf8f8edb9a0a6e89780d"},"schema_version":"1.0","source":{"id":"1710.08237","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08237","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08237v2","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08237","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"QUFGV3GVRSFA","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUFGV3GVRSFASTAT","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUFGV3GV","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:3bb2c43a98150a0b9fb12009558af2cb3e09fbebfae40e3b9deecfe5e46b8539","target":"graph","created_at":"2026-05-18T00:18:46Z","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":"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","authors_text":"Christoph Koutschan, Elias Tsigaridas, Georg Grasegger","cross_cats":["cs.CG","cs.SC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T12:40:04Z","title":"Lower bounds on the number of realizations of rigid graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08237","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:640b214abff7952de0905910b9c6a016de9e7bb89b5f3e3eb2b6831f553e2408","target":"record","created_at":"2026-05-18T00:18:46Z","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":"c24ff4205efe1c32070c6e81ca4afc27fb98c988c10a07f0ca48c97a8447acac","cross_cats_sorted":["cs.CG","cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T12:40:04Z","title_canon_sha256":"2f8d34a02632cdb42182c3bde6b9f335de12ab3108a8bf8f8edb9a0a6e89780d"},"schema_version":"1.0","source":{"id":"1710.08237","kind":"arxiv","version":2}},"canonical_sha256":"850a6aecd58c8a094c1399dc367a446b12b78039f3e554f8a4e8b15e659202f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"850a6aecd58c8a094c1399dc367a446b12b78039f3e554f8a4e8b15e659202f8","first_computed_at":"2026-05-18T00:18:46.117813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:46.117813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pYNQGB5AUKoqjLU7JPembUDBVryAsTjlfcwe8/hpxlOy4aTrBMvpqzmHJqCEPR3pJXk0MjTxeAigrqjusMa7CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:46.118479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08237","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:640b214abff7952de0905910b9c6a016de9e7bb89b5f3e3eb2b6831f553e2408","sha256:3bb2c43a98150a0b9fb12009558af2cb3e09fbebfae40e3b9deecfe5e46b8539"],"state_sha256":"68c64bfa64dc39bc450adcf7021aae11affb70cc96579fb6825fd0f082ba62ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RiAbeWhSYmkSX4RHA9DLThEaziDorp6FxPrPpLE8VZv21DT64dpX1XvYfPz/2qSniGjhfqAtQ5mH7PKlNm+ADQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:24:19.498095Z","bundle_sha256":"109b60e8fbe3d29c4f1c5fc54a4c19ba78646631a58fbc088b045b0ce4434f04"}}