{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:532DU4NA3Q4MQINBVIGWI4GP32","short_pith_number":"pith:532DU4NA","canonical_record":{"source":{"id":"1603.07991","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-25T19:36:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0308d6dd8d8a451cfa0789712563d432d97f1b06b82ffd256a3d91298c1a0790","abstract_canon_sha256":"40740bf158495d86cbbb0f2b3d2afde710478a7527818c828ae238caab38b9b1"},"schema_version":"1.0"},"canonical_sha256":"eef43a71a0dc38c821a1aa0d6470cfde8e2057cb005fd6f5d536be909a9ce97d","source":{"kind":"arxiv","id":"1603.07991","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07991","created_at":"2026-05-17T23:52:44Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07991v4","created_at":"2026-05-17T23:52:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07991","created_at":"2026-05-17T23:52:44Z"},{"alias_kind":"pith_short_12","alias_value":"532DU4NA3Q4M","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"532DU4NA3Q4MQINB","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"532DU4NA","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:532DU4NA3Q4MQINBVIGWI4GP32","target":"record","payload":{"canonical_record":{"source":{"id":"1603.07991","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-25T19:36:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0308d6dd8d8a451cfa0789712563d432d97f1b06b82ffd256a3d91298c1a0790","abstract_canon_sha256":"40740bf158495d86cbbb0f2b3d2afde710478a7527818c828ae238caab38b9b1"},"schema_version":"1.0"},"canonical_sha256":"eef43a71a0dc38c821a1aa0d6470cfde8e2057cb005fd6f5d536be909a9ce97d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:44.715794Z","signature_b64":"Vn5NxNM8HbD9TiQZqygoiDZ/jjfJAXW5HAwkJW3BXra4wU5x729l3rSuH1atIDUS9IxtR2xiENUnkEkd8Rh2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eef43a71a0dc38c821a1aa0d6470cfde8e2057cb005fd6f5d536be909a9ce97d","last_reissued_at":"2026-05-17T23:52:44.715274Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:44.715274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.07991","source_version":4,"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-17T23:52:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"67l7KajwmcysCYGx6AS0aFkmpVQa+QjkA5sv65CUgusDttoY70j0kRLE2ctkEl4nR60LJl5M+LmhAIdKYW2AAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:40:52.603325Z"},"content_sha256":"e16855e45aa3b7d966e86d5724e71c0e521511ca9666225ec526151fceab0070","schema_version":"1.0","event_id":"sha256:e16855e45aa3b7d966e86d5724e71c0e521511ca9666225ec526151fceab0070"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:532DU4NA3Q4MQINBVIGWI4GP32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Andr\\'ea W. Richa, Dana Randall, Joshua J. Daymude, Sarah Cannon","submitted_at":"2016-03-25T19:36:24Z","abstract_excerpt":"In systems of programmable matter, we are given a collection of simple computation elements (or particles) with limited (constant-size) memory. We are interested in when they can self-organize to solve system-wide problems of movement, configuration and coordination. Here, we initiate a stochastic approach to developing robust distributed algorithms for programmable matter systems using Markov chains. We are able to leverage the wealth of prior work in Markov chains and related areas to design and rigorously analyze our distributed algorithms and show that they have several desirable propertie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07991","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"},"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-17T23:52:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KDT7cFNNus7S9F/DzhUIG1bpc6RtvEOgcj4tXz2LJ+C2w7XbnatUKJBYtAZwtWv6Aw/1o6xyztet6v21tjyPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:40:52.603689Z"},"content_sha256":"4269fa9bdcaeaf6e5bef3f5c6fef9c1a328856f2c30c006f317870f15e759036","schema_version":"1.0","event_id":"sha256:4269fa9bdcaeaf6e5bef3f5c6fef9c1a328856f2c30c006f317870f15e759036"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/532DU4NA3Q4MQINBVIGWI4GP32/bundle.json","state_url":"https://pith.science/pith/532DU4NA3Q4MQINBVIGWI4GP32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/532DU4NA3Q4MQINBVIGWI4GP32/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-04T01:40:52Z","links":{"resolver":"https://pith.science/pith/532DU4NA3Q4MQINBVIGWI4GP32","bundle":"https://pith.science/pith/532DU4NA3Q4MQINBVIGWI4GP32/bundle.json","state":"https://pith.science/pith/532DU4NA3Q4MQINBVIGWI4GP32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/532DU4NA3Q4MQINBVIGWI4GP32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:532DU4NA3Q4MQINBVIGWI4GP32","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":"40740bf158495d86cbbb0f2b3d2afde710478a7527818c828ae238caab38b9b1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-25T19:36:24Z","title_canon_sha256":"0308d6dd8d8a451cfa0789712563d432d97f1b06b82ffd256a3d91298c1a0790"},"schema_version":"1.0","source":{"id":"1603.07991","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07991","created_at":"2026-05-17T23:52:44Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07991v4","created_at":"2026-05-17T23:52:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07991","created_at":"2026-05-17T23:52:44Z"},{"alias_kind":"pith_short_12","alias_value":"532DU4NA3Q4M","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"532DU4NA3Q4MQINB","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"532DU4NA","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:4269fa9bdcaeaf6e5bef3f5c6fef9c1a328856f2c30c006f317870f15e759036","target":"graph","created_at":"2026-05-17T23:52:44Z","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 systems of programmable matter, we are given a collection of simple computation elements (or particles) with limited (constant-size) memory. We are interested in when they can self-organize to solve system-wide problems of movement, configuration and coordination. Here, we initiate a stochastic approach to developing robust distributed algorithms for programmable matter systems using Markov chains. We are able to leverage the wealth of prior work in Markov chains and related areas to design and rigorously analyze our distributed algorithms and show that they have several desirable propertie","authors_text":"Andr\\'ea W. Richa, Dana Randall, Joshua J. Daymude, Sarah Cannon","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-25T19:36:24Z","title":"A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07991","kind":"arxiv","version":4},"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:e16855e45aa3b7d966e86d5724e71c0e521511ca9666225ec526151fceab0070","target":"record","created_at":"2026-05-17T23:52:44Z","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":"40740bf158495d86cbbb0f2b3d2afde710478a7527818c828ae238caab38b9b1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-25T19:36:24Z","title_canon_sha256":"0308d6dd8d8a451cfa0789712563d432d97f1b06b82ffd256a3d91298c1a0790"},"schema_version":"1.0","source":{"id":"1603.07991","kind":"arxiv","version":4}},"canonical_sha256":"eef43a71a0dc38c821a1aa0d6470cfde8e2057cb005fd6f5d536be909a9ce97d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eef43a71a0dc38c821a1aa0d6470cfde8e2057cb005fd6f5d536be909a9ce97d","first_computed_at":"2026-05-17T23:52:44.715274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:44.715274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vn5NxNM8HbD9TiQZqygoiDZ/jjfJAXW5HAwkJW3BXra4wU5x729l3rSuH1atIDUS9IxtR2xiENUnkEkd8Rh2Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:44.715794Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07991","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e16855e45aa3b7d966e86d5724e71c0e521511ca9666225ec526151fceab0070","sha256:4269fa9bdcaeaf6e5bef3f5c6fef9c1a328856f2c30c006f317870f15e759036"],"state_sha256":"fee1265e47254f91fda03fc86e9a8f643600da6c26057e6242822255d4ce54c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dD31tbuMH61DbscRXReF5Q7Zk37xpa/N+XXqku2kIME+u1crGZspPyUN5g5DPwbxK55IoB9v3bCwBE2hCykACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:40:52.606033Z","bundle_sha256":"3861530cf4a4903bfccda8e059f39e5b5e8b51e4757c55424d2bee067811758f"}}