{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UZSACK3UQJD7VDQCDPCDPHPWDB","short_pith_number":"pith:UZSACK3U","schema_version":"1.0","canonical_sha256":"a664012b748247fa8e021bc4379df618791605ac7fbd9ede7bd6628fe209056a","source":{"kind":"arxiv","id":"1807.01050","version":1},"attestation_state":"computed","paper":{"title":"Constructing isostatic frameworks for the $\\ell^\\infty$ plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"D. Kitson, K. Clinch","submitted_at":"2018-07-03T09:46:00Z","abstract_excerpt":"We use a new coloured multi-graph constructive method to prove that every 2-tree decomposition can be realised in the plane as a bar-joint framework which is minimally rigid (isostatic) with respect to $\\ell^1$ or $\\ell^\\infty$ distance constraints. We show how to adapt this technique to incorporate symmetry and indicate several related open problems on rigidity, redundant rigidity and forced symmetric rigidity in normed spaces."},"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":"1807.01050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2018-07-03T09:46:00Z","cross_cats_sorted":[],"title_canon_sha256":"430089927098ab78bd50fef03ee69cdd346e9e8aef348994eaae786fbc71c8ab","abstract_canon_sha256":"310cb9bddf8e821971294573437e10e04c7108b0e495865d4cb28e06de2077fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:45.535059Z","signature_b64":"YYZKylB8LeKwyjqiJl9JshE/pky/LyvA4OIPFxSx9cK3mEH881NNLxrPzV91yVDPJa9UnbyZv+siBiu8jXbkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a664012b748247fa8e021bc4379df618791605ac7fbd9ede7bd6628fe209056a","last_reissued_at":"2026-05-18T00:11:45.534268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:45.534268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing isostatic frameworks for the $\\ell^\\infty$ plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"D. Kitson, K. Clinch","submitted_at":"2018-07-03T09:46:00Z","abstract_excerpt":"We use a new coloured multi-graph constructive method to prove that every 2-tree decomposition can be realised in the plane as a bar-joint framework which is minimally rigid (isostatic) with respect to $\\ell^1$ or $\\ell^\\infty$ distance constraints. We show how to adapt this technique to incorporate symmetry and indicate several related open problems on rigidity, redundant rigidity and forced symmetric rigidity in normed spaces."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01050","kind":"arxiv","version":1},"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":"1807.01050","created_at":"2026-05-18T00:11:45.534418+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01050v1","created_at":"2026-05-18T00:11:45.534418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01050","created_at":"2026-05-18T00:11:45.534418+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZSACK3UQJD7","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZSACK3UQJD7VDQC","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZSACK3U","created_at":"2026-05-18T12:32:56.356000+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/UZSACK3UQJD7VDQCDPCDPHPWDB","json":"https://pith.science/pith/UZSACK3UQJD7VDQCDPCDPHPWDB.json","graph_json":"https://pith.science/api/pith-number/UZSACK3UQJD7VDQCDPCDPHPWDB/graph.json","events_json":"https://pith.science/api/pith-number/UZSACK3UQJD7VDQCDPCDPHPWDB/events.json","paper":"https://pith.science/paper/UZSACK3U"},"agent_actions":{"view_html":"https://pith.science/pith/UZSACK3UQJD7VDQCDPCDPHPWDB","download_json":"https://pith.science/pith/UZSACK3UQJD7VDQCDPCDPHPWDB.json","view_paper":"https://pith.science/paper/UZSACK3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01050&json=true","fetch_graph":"https://pith.science/api/pith-number/UZSACK3UQJD7VDQCDPCDPHPWDB/graph.json","fetch_events":"https://pith.science/api/pith-number/UZSACK3UQJD7VDQCDPCDPHPWDB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZSACK3UQJD7VDQCDPCDPHPWDB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZSACK3UQJD7VDQCDPCDPHPWDB/action/storage_attestation","attest_author":"https://pith.science/pith/UZSACK3UQJD7VDQCDPCDPHPWDB/action/author_attestation","sign_citation":"https://pith.science/pith/UZSACK3UQJD7VDQCDPCDPHPWDB/action/citation_signature","submit_replication":"https://pith.science/pith/UZSACK3UQJD7VDQCDPCDPHPWDB/action/replication_record"}},"created_at":"2026-05-18T00:11:45.534418+00:00","updated_at":"2026-05-18T00:11:45.534418+00:00"}