{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4CIYX7KUZ2ZVNLG32BECJXRHCZ","short_pith_number":"pith:4CIYX7KU","schema_version":"1.0","canonical_sha256":"e0918bfd54ceb356acdbd04824de2716508a59800a2ae76a0d9e97ea7933c75f","source":{"kind":"arxiv","id":"2606.06625","version":1},"attestation_state":"computed","paper":{"title":"N-Player Binary Games with Unidirectional Dependencies: Cycle Robustness and Induced Indifference","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.GT","authors_text":"Francisco Criado-Aldeanueva, Jose Maria Sanchez-Saez, Nana Odishelidze","submitted_at":"2026-06-04T18:21:07Z","abstract_excerpt":"The present study provides a closed-form characterisation of Nash equilibria in N-player binary games with unidirectional dependencies. While general network games are PPAD-complete, prior work has established that trees or paths admit polynomial-time solutions via dynamic programming. We provide a deterministic characterisation for the subclass of directed cycle graphical games, demonstrating that non-zero boundary incentives linearize the topology into a feed-forward propagation. Under this Robust Incentive Structure, resolution is achieved in O(N) time: strict dominance guarantees a unique "},"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":"2606.06625","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.GT","submitted_at":"2026-06-04T18:21:07Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"b01bf434e9454f4a698a0b9f475037c3e783e55460d274e41dbc6f71713ecd3c","abstract_canon_sha256":"aec4302aa703a859092fc519c2b0501d578cb66e386ca293a79b5eb9aed7753e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:19.659143Z","signature_b64":"Rw6tNMiM+zie9jzzVOV7CXNpcj9C70aRisraiDAOhu1WRYXiN31Q8tGatsHf72VZCJbCpRRXRcsEZXqjzOfABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0918bfd54ceb356acdbd04824de2716508a59800a2ae76a0d9e97ea7933c75f","last_reissued_at":"2026-06-08T01:04:19.658381Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:19.658381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"N-Player Binary Games with Unidirectional Dependencies: Cycle Robustness and Induced Indifference","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.GT","authors_text":"Francisco Criado-Aldeanueva, Jose Maria Sanchez-Saez, Nana Odishelidze","submitted_at":"2026-06-04T18:21:07Z","abstract_excerpt":"The present study provides a closed-form characterisation of Nash equilibria in N-player binary games with unidirectional dependencies. While general network games are PPAD-complete, prior work has established that trees or paths admit polynomial-time solutions via dynamic programming. We provide a deterministic characterisation for the subclass of directed cycle graphical games, demonstrating that non-zero boundary incentives linearize the topology into a feed-forward propagation. Under this Robust Incentive Structure, resolution is achieved in O(N) time: strict dominance guarantees a unique "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06625","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.06625/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":"2606.06625","created_at":"2026-06-08T01:04:19.658505+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.06625v1","created_at":"2026-06-08T01:04:19.658505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06625","created_at":"2026-06-08T01:04:19.658505+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CIYX7KUZ2ZV","created_at":"2026-06-08T01:04:19.658505+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CIYX7KUZ2ZVNLG3","created_at":"2026-06-08T01:04:19.658505+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CIYX7KU","created_at":"2026-06-08T01:04:19.658505+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/4CIYX7KUZ2ZVNLG32BECJXRHCZ","json":"https://pith.science/pith/4CIYX7KUZ2ZVNLG32BECJXRHCZ.json","graph_json":"https://pith.science/api/pith-number/4CIYX7KUZ2ZVNLG32BECJXRHCZ/graph.json","events_json":"https://pith.science/api/pith-number/4CIYX7KUZ2ZVNLG32BECJXRHCZ/events.json","paper":"https://pith.science/paper/4CIYX7KU"},"agent_actions":{"view_html":"https://pith.science/pith/4CIYX7KUZ2ZVNLG32BECJXRHCZ","download_json":"https://pith.science/pith/4CIYX7KUZ2ZVNLG32BECJXRHCZ.json","view_paper":"https://pith.science/paper/4CIYX7KU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.06625&json=true","fetch_graph":"https://pith.science/api/pith-number/4CIYX7KUZ2ZVNLG32BECJXRHCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4CIYX7KUZ2ZVNLG32BECJXRHCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CIYX7KUZ2ZVNLG32BECJXRHCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CIYX7KUZ2ZVNLG32BECJXRHCZ/action/storage_attestation","attest_author":"https://pith.science/pith/4CIYX7KUZ2ZVNLG32BECJXRHCZ/action/author_attestation","sign_citation":"https://pith.science/pith/4CIYX7KUZ2ZVNLG32BECJXRHCZ/action/citation_signature","submit_replication":"https://pith.science/pith/4CIYX7KUZ2ZVNLG32BECJXRHCZ/action/replication_record"}},"created_at":"2026-06-08T01:04:19.658505+00:00","updated_at":"2026-06-08T01:04:19.658505+00:00"}