{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XXJOVYPA2GW7WLHQ5DFMQGCIDX","short_pith_number":"pith:XXJOVYPA","schema_version":"1.0","canonical_sha256":"bdd2eae1e0d1adfb2cf0e8cac818481dfd3bba4870486ff24af56f2346d06902","source":{"kind":"arxiv","id":"2603.05789","version":5},"attestation_state":"computed","paper":{"title":"The Coordination Gap: Multi-Agent Alternation Metrics for Temporal Fairness in Repeated Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"cs.MA","authors_text":"Ismael Tito Freire, Konstantinos E. Psannis, Marti Sanchez-Fibla, Nikolaos Al. Papadopoulos","submitted_at":"2026-03-06T00:43:53Z","abstract_excerpt":"Repeated multi-agent interactions require evaluation metrics that capture not only payoff distributions but also their temporal organization. Conventional outcome-based fairness measures can assign similar aggregate scores to temporally distinct coordination patterns, obscuring whether access to a shared resource is genuinely rotating or persistently monopolized. We study this problem in the Honey-Jar Game (HJG), a minimally dynamic repeated threshold-congestion Markov game in which n agents compete for exclusive access to a single high-reward resource.\n  We introduce Perfect Alternation (PA),"},"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":"2603.05789","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-03-06T00:43:53Z","cross_cats_sorted":["cs.GT","cs.LG"],"title_canon_sha256":"8aeddf9c703b5b1093424d4df2ced92f331f651a1a22aff8432719529c27a6d8","abstract_canon_sha256":"67571a4c2291daef79b7773ca0252ff8fb27204c338c981bc1caefa57310fd71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-27T00:19:47.550676Z","signature_b64":"FR+rNZrLTbLjiBr+926ZFCfcMFyMDsVpmceYnrulaJwCjawoYvR1JUcyIllWWCjZ2OsNBafnRFFR7u3WwpI9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdd2eae1e0d1adfb2cf0e8cac818481dfd3bba4870486ff24af56f2346d06902","last_reissued_at":"2026-07-27T00:19:47.549725Z","signature_status":"signed_v1","first_computed_at":"2026-07-27T00:19:47.549725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Coordination Gap: Multi-Agent Alternation Metrics for Temporal Fairness in Repeated Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"cs.MA","authors_text":"Ismael Tito Freire, Konstantinos E. Psannis, Marti Sanchez-Fibla, Nikolaos Al. Papadopoulos","submitted_at":"2026-03-06T00:43:53Z","abstract_excerpt":"Repeated multi-agent interactions require evaluation metrics that capture not only payoff distributions but also their temporal organization. Conventional outcome-based fairness measures can assign similar aggregate scores to temporally distinct coordination patterns, obscuring whether access to a shared resource is genuinely rotating or persistently monopolized. We study this problem in the Honey-Jar Game (HJG), a minimally dynamic repeated threshold-congestion Markov game in which n agents compete for exclusive access to a single high-reward resource.\n  We introduce Perfect Alternation (PA),"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.05789","kind":"arxiv","version":5},"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/2603.05789/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":"2603.05789","created_at":"2026-07-27T00:19:47.550176+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.05789v5","created_at":"2026-07-27T00:19:47.550176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.05789","created_at":"2026-07-27T00:19:47.550176+00:00"},{"alias_kind":"pith_short_12","alias_value":"XXJOVYPA2GW7","created_at":"2026-07-27T00:19:47.550176+00:00"},{"alias_kind":"pith_short_16","alias_value":"XXJOVYPA2GW7WLHQ","created_at":"2026-07-27T00:19:47.550176+00:00"},{"alias_kind":"pith_short_8","alias_value":"XXJOVYPA","created_at":"2026-07-27T00:19:47.550176+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.14879","citing_title":"Temporal Fair Division in Multi-Agent Systems: From Precise Alternation Metrics to Scalable Coordination Proxies","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XXJOVYPA2GW7WLHQ5DFMQGCIDX","json":"https://pith.science/pith/XXJOVYPA2GW7WLHQ5DFMQGCIDX.json","graph_json":"https://pith.science/api/pith-number/XXJOVYPA2GW7WLHQ5DFMQGCIDX/graph.json","events_json":"https://pith.science/api/pith-number/XXJOVYPA2GW7WLHQ5DFMQGCIDX/events.json","paper":"https://pith.science/paper/XXJOVYPA"},"agent_actions":{"view_html":"https://pith.science/pith/XXJOVYPA2GW7WLHQ5DFMQGCIDX","download_json":"https://pith.science/pith/XXJOVYPA2GW7WLHQ5DFMQGCIDX.json","view_paper":"https://pith.science/paper/XXJOVYPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.05789&json=true","fetch_graph":"https://pith.science/api/pith-number/XXJOVYPA2GW7WLHQ5DFMQGCIDX/graph.json","fetch_events":"https://pith.science/api/pith-number/XXJOVYPA2GW7WLHQ5DFMQGCIDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XXJOVYPA2GW7WLHQ5DFMQGCIDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XXJOVYPA2GW7WLHQ5DFMQGCIDX/action/storage_attestation","attest_author":"https://pith.science/pith/XXJOVYPA2GW7WLHQ5DFMQGCIDX/action/author_attestation","sign_citation":"https://pith.science/pith/XXJOVYPA2GW7WLHQ5DFMQGCIDX/action/citation_signature","submit_replication":"https://pith.science/pith/XXJOVYPA2GW7WLHQ5DFMQGCIDX/action/replication_record"}},"created_at":"2026-07-27T00:19:47.550176+00:00","updated_at":"2026-07-27T00:19:47.550176+00:00"}