{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:CU3LBALA5RSTNBZJJVEPNPSFHC","short_pith_number":"pith:CU3LBALA","schema_version":"1.0","canonical_sha256":"1536b08160ec653687294d48f6be45389facb26f46136fc3fd93ddd793327e14","source":{"kind":"arxiv","id":"0910.1585","version":2},"attestation_state":"computed","paper":{"title":"Distributed Computing with Adaptive Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DC","authors_text":"Aaron D. Jaggard, Michael Schapira, Rebecca N. Wright","submitted_at":"2009-10-08T22:39:39Z","abstract_excerpt":"We use ideas from distributed computing to study dynamic environments in which computational nodes, or decision makers, follow adaptive heuristics (Hart 2005), i.e., simple and unsophisticated rules of behavior, e.g., repeatedly \"best replying\" to others' actions, and minimizing \"regret\", that have been extensively studied in game theory and economics. We explore when convergence of such simple dynamics to an equilibrium is guaranteed in asynchronous computational environments, where nodes can act at any time. Our research agenda, distributed computing with adaptive heuristics, lies on the bor"},"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":"0910.1585","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-10-08T22:39:39Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"d128f55059233f25d010ae4c4a112d281889bfb80806e544c74f3e446df3e4d9","abstract_canon_sha256":"76dd6be55d9a6d4b2e73c53ea39fb015d95c05d8de9623675d6e7dbfd3d6a232"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:28.864145Z","signature_b64":"3JY3OSZEb1LjNUN+to32AfKUNXck4wHpg4TS3aGPR7IIdrMo2I70AcesVU97oEcTBxOpfReLbs6U0PWtKpkpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1536b08160ec653687294d48f6be45389facb26f46136fc3fd93ddd793327e14","last_reissued_at":"2026-05-18T04:39:28.863547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:28.863547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Computing with Adaptive Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DC","authors_text":"Aaron D. Jaggard, Michael Schapira, Rebecca N. Wright","submitted_at":"2009-10-08T22:39:39Z","abstract_excerpt":"We use ideas from distributed computing to study dynamic environments in which computational nodes, or decision makers, follow adaptive heuristics (Hart 2005), i.e., simple and unsophisticated rules of behavior, e.g., repeatedly \"best replying\" to others' actions, and minimizing \"regret\", that have been extensively studied in game theory and economics. We explore when convergence of such simple dynamics to an equilibrium is guaranteed in asynchronous computational environments, where nodes can act at any time. Our research agenda, distributed computing with adaptive heuristics, lies on the bor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.1585","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":"0910.1585","created_at":"2026-05-18T04:39:28.863631+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.1585v2","created_at":"2026-05-18T04:39:28.863631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.1585","created_at":"2026-05-18T04:39:28.863631+00:00"},{"alias_kind":"pith_short_12","alias_value":"CU3LBALA5RST","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"CU3LBALA5RSTNBZJ","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"CU3LBALA","created_at":"2026-05-18T12:25:59.703012+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/CU3LBALA5RSTNBZJJVEPNPSFHC","json":"https://pith.science/pith/CU3LBALA5RSTNBZJJVEPNPSFHC.json","graph_json":"https://pith.science/api/pith-number/CU3LBALA5RSTNBZJJVEPNPSFHC/graph.json","events_json":"https://pith.science/api/pith-number/CU3LBALA5RSTNBZJJVEPNPSFHC/events.json","paper":"https://pith.science/paper/CU3LBALA"},"agent_actions":{"view_html":"https://pith.science/pith/CU3LBALA5RSTNBZJJVEPNPSFHC","download_json":"https://pith.science/pith/CU3LBALA5RSTNBZJJVEPNPSFHC.json","view_paper":"https://pith.science/paper/CU3LBALA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.1585&json=true","fetch_graph":"https://pith.science/api/pith-number/CU3LBALA5RSTNBZJJVEPNPSFHC/graph.json","fetch_events":"https://pith.science/api/pith-number/CU3LBALA5RSTNBZJJVEPNPSFHC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CU3LBALA5RSTNBZJJVEPNPSFHC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CU3LBALA5RSTNBZJJVEPNPSFHC/action/storage_attestation","attest_author":"https://pith.science/pith/CU3LBALA5RSTNBZJJVEPNPSFHC/action/author_attestation","sign_citation":"https://pith.science/pith/CU3LBALA5RSTNBZJJVEPNPSFHC/action/citation_signature","submit_replication":"https://pith.science/pith/CU3LBALA5RSTNBZJJVEPNPSFHC/action/replication_record"}},"created_at":"2026-05-18T04:39:28.863631+00:00","updated_at":"2026-05-18T04:39:28.863631+00:00"}