{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4IAL6FDSVXAVEOH4MBSH3DKWCP","short_pith_number":"pith:4IAL6FDS","schema_version":"1.0","canonical_sha256":"e200bf1472adc15238fc60647d8d5613eecf909c4b4930630842fbfc990b27b5","source":{"kind":"arxiv","id":"1011.2719","version":1},"attestation_state":"computed","paper":{"title":"Decidability Classes for Mobile Agents Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.MA"],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Pierre Fraigniaud","submitted_at":"2010-11-11T17:46:08Z","abstract_excerpt":"We establish a classification of decision problems that are to be solved by mobile agents operating in unlabeled graphs, using a deterministic protocol. The classification is with respect to the ability of a team of agents to solve the problem, possibly with the aid of additional information. In particular, our focus is on studying differences between the decidability of a decision problem by agents and its verifiability when a certificate for a positive answer is provided to the agents. We show that the class MAV of mobile agents verifiable problems is much wider than the class MAD of mobile "},"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":"1011.2719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-11T17:46:08Z","cross_cats_sorted":["cs.CC","cs.MA"],"title_canon_sha256":"642796482c00abd88e8e04c2b7f6da35d01de9f19ba670b7d15433b4f7bc7ac7","abstract_canon_sha256":"6ac63a124569a308aa7f7637f25d5e9772fd3d6074093920e6f9f4be0cddbd6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:09.675840Z","signature_b64":"XvpiEVQUmRa89G0r71+KYmrC1qTogMXjzK1fYZ+nK5ozVBhRcQncmr55RkltBmutx5F1DSG4GGONBg243hEWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e200bf1472adc15238fc60647d8d5613eecf909c4b4930630842fbfc990b27b5","last_reissued_at":"2026-05-18T04:36:09.675274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:09.675274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decidability Classes for Mobile Agents Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.MA"],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Pierre Fraigniaud","submitted_at":"2010-11-11T17:46:08Z","abstract_excerpt":"We establish a classification of decision problems that are to be solved by mobile agents operating in unlabeled graphs, using a deterministic protocol. The classification is with respect to the ability of a team of agents to solve the problem, possibly with the aid of additional information. In particular, our focus is on studying differences between the decidability of a decision problem by agents and its verifiability when a certificate for a positive answer is provided to the agents. We show that the class MAV of mobile agents verifiable problems is much wider than the class MAD of mobile "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2719","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":"1011.2719","created_at":"2026-05-18T04:36:09.675342+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.2719v1","created_at":"2026-05-18T04:36:09.675342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2719","created_at":"2026-05-18T04:36:09.675342+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IAL6FDSVXAV","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IAL6FDSVXAVEOH4","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IAL6FDS","created_at":"2026-05-18T12:26:03.138858+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/4IAL6FDSVXAVEOH4MBSH3DKWCP","json":"https://pith.science/pith/4IAL6FDSVXAVEOH4MBSH3DKWCP.json","graph_json":"https://pith.science/api/pith-number/4IAL6FDSVXAVEOH4MBSH3DKWCP/graph.json","events_json":"https://pith.science/api/pith-number/4IAL6FDSVXAVEOH4MBSH3DKWCP/events.json","paper":"https://pith.science/paper/4IAL6FDS"},"agent_actions":{"view_html":"https://pith.science/pith/4IAL6FDSVXAVEOH4MBSH3DKWCP","download_json":"https://pith.science/pith/4IAL6FDSVXAVEOH4MBSH3DKWCP.json","view_paper":"https://pith.science/paper/4IAL6FDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.2719&json=true","fetch_graph":"https://pith.science/api/pith-number/4IAL6FDSVXAVEOH4MBSH3DKWCP/graph.json","fetch_events":"https://pith.science/api/pith-number/4IAL6FDSVXAVEOH4MBSH3DKWCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IAL6FDSVXAVEOH4MBSH3DKWCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IAL6FDSVXAVEOH4MBSH3DKWCP/action/storage_attestation","attest_author":"https://pith.science/pith/4IAL6FDSVXAVEOH4MBSH3DKWCP/action/author_attestation","sign_citation":"https://pith.science/pith/4IAL6FDSVXAVEOH4MBSH3DKWCP/action/citation_signature","submit_replication":"https://pith.science/pith/4IAL6FDSVXAVEOH4MBSH3DKWCP/action/replication_record"}},"created_at":"2026-05-18T04:36:09.675342+00:00","updated_at":"2026-05-18T04:36:09.675342+00:00"}