{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DSX5ZFTNY7VQ2JSB27DMYMJOVS","short_pith_number":"pith:DSX5ZFTN","schema_version":"1.0","canonical_sha256":"1cafdc966dc7eb0d2641d7c6cc312eac9ebc41130e0e788c15ecb4939800ef72","source":{"kind":"arxiv","id":"2411.08434","version":2},"attestation_state":"computed","paper":{"title":"Anonymous Self-Stabilising Localisation via Spatial Population Protocols","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ehsan Latif, Grzegorz Stachowiak, Leszek G\\k{a}sieniec, {\\L}ukasz Kuszner, Paul Spirakis, Ramviyas Parasuraman","submitted_at":"2024-11-13T08:34:18Z","abstract_excerpt":"In the distributed localization problem (DLP), $n$ anonymous robots (agents) $a_0, a_1, ..., a_{n-1}$ begin at arbitrary positions $p_0, ..., p_{n-1}$ in $S$, where $S$ is an Euclidean space. The primary goal in DLP is for agents to reach a consensus on a unified coordinate system that accurately reflects the relative positions of all points, $p_0, ..., p_{n-1}$. Extensive research on DLP has primarily focused on the feasibility and complexity of achieving consensus when agents have limited access to inter-agent distances, often due to missing or imprecise data. In this paper, however, we exam"},"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":"2411.08434","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-11-13T08:34:18Z","cross_cats_sorted":[],"title_canon_sha256":"162cf4aef74944e253cb5e490af319d23b2f3efd6434926cd013353a26de99be","abstract_canon_sha256":"af494896b7de831afd710400f1d2dbe6620ee9ff8db93d94fc6f703b9acce966"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:01.833907Z","signature_b64":"4VgpkScPcPZnGiCoptsXtoEQVD3xEnM+WstTxRcMxzOuwBDQbU9CRBL7mS36hCgg/c9pSatIXbD9i9JHSNaqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cafdc966dc7eb0d2641d7c6cc312eac9ebc41130e0e788c15ecb4939800ef72","last_reissued_at":"2026-07-05T11:00:01.833432Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:01.833432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anonymous Self-Stabilising Localisation via Spatial Population Protocols","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ehsan Latif, Grzegorz Stachowiak, Leszek G\\k{a}sieniec, {\\L}ukasz Kuszner, Paul Spirakis, Ramviyas Parasuraman","submitted_at":"2024-11-13T08:34:18Z","abstract_excerpt":"In the distributed localization problem (DLP), $n$ anonymous robots (agents) $a_0, a_1, ..., a_{n-1}$ begin at arbitrary positions $p_0, ..., p_{n-1}$ in $S$, where $S$ is an Euclidean space. The primary goal in DLP is for agents to reach a consensus on a unified coordinate system that accurately reflects the relative positions of all points, $p_0, ..., p_{n-1}$. Extensive research on DLP has primarily focused on the feasibility and complexity of achieving consensus when agents have limited access to inter-agent distances, often due to missing or imprecise data. In this paper, however, we exam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.08434","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.08434/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.08434","created_at":"2026-07-05T11:00:01.833488+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.08434v2","created_at":"2026-07-05T11:00:01.833488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.08434","created_at":"2026-07-05T11:00:01.833488+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSX5ZFTNY7VQ","created_at":"2026-07-05T11:00:01.833488+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSX5ZFTNY7VQ2JSB","created_at":"2026-07-05T11:00:01.833488+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSX5ZFTN","created_at":"2026-07-05T11:00:01.833488+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01227","citing_title":"Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DSX5ZFTNY7VQ2JSB27DMYMJOVS","json":"https://pith.science/pith/DSX5ZFTNY7VQ2JSB27DMYMJOVS.json","graph_json":"https://pith.science/api/pith-number/DSX5ZFTNY7VQ2JSB27DMYMJOVS/graph.json","events_json":"https://pith.science/api/pith-number/DSX5ZFTNY7VQ2JSB27DMYMJOVS/events.json","paper":"https://pith.science/paper/DSX5ZFTN"},"agent_actions":{"view_html":"https://pith.science/pith/DSX5ZFTNY7VQ2JSB27DMYMJOVS","download_json":"https://pith.science/pith/DSX5ZFTNY7VQ2JSB27DMYMJOVS.json","view_paper":"https://pith.science/paper/DSX5ZFTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.08434&json=true","fetch_graph":"https://pith.science/api/pith-number/DSX5ZFTNY7VQ2JSB27DMYMJOVS/graph.json","fetch_events":"https://pith.science/api/pith-number/DSX5ZFTNY7VQ2JSB27DMYMJOVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSX5ZFTNY7VQ2JSB27DMYMJOVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSX5ZFTNY7VQ2JSB27DMYMJOVS/action/storage_attestation","attest_author":"https://pith.science/pith/DSX5ZFTNY7VQ2JSB27DMYMJOVS/action/author_attestation","sign_citation":"https://pith.science/pith/DSX5ZFTNY7VQ2JSB27DMYMJOVS/action/citation_signature","submit_replication":"https://pith.science/pith/DSX5ZFTNY7VQ2JSB27DMYMJOVS/action/replication_record"}},"created_at":"2026-07-05T11:00:01.833488+00:00","updated_at":"2026-07-05T11:00:01.833488+00:00"}