{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:7COSRYHMFNYUWVOZMB74NYOB3F","short_pith_number":"pith:7COSRYHM","schema_version":"1.0","canonical_sha256":"f89d28e0ec2b714b55d9607fc6e1c1d96f35733f9556c6d70647a09c2af3188f","source":{"kind":"arxiv","id":"1010.5552","version":2},"attestation_state":"computed","paper":{"title":"Directed Graphs, Decompositions, and Spatial Linkages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Adnan Sljoka, Offer Shai, Walter Whiteley","submitted_at":"2010-10-27T02:17:49Z","abstract_excerpt":"The decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned d-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into minimal strongly connected components (in the sense of directed graphs), or equivalently into minimal pinned isostatic graphs, which we call d-Assur graphs. We also study key properties of motions induced by removing an edge in a d-Assur graph - defining a stronger sub-class of strongly d-Assur graphs by the property that all inner vertices go into motion, f"},"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":"1010.5552","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-27T02:17:49Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"cc394eb4c0805eece5bfa64fd72c94f6f85d8fb58efdabd99ccf862d451e3527","abstract_canon_sha256":"8dd5831ace7d998f9ef658932a818152284f6dfb8235d9d42ed8e5f86e31066c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:38.501308Z","signature_b64":"qPmeILeF+brQ2L4jytkBITKbT6YPd0xDIT9k4rtpzuXChJmRtoatX/d22fU9B97Laz6Yyf2sfTpKX7F3USHCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f89d28e0ec2b714b55d9607fc6e1c1d96f35733f9556c6d70647a09c2af3188f","last_reissued_at":"2026-05-18T02:23:38.500865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:38.500865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Directed Graphs, Decompositions, and Spatial Linkages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Adnan Sljoka, Offer Shai, Walter Whiteley","submitted_at":"2010-10-27T02:17:49Z","abstract_excerpt":"The decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned d-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into minimal strongly connected components (in the sense of directed graphs), or equivalently into minimal pinned isostatic graphs, which we call d-Assur graphs. We also study key properties of motions induced by removing an edge in a d-Assur graph - defining a stronger sub-class of strongly d-Assur graphs by the property that all inner vertices go into motion, f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5552","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":"1010.5552","created_at":"2026-05-18T02:23:38.500921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.5552v2","created_at":"2026-05-18T02:23:38.500921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5552","created_at":"2026-05-18T02:23:38.500921+00:00"},{"alias_kind":"pith_short_12","alias_value":"7COSRYHMFNYU","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"7COSRYHMFNYUWVOZ","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"7COSRYHM","created_at":"2026-05-18T12:26:04.259169+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/7COSRYHMFNYUWVOZMB74NYOB3F","json":"https://pith.science/pith/7COSRYHMFNYUWVOZMB74NYOB3F.json","graph_json":"https://pith.science/api/pith-number/7COSRYHMFNYUWVOZMB74NYOB3F/graph.json","events_json":"https://pith.science/api/pith-number/7COSRYHMFNYUWVOZMB74NYOB3F/events.json","paper":"https://pith.science/paper/7COSRYHM"},"agent_actions":{"view_html":"https://pith.science/pith/7COSRYHMFNYUWVOZMB74NYOB3F","download_json":"https://pith.science/pith/7COSRYHMFNYUWVOZMB74NYOB3F.json","view_paper":"https://pith.science/paper/7COSRYHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.5552&json=true","fetch_graph":"https://pith.science/api/pith-number/7COSRYHMFNYUWVOZMB74NYOB3F/graph.json","fetch_events":"https://pith.science/api/pith-number/7COSRYHMFNYUWVOZMB74NYOB3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7COSRYHMFNYUWVOZMB74NYOB3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7COSRYHMFNYUWVOZMB74NYOB3F/action/storage_attestation","attest_author":"https://pith.science/pith/7COSRYHMFNYUWVOZMB74NYOB3F/action/author_attestation","sign_citation":"https://pith.science/pith/7COSRYHMFNYUWVOZMB74NYOB3F/action/citation_signature","submit_replication":"https://pith.science/pith/7COSRYHMFNYUWVOZMB74NYOB3F/action/replication_record"}},"created_at":"2026-05-18T02:23:38.500921+00:00","updated_at":"2026-05-18T02:23:38.500921+00:00"}