{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BKKK4LZPXKJFXB6ULA7W2RZKOI","short_pith_number":"pith:BKKK4LZP","schema_version":"1.0","canonical_sha256":"0a94ae2f2fba925b87d4583f6d472a7206eb692cd1dab0e44a5ebea7462cb03d","source":{"kind":"arxiv","id":"1707.03633","version":2},"attestation_state":"computed","paper":{"title":"Computing the number of realizations of a Laman graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Christoph Koutschan, Georg Grasegger, Jose Capco, Josef Schicho, Matteo Gallet, Niels Lubbes","submitted_at":"2017-07-12T10:31:13Z","abstract_excerpt":"Laman graphs model planar frameworks which are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. In a recent paper we provide a recursion formula for this number of realizations using ideas from algebraic and tropical geometry. Here, we present a concise summary of this result focusing on the main ideas and the combinatorial point of view."},"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":"1707.03633","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-12T10:31:13Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"97b9122d5495528d46b4f1824991240a9966202f8475a99c0d446c1fef87e0a5","abstract_canon_sha256":"9be5ac9f4e3e961d3715fc38e155d2243420bf7760a9bf68b2b6075e93d5f153"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:06.408672Z","signature_b64":"DO3wI7/CWmpDIYTztUkC0y3aWD6TboLhMHt2K7gmhUKJ8kKw4Xq4IJdW6PdsudmyN3hciEVELYMrUmiFLFqoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a94ae2f2fba925b87d4583f6d472a7206eb692cd1dab0e44a5ebea7462cb03d","last_reissued_at":"2026-05-18T00:33:06.407943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:06.407943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the number of realizations of a Laman graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Christoph Koutschan, Georg Grasegger, Jose Capco, Josef Schicho, Matteo Gallet, Niels Lubbes","submitted_at":"2017-07-12T10:31:13Z","abstract_excerpt":"Laman graphs model planar frameworks which are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. In a recent paper we provide a recursion formula for this number of realizations using ideas from algebraic and tropical geometry. Here, we present a concise summary of this result focusing on the main ideas and the combinatorial point of view."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03633","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":"1707.03633","created_at":"2026-05-18T00:33:06.408053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03633v2","created_at":"2026-05-18T00:33:06.408053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03633","created_at":"2026-05-18T00:33:06.408053+00:00"},{"alias_kind":"pith_short_12","alias_value":"BKKK4LZPXKJF","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BKKK4LZPXKJFXB6U","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BKKK4LZP","created_at":"2026-05-18T12:31:08.081275+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/BKKK4LZPXKJFXB6ULA7W2RZKOI","json":"https://pith.science/pith/BKKK4LZPXKJFXB6ULA7W2RZKOI.json","graph_json":"https://pith.science/api/pith-number/BKKK4LZPXKJFXB6ULA7W2RZKOI/graph.json","events_json":"https://pith.science/api/pith-number/BKKK4LZPXKJFXB6ULA7W2RZKOI/events.json","paper":"https://pith.science/paper/BKKK4LZP"},"agent_actions":{"view_html":"https://pith.science/pith/BKKK4LZPXKJFXB6ULA7W2RZKOI","download_json":"https://pith.science/pith/BKKK4LZPXKJFXB6ULA7W2RZKOI.json","view_paper":"https://pith.science/paper/BKKK4LZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03633&json=true","fetch_graph":"https://pith.science/api/pith-number/BKKK4LZPXKJFXB6ULA7W2RZKOI/graph.json","fetch_events":"https://pith.science/api/pith-number/BKKK4LZPXKJFXB6ULA7W2RZKOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BKKK4LZPXKJFXB6ULA7W2RZKOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BKKK4LZPXKJFXB6ULA7W2RZKOI/action/storage_attestation","attest_author":"https://pith.science/pith/BKKK4LZPXKJFXB6ULA7W2RZKOI/action/author_attestation","sign_citation":"https://pith.science/pith/BKKK4LZPXKJFXB6ULA7W2RZKOI/action/citation_signature","submit_replication":"https://pith.science/pith/BKKK4LZPXKJFXB6ULA7W2RZKOI/action/replication_record"}},"created_at":"2026-05-18T00:33:06.408053+00:00","updated_at":"2026-05-18T00:33:06.408053+00:00"}