{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:MZA7ASV3QF4POZ6NP4JYDZLVEX","short_pith_number":"pith:MZA7ASV3","schema_version":"1.0","canonical_sha256":"6641f04abb8178f767cd7f1381e57525c86761f92e9c92eb76f11f1c3160c579","source":{"kind":"arxiv","id":"1012.2440","version":1},"attestation_state":"computed","paper":{"title":"Passively Mobile Communicating Machines that Use Restricted Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CC","authors_text":"Andreas Pavlogiannis, Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis, Stavros Nikolaou","submitted_at":"2010-12-11T10:05:38Z","abstract_excerpt":"We propose a new theoretical model for passively mobile Wireless Sensor Networks, called PM, standing for Passively mobile Machines. The main modification w.r.t. the Population Protocol model is that agents now, instead of being automata, are Turing Machines. We provide general definitions for unbounded memories, but we are mainly interested in computations upper-bounded by plausible space limitations. However, we prove that our results hold for more general cases. We focus on complete communication graphs and define the complexity classes PMSPACE(f(n)) parametrically, consisting of all predic"},"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":"1012.2440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-11T10:05:38Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"ba5b277c59cba3ea7963ef063e8e43eacb3b9c5b672cb2cd07886544b9b860d3","abstract_canon_sha256":"f8c91f4ff49e65b36f0c078d167fe6117317b7eaaed56c997fe6b7e65832fe48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:28.624729Z","signature_b64":"jHUi6PZCkrT5iala8APPWt647HQftjK2Yal7t0MPg4858ifSVT+bTrwcUY0GJXFLNhnv4jU/hU/kfiuJrKnxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6641f04abb8178f767cd7f1381e57525c86761f92e9c92eb76f11f1c3160c579","last_reissued_at":"2026-05-18T04:33:28.624151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:28.624151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Passively Mobile Communicating Machines that Use Restricted Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CC","authors_text":"Andreas Pavlogiannis, Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis, Stavros Nikolaou","submitted_at":"2010-12-11T10:05:38Z","abstract_excerpt":"We propose a new theoretical model for passively mobile Wireless Sensor Networks, called PM, standing for Passively mobile Machines. The main modification w.r.t. the Population Protocol model is that agents now, instead of being automata, are Turing Machines. We provide general definitions for unbounded memories, but we are mainly interested in computations upper-bounded by plausible space limitations. However, we prove that our results hold for more general cases. We focus on complete communication graphs and define the complexity classes PMSPACE(f(n)) parametrically, consisting of all predic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2440","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":"1012.2440","created_at":"2026-05-18T04:33:28.624219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.2440v1","created_at":"2026-05-18T04:33:28.624219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2440","created_at":"2026-05-18T04:33:28.624219+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZA7ASV3QF4P","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZA7ASV3QF4POZ6N","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZA7ASV3","created_at":"2026-05-18T12:26:10.704358+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/MZA7ASV3QF4POZ6NP4JYDZLVEX","json":"https://pith.science/pith/MZA7ASV3QF4POZ6NP4JYDZLVEX.json","graph_json":"https://pith.science/api/pith-number/MZA7ASV3QF4POZ6NP4JYDZLVEX/graph.json","events_json":"https://pith.science/api/pith-number/MZA7ASV3QF4POZ6NP4JYDZLVEX/events.json","paper":"https://pith.science/paper/MZA7ASV3"},"agent_actions":{"view_html":"https://pith.science/pith/MZA7ASV3QF4POZ6NP4JYDZLVEX","download_json":"https://pith.science/pith/MZA7ASV3QF4POZ6NP4JYDZLVEX.json","view_paper":"https://pith.science/paper/MZA7ASV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.2440&json=true","fetch_graph":"https://pith.science/api/pith-number/MZA7ASV3QF4POZ6NP4JYDZLVEX/graph.json","fetch_events":"https://pith.science/api/pith-number/MZA7ASV3QF4POZ6NP4JYDZLVEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZA7ASV3QF4POZ6NP4JYDZLVEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZA7ASV3QF4POZ6NP4JYDZLVEX/action/storage_attestation","attest_author":"https://pith.science/pith/MZA7ASV3QF4POZ6NP4JYDZLVEX/action/author_attestation","sign_citation":"https://pith.science/pith/MZA7ASV3QF4POZ6NP4JYDZLVEX/action/citation_signature","submit_replication":"https://pith.science/pith/MZA7ASV3QF4POZ6NP4JYDZLVEX/action/replication_record"}},"created_at":"2026-05-18T04:33:28.624219+00:00","updated_at":"2026-05-18T04:33:28.624219+00:00"}