{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SNXRUE4G7UKYYLJA3TRXGTZHIR","short_pith_number":"pith:SNXRUE4G","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"},"canonical_sha256":"936f1a1386fd158c2d20dce3734f274461359e638815aae7e6a97d1e33a2e101","source":{"kind":"arxiv","id":"1805.03691","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03691","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03691v2","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03691","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"SNXRUE4G7UKY","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SNXRUE4G7UKYYLJA","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SNXRUE4G","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SNXRUE4G7UKYYLJA3TRXGTZHIR","target":"record","payload":{"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"},"canonical_sha256":"936f1a1386fd158c2d20dce3734f274461359e638815aae7e6a97d1e33a2e101","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"},"source_kind":"arxiv","source_id":"1805.03691","source_version":2,"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-18T00:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4b5zZkvBP2isITuCi6cIT0w14w78MSEeX7UXjOtYN6WSAJaPzC8s8YRlcaRJDLvKNMTzF9QK7EaQ3Cef0nMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:15:11.280397Z"},"content_sha256":"2cc49378c2e9d23f5b9cbdf5e987d1930aa1b6f1e30853bc448fc13d500d4e50","schema_version":"1.0","event_id":"sha256:2cc49378c2e9d23f5b9cbdf5e987d1930aa1b6f1e30853bc448fc13d500d4e50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SNXRUE4G7UKYYLJA3TRXGTZHIR","target":"graph","payload":{"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"},"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-18T00:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zGuAt/XF3ryVvPWWvC5/Bs/IVufCmGfCSVPoR3+lNbkKc6KOIeKcHo57rAWsdrH+CRqxZRRur/LeIA4g2B+1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:15:11.280754Z"},"content_sha256":"6c304fc5ccab6e32f1b07ffda06aab41037a97a31efbfa76d89ad5791ec0c07c","schema_version":"1.0","event_id":"sha256:6c304fc5ccab6e32f1b07ffda06aab41037a97a31efbfa76d89ad5791ec0c07c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SNXRUE4G7UKYYLJA3TRXGTZHIR/bundle.json","state_url":"https://pith.science/pith/SNXRUE4G7UKYYLJA3TRXGTZHIR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SNXRUE4G7UKYYLJA3TRXGTZHIR/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-01T20:15:11Z","links":{"resolver":"https://pith.science/pith/SNXRUE4G7UKYYLJA3TRXGTZHIR","bundle":"https://pith.science/pith/SNXRUE4G7UKYYLJA3TRXGTZHIR/bundle.json","state":"https://pith.science/pith/SNXRUE4G7UKYYLJA3TRXGTZHIR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SNXRUE4G7UKYYLJA3TRXGTZHIR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SNXRUE4G7UKYYLJA3TRXGTZHIR","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":"d96a83356c5faa81648cd03ebcc9e07bff6207ee10c8ba1808dfc8692e736cea","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-05-09T18:40:20Z","title_canon_sha256":"8a90029e42cdb301b4f427d38787fc8efc151eb38aec789a2bfc92a11997c5d7"},"schema_version":"1.0","source":{"id":"1805.03691","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03691","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03691v2","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03691","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"SNXRUE4G7UKY","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SNXRUE4G7UKYYLJA","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SNXRUE4G","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:6c304fc5ccab6e32f1b07ffda06aab41037a97a31efbfa76d89ad5791ec0c07c","target":"graph","created_at":"2026-05-18T00:16:07Z","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":"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","authors_text":"Anna Dornhaus, Dominik Pajak, Frederik Mallmann-Trenn, Nancy Lynch, Tsvetomira Radeva","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-05-09T18:40:20Z","title":"Self-Stabilizing Task Allocation In Spite of Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03691","kind":"arxiv","version":2},"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:2cc49378c2e9d23f5b9cbdf5e987d1930aa1b6f1e30853bc448fc13d500d4e50","target":"record","created_at":"2026-05-18T00:16:07Z","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":"d96a83356c5faa81648cd03ebcc9e07bff6207ee10c8ba1808dfc8692e736cea","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-05-09T18:40:20Z","title_canon_sha256":"8a90029e42cdb301b4f427d38787fc8efc151eb38aec789a2bfc92a11997c5d7"},"schema_version":"1.0","source":{"id":"1805.03691","kind":"arxiv","version":2}},"canonical_sha256":"936f1a1386fd158c2d20dce3734f274461359e638815aae7e6a97d1e33a2e101","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"936f1a1386fd158c2d20dce3734f274461359e638815aae7e6a97d1e33a2e101","first_computed_at":"2026-05-18T00:16:07.287613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:07.287613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Z8VI1csLaPiStf30XldeNejaKoXWmRkLP0WVp7RJxJcUI5NgwxbK2CLlWygpOUk21S7nRAaHdDlNDC5s1BEAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:07.288284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03691","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cc49378c2e9d23f5b9cbdf5e987d1930aa1b6f1e30853bc448fc13d500d4e50","sha256:6c304fc5ccab6e32f1b07ffda06aab41037a97a31efbfa76d89ad5791ec0c07c"],"state_sha256":"5237ceb51d173e6f8f56526c025f7758b5978b56ed78cda3489ee54f4502e37f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZAtIan7n89iK3c1cDohpaPyrBusjrMYFBm2T076zTGH4vZ1KnPz13yAmFZm7aFB74D6gLp4YA9KFN3yoLjpoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:15:11.282692Z","bundle_sha256":"63328cbdb91b25d74053acb948599130fff06c55b1aa9d756209a6233ac10549"}}