{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:KL3XAJU5SVI27UTFH77DI444NC","short_pith_number":"pith:KL3XAJU5","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"},"canonical_sha256":"52f770269d9551afd2653ffe34739c689237c7e492e1e281985befb4cf76cdab","source":{"kind":"arxiv","id":"0902.2420","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.2420","created_at":"2026-05-18T04:17:15Z"},{"alias_kind":"arxiv_version","alias_value":"0902.2420v3","created_at":"2026-05-18T04:17:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.2420","created_at":"2026-05-18T04:17:15Z"},{"alias_kind":"pith_short_12","alias_value":"KL3XAJU5SVI2","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"KL3XAJU5SVI27UTF","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"KL3XAJU5","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:KL3XAJU5SVI27UTFH77DI444NC","target":"record","payload":{"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"},"canonical_sha256":"52f770269d9551afd2653ffe34739c689237c7e492e1e281985befb4cf76cdab","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"},"source_kind":"arxiv","source_id":"0902.2420","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:17:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fr3InSmd5gUxLjT9hC1XFI9sFvbchuHZAuTmP1J2s7hvp3KrzXMaEaeajRV0YXtuIX91AJ5qKsmwpU3VhcVJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T07:27:53.829118Z"},"content_sha256":"a6787a00f6227eb7e2635ae093bcfe1264baa0eacde41d400dd7110fa4824416","schema_version":"1.0","event_id":"sha256:a6787a00f6227eb7e2635ae093bcfe1264baa0eacde41d400dd7110fa4824416"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:KL3XAJU5SVI27UTFH77DI444NC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:17:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fqVtt+RmilTr1DUz7JiQEKdvbdGKi8C/A4vWVMutRQaQhk4hwK2GjHwpboHgRb5dpX8Y3OlKrx0MAB/pgqr5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T07:27:53.829478Z"},"content_sha256":"f12b88e560dd745bb689369c9e2ed9ccef1b1866f75632da063f5dd093a3acaf","schema_version":"1.0","event_id":"sha256:f12b88e560dd745bb689369c9e2ed9ccef1b1866f75632da063f5dd093a3acaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KL3XAJU5SVI27UTFH77DI444NC/bundle.json","state_url":"https://pith.science/pith/KL3XAJU5SVI27UTFH77DI444NC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KL3XAJU5SVI27UTFH77DI444NC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T07:27:53Z","links":{"resolver":"https://pith.science/pith/KL3XAJU5SVI27UTFH77DI444NC","bundle":"https://pith.science/pith/KL3XAJU5SVI27UTFH77DI444NC/bundle.json","state":"https://pith.science/pith/KL3XAJU5SVI27UTFH77DI444NC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KL3XAJU5SVI27UTFH77DI444NC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:KL3XAJU5SVI27UTFH77DI444NC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8eb87bed31acbc1a20e813106a143ea2596ebb2479cfa4592c61ca03d21891ea","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-02-14T01:17:03Z","title_canon_sha256":"7a588fb89453d83bc09f2c0d5a42b617ef34854ca2ed0ba2e333ca587f1dfbb5"},"schema_version":"1.0","source":{"id":"0902.2420","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.2420","created_at":"2026-05-18T04:17:15Z"},{"alias_kind":"arxiv_version","alias_value":"0902.2420v3","created_at":"2026-05-18T04:17:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.2420","created_at":"2026-05-18T04:17:15Z"},{"alias_kind":"pith_short_12","alias_value":"KL3XAJU5SVI2","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"KL3XAJU5SVI27UTF","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"KL3XAJU5","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:f12b88e560dd745bb689369c9e2ed9ccef1b1866f75632da063f5dd093a3acaf","target":"graph","created_at":"2026-05-18T04:17:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aaron Sterling","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-02-14T01:17:03Z","title":"Self-Assembly as Graph Grammar as Distributed System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.2420","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a6787a00f6227eb7e2635ae093bcfe1264baa0eacde41d400dd7110fa4824416","target":"record","created_at":"2026-05-18T04:17:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8eb87bed31acbc1a20e813106a143ea2596ebb2479cfa4592c61ca03d21891ea","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-02-14T01:17:03Z","title_canon_sha256":"7a588fb89453d83bc09f2c0d5a42b617ef34854ca2ed0ba2e333ca587f1dfbb5"},"schema_version":"1.0","source":{"id":"0902.2420","kind":"arxiv","version":3}},"canonical_sha256":"52f770269d9551afd2653ffe34739c689237c7e492e1e281985befb4cf76cdab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52f770269d9551afd2653ffe34739c689237c7e492e1e281985befb4cf76cdab","first_computed_at":"2026-05-18T04:17:15.609406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:17:15.609406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/wYnaExe8ONIya8kvq09qgKfpT87YV/wXwlW5CBEhQ939LS07zSjDthqdV0ZOxlb1lpJ2L9h/tHaKrIeY7mJCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:17:15.610103Z","signed_message":"canonical_sha256_bytes"},"source_id":"0902.2420","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6787a00f6227eb7e2635ae093bcfe1264baa0eacde41d400dd7110fa4824416","sha256:f12b88e560dd745bb689369c9e2ed9ccef1b1866f75632da063f5dd093a3acaf"],"state_sha256":"f86cd3fa0af0e976dfe15c08cbb7d0a74b5fcd8f181fee1da8010054b37f75c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZB2ZWryJODynpH2HZ2Q5QyyEEY+7tdzbeiQ/wsIcvamD1eYTwhHldLKN1jCbZt3ZoSH0GV52x28eeKxAGX4CDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T07:27:53.831361Z","bundle_sha256":"2e1cca39250f7febf285f992ecfa0781cf32e1dee53fa1bfeacea791d6abc342"}}