{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:KL3XAJU5SVI27UTFH77DI444NC","short_pith_number":"pith:KL3XAJU5","schema_version":"1.0","canonical_sha256":"52f770269d9551afd2653ffe34739c689237c7e492e1e281985befb4cf76cdab","source":{"kind":"arxiv","id":"0902.2420","version":3},"attestation_state":"computed","paper":{"title":"Self-Assembly as Graph Grammar as Distributed System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.DC","authors_text":"Aaron Sterling","submitted_at":"2009-02-14T01:17:03Z","abstract_excerpt":"In 2004, Klavins et al. introduced the use of graph grammars to describe -- and to program -- systems of self-assembly. It turns out that these graph grammars are a \"dual notion\" of a graph rewriting characterization of distributed systems that was proposed by Degano and Montanari over twenty years ago. By applying techniques obtained from this observation, we prove a generalized version of Soloveichik and Winfree's theorem on local determinism, and we also present a canonical method to simulate asynchronous constant-size-message-passing models of distributed computing with systems of self-ass"},"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":"0902.2420","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-02-14T01:17:03Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"7a588fb89453d83bc09f2c0d5a42b617ef34854ca2ed0ba2e333ca587f1dfbb5","abstract_canon_sha256":"8eb87bed31acbc1a20e813106a143ea2596ebb2479cfa4592c61ca03d21891ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:15.610103Z","signature_b64":"/wYnaExe8ONIya8kvq09qgKfpT87YV/wXwlW5CBEhQ939LS07zSjDthqdV0ZOxlb1lpJ2L9h/tHaKrIeY7mJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52f770269d9551afd2653ffe34739c689237c7e492e1e281985befb4cf76cdab","last_reissued_at":"2026-05-18T04:17:15.609406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:15.609406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Assembly as Graph Grammar as Distributed System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.DC","authors_text":"Aaron Sterling","submitted_at":"2009-02-14T01:17:03Z","abstract_excerpt":"In 2004, Klavins et al. introduced the use of graph grammars to describe -- and to program -- systems of self-assembly. It turns out that these graph grammars are a \"dual notion\" of a graph rewriting characterization of distributed systems that was proposed by Degano and Montanari over twenty years ago. By applying techniques obtained from this observation, we prove a generalized version of Soloveichik and Winfree's theorem on local determinism, and we also present a canonical method to simulate asynchronous constant-size-message-passing models of distributed computing with systems of self-ass"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.2420","kind":"arxiv","version":3},"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":"0902.2420","created_at":"2026-05-18T04:17:15.609497+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.2420v3","created_at":"2026-05-18T04:17:15.609497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.2420","created_at":"2026-05-18T04:17:15.609497+00:00"},{"alias_kind":"pith_short_12","alias_value":"KL3XAJU5SVI2","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"KL3XAJU5SVI27UTF","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"KL3XAJU5","created_at":"2026-05-18T12:26:00.592388+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/KL3XAJU5SVI27UTFH77DI444NC","json":"https://pith.science/pith/KL3XAJU5SVI27UTFH77DI444NC.json","graph_json":"https://pith.science/api/pith-number/KL3XAJU5SVI27UTFH77DI444NC/graph.json","events_json":"https://pith.science/api/pith-number/KL3XAJU5SVI27UTFH77DI444NC/events.json","paper":"https://pith.science/paper/KL3XAJU5"},"agent_actions":{"view_html":"https://pith.science/pith/KL3XAJU5SVI27UTFH77DI444NC","download_json":"https://pith.science/pith/KL3XAJU5SVI27UTFH77DI444NC.json","view_paper":"https://pith.science/paper/KL3XAJU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.2420&json=true","fetch_graph":"https://pith.science/api/pith-number/KL3XAJU5SVI27UTFH77DI444NC/graph.json","fetch_events":"https://pith.science/api/pith-number/KL3XAJU5SVI27UTFH77DI444NC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KL3XAJU5SVI27UTFH77DI444NC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KL3XAJU5SVI27UTFH77DI444NC/action/storage_attestation","attest_author":"https://pith.science/pith/KL3XAJU5SVI27UTFH77DI444NC/action/author_attestation","sign_citation":"https://pith.science/pith/KL3XAJU5SVI27UTFH77DI444NC/action/citation_signature","submit_replication":"https://pith.science/pith/KL3XAJU5SVI27UTFH77DI444NC/action/replication_record"}},"created_at":"2026-05-18T04:17:15.609497+00:00","updated_at":"2026-05-18T04:17:15.609497+00:00"}