{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NQH4MSEQO3AYWTBTEOWCLO6HNT","short_pith_number":"pith:NQH4MSEQ","schema_version":"1.0","canonical_sha256":"6c0fc6489076c18b4c3323ac25bbc76cf101e3d3d01c27c0c4ee639d965f4750","source":{"kind":"arxiv","id":"1109.3606","version":1},"attestation_state":"computed","paper":{"title":"Near Optimality in Covering and Packing Games by Exposing Global Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Georgios Piliouras, Jinwoo Shin, Maria-Florina Balcan, Sara Krehbiel","submitted_at":"2011-09-16T13:08:34Z","abstract_excerpt":"Covering and packing problems can be modeled as games to encapsulate interesting social and engineering settings. These games have a high Price of Anarchy in their natural formulation. However, existing research applicable to specific instances of these games has only been able to prove fast convergence to arbitrary equilibria. This paper studies general classes of covering and packing games with learning dynamics models that incorporate a central authority who broadcasts weak, socially beneficial signals to agents that otherwise only use local information in their decision-making. Rather than"},"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":"1109.3606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-16T13:08:34Z","cross_cats_sorted":[],"title_canon_sha256":"ea007e8225fe693d7b0723bc01a53cb23456b62c67a74b6989aaf6dc84a26344","abstract_canon_sha256":"81d059ae4a0b36418553138b596240437d8976815c4a29d4c9ad0701842ec7f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:55.874642Z","signature_b64":"raSPAHn2w5Qn9o4tvs6B1KgYsDqqjCnvbnpOYRxdORGAskJt+Z55NbxXtk9ziDflEUoHekPZ23q1st4fyFXJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c0fc6489076c18b4c3323ac25bbc76cf101e3d3d01c27c0c4ee639d965f4750","last_reissued_at":"2026-05-18T04:12:55.874095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:55.874095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near Optimality in Covering and Packing Games by Exposing Global Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Georgios Piliouras, Jinwoo Shin, Maria-Florina Balcan, Sara Krehbiel","submitted_at":"2011-09-16T13:08:34Z","abstract_excerpt":"Covering and packing problems can be modeled as games to encapsulate interesting social and engineering settings. These games have a high Price of Anarchy in their natural formulation. However, existing research applicable to specific instances of these games has only been able to prove fast convergence to arbitrary equilibria. This paper studies general classes of covering and packing games with learning dynamics models that incorporate a central authority who broadcasts weak, socially beneficial signals to agents that otherwise only use local information in their decision-making. Rather than"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3606","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":"1109.3606","created_at":"2026-05-18T04:12:55.874192+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3606v1","created_at":"2026-05-18T04:12:55.874192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3606","created_at":"2026-05-18T04:12:55.874192+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQH4MSEQO3AY","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQH4MSEQO3AYWTBT","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQH4MSEQ","created_at":"2026-05-18T12:26:37.096874+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/NQH4MSEQO3AYWTBTEOWCLO6HNT","json":"https://pith.science/pith/NQH4MSEQO3AYWTBTEOWCLO6HNT.json","graph_json":"https://pith.science/api/pith-number/NQH4MSEQO3AYWTBTEOWCLO6HNT/graph.json","events_json":"https://pith.science/api/pith-number/NQH4MSEQO3AYWTBTEOWCLO6HNT/events.json","paper":"https://pith.science/paper/NQH4MSEQ"},"agent_actions":{"view_html":"https://pith.science/pith/NQH4MSEQO3AYWTBTEOWCLO6HNT","download_json":"https://pith.science/pith/NQH4MSEQO3AYWTBTEOWCLO6HNT.json","view_paper":"https://pith.science/paper/NQH4MSEQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3606&json=true","fetch_graph":"https://pith.science/api/pith-number/NQH4MSEQO3AYWTBTEOWCLO6HNT/graph.json","fetch_events":"https://pith.science/api/pith-number/NQH4MSEQO3AYWTBTEOWCLO6HNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQH4MSEQO3AYWTBTEOWCLO6HNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQH4MSEQO3AYWTBTEOWCLO6HNT/action/storage_attestation","attest_author":"https://pith.science/pith/NQH4MSEQO3AYWTBTEOWCLO6HNT/action/author_attestation","sign_citation":"https://pith.science/pith/NQH4MSEQO3AYWTBTEOWCLO6HNT/action/citation_signature","submit_replication":"https://pith.science/pith/NQH4MSEQO3AYWTBTEOWCLO6HNT/action/replication_record"}},"created_at":"2026-05-18T04:12:55.874192+00:00","updated_at":"2026-05-18T04:12:55.874192+00:00"}