{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SNXRUE4G7UKYYLJA3TRXGTZHIR","short_pith_number":"pith:SNXRUE4G","schema_version":"1.0","canonical_sha256":"936f1a1386fd158c2d20dce3734f274461359e638815aae7e6a97d1e33a2e101","source":{"kind":"arxiv","id":"1805.03691","version":2},"attestation_state":"computed","paper":{"title":"Self-Stabilizing Task Allocation In Spite of Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.MA","authors_text":"Anna Dornhaus, Dominik Pajak, Frederik Mallmann-Trenn, Nancy Lynch, Tsvetomira Radeva","submitted_at":"2018-05-09T18:40:20Z","abstract_excerpt":"We study the problem of distributed task allocation inspired by the behavior of social insects, which perform task allocation in a setting of limited capabilities and noisy environment feedback. We assume that each task has a demand that should be satisfied but not exceeded, i.e., there is an optimal number of ants that should be working on this task at a given time. The goal is to assign a near-optimal number of workers to each task in a distributed manner and without explicit access to the values of the demands nor the number of ants working on the task.\n  We seek to answer the question of h"},"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":"1805.03691","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-05-09T18:40:20Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"8a90029e42cdb301b4f427d38787fc8efc151eb38aec789a2bfc92a11997c5d7","abstract_canon_sha256":"d96a83356c5faa81648cd03ebcc9e07bff6207ee10c8ba1808dfc8692e736cea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:07.288284Z","signature_b64":"7Z8VI1csLaPiStf30XldeNejaKoXWmRkLP0WVp7RJxJcUI5NgwxbK2CLlWygpOUk21S7nRAaHdDlNDC5s1BEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"936f1a1386fd158c2d20dce3734f274461359e638815aae7e6a97d1e33a2e101","last_reissued_at":"2026-05-18T00:16:07.287613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:07.287613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Stabilizing Task Allocation In Spite of Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.MA","authors_text":"Anna Dornhaus, Dominik Pajak, Frederik Mallmann-Trenn, Nancy Lynch, Tsvetomira Radeva","submitted_at":"2018-05-09T18:40:20Z","abstract_excerpt":"We study the problem of distributed task allocation inspired by the behavior of social insects, which perform task allocation in a setting of limited capabilities and noisy environment feedback. We assume that each task has a demand that should be satisfied but not exceeded, i.e., there is an optimal number of ants that should be working on this task at a given time. The goal is to assign a near-optimal number of workers to each task in a distributed manner and without explicit access to the values of the demands nor the number of ants working on the task.\n  We seek to answer the question of h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03691","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":""},"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":"1805.03691","created_at":"2026-05-18T00:16:07.287736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03691v2","created_at":"2026-05-18T00:16:07.287736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03691","created_at":"2026-05-18T00:16:07.287736+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNXRUE4G7UKY","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNXRUE4G7UKYYLJA","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNXRUE4G","created_at":"2026-05-18T12:32:53.628368+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/SNXRUE4G7UKYYLJA3TRXGTZHIR","json":"https://pith.science/pith/SNXRUE4G7UKYYLJA3TRXGTZHIR.json","graph_json":"https://pith.science/api/pith-number/SNXRUE4G7UKYYLJA3TRXGTZHIR/graph.json","events_json":"https://pith.science/api/pith-number/SNXRUE4G7UKYYLJA3TRXGTZHIR/events.json","paper":"https://pith.science/paper/SNXRUE4G"},"agent_actions":{"view_html":"https://pith.science/pith/SNXRUE4G7UKYYLJA3TRXGTZHIR","download_json":"https://pith.science/pith/SNXRUE4G7UKYYLJA3TRXGTZHIR.json","view_paper":"https://pith.science/paper/SNXRUE4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03691&json=true","fetch_graph":"https://pith.science/api/pith-number/SNXRUE4G7UKYYLJA3TRXGTZHIR/graph.json","fetch_events":"https://pith.science/api/pith-number/SNXRUE4G7UKYYLJA3TRXGTZHIR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNXRUE4G7UKYYLJA3TRXGTZHIR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNXRUE4G7UKYYLJA3TRXGTZHIR/action/storage_attestation","attest_author":"https://pith.science/pith/SNXRUE4G7UKYYLJA3TRXGTZHIR/action/author_attestation","sign_citation":"https://pith.science/pith/SNXRUE4G7UKYYLJA3TRXGTZHIR/action/citation_signature","submit_replication":"https://pith.science/pith/SNXRUE4G7UKYYLJA3TRXGTZHIR/action/replication_record"}},"created_at":"2026-05-18T00:16:07.287736+00:00","updated_at":"2026-05-18T00:16:07.287736+00:00"}