{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4OEAACVC74YGUR34WIY37XL5KP","short_pith_number":"pith:4OEAACVC","schema_version":"1.0","canonical_sha256":"e388000aa2ff306a477cb231bfdd7d53db242113b609c8da9cfc6d2da0f32e8c","source":{"kind":"arxiv","id":"1112.6009","version":4},"attestation_state":"computed","paper":{"title":"Cayley Configuration Spaces of 1-dof Tree-decomposable Linkages, Part II: Combinatorial Characterization of Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Heping Gao, Meera Sitharam, Menghan Wang","submitted_at":"2011-12-27T19:38:42Z","abstract_excerpt":"We continue to study Cayley configuration spaces of 1-dof linkages in 2D begun in Part I of this paper, i.e. the set of attainable lengths for a non-edge. In Part II, we focus on the algebraic complexity of describing endpoints of the intervals in the set, i.e., the Cayley complexity.\n  Specifically, We focus on Cayley configuration spaces of a natural class of 1-dof linkages, called 1-dof tree-decomposable linkages. The underlying graphs G satisfy the following: for some base non-edge f, G \\cup f is quadratic-radically solvable (QRS), meaning that G \\cup f is minimally rigid, and given length"},"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":"1112.6009","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-27T19:38:42Z","cross_cats_sorted":[],"title_canon_sha256":"7f1a5b2fb06fe947d9eff1cf67dda309a1de88162dbbf19b5167902a453a7ef4","abstract_canon_sha256":"6e5841a7b0cb6ac9750a329eec68a26527f36f9785d373958060a04442d44b0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:26.911831Z","signature_b64":"lX904PDqVeFpSkWmOTlqpJ2pIc5eDRD5IMK0YgA0/8gCq2c1lRNTSuRKcajv8hAEYgvjRo+mMP3rpy8DKWpvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e388000aa2ff306a477cb231bfdd7d53db242113b609c8da9cfc6d2da0f32e8c","last_reissued_at":"2026-05-18T02:21:26.911197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:26.911197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cayley Configuration Spaces of 1-dof Tree-decomposable Linkages, Part II: Combinatorial Characterization of Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Heping Gao, Meera Sitharam, Menghan Wang","submitted_at":"2011-12-27T19:38:42Z","abstract_excerpt":"We continue to study Cayley configuration spaces of 1-dof linkages in 2D begun in Part I of this paper, i.e. the set of attainable lengths for a non-edge. In Part II, we focus on the algebraic complexity of describing endpoints of the intervals in the set, i.e., the Cayley complexity.\n  Specifically, We focus on Cayley configuration spaces of a natural class of 1-dof linkages, called 1-dof tree-decomposable linkages. The underlying graphs G satisfy the following: for some base non-edge f, G \\cup f is quadratic-radically solvable (QRS), meaning that G \\cup f is minimally rigid, and given length"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6009","kind":"arxiv","version":4},"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":"1112.6009","created_at":"2026-05-18T02:21:26.911277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.6009v4","created_at":"2026-05-18T02:21:26.911277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6009","created_at":"2026-05-18T02:21:26.911277+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OEAACVC74YG","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OEAACVC74YGUR34","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OEAACVC","created_at":"2026-05-18T12:26:20.644004+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/4OEAACVC74YGUR34WIY37XL5KP","json":"https://pith.science/pith/4OEAACVC74YGUR34WIY37XL5KP.json","graph_json":"https://pith.science/api/pith-number/4OEAACVC74YGUR34WIY37XL5KP/graph.json","events_json":"https://pith.science/api/pith-number/4OEAACVC74YGUR34WIY37XL5KP/events.json","paper":"https://pith.science/paper/4OEAACVC"},"agent_actions":{"view_html":"https://pith.science/pith/4OEAACVC74YGUR34WIY37XL5KP","download_json":"https://pith.science/pith/4OEAACVC74YGUR34WIY37XL5KP.json","view_paper":"https://pith.science/paper/4OEAACVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.6009&json=true","fetch_graph":"https://pith.science/api/pith-number/4OEAACVC74YGUR34WIY37XL5KP/graph.json","fetch_events":"https://pith.science/api/pith-number/4OEAACVC74YGUR34WIY37XL5KP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OEAACVC74YGUR34WIY37XL5KP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OEAACVC74YGUR34WIY37XL5KP/action/storage_attestation","attest_author":"https://pith.science/pith/4OEAACVC74YGUR34WIY37XL5KP/action/author_attestation","sign_citation":"https://pith.science/pith/4OEAACVC74YGUR34WIY37XL5KP/action/citation_signature","submit_replication":"https://pith.science/pith/4OEAACVC74YGUR34WIY37XL5KP/action/replication_record"}},"created_at":"2026-05-18T02:21:26.911277+00:00","updated_at":"2026-05-18T02:21:26.911277+00:00"}