{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DRT6B3ZJZ6TLZMEGW4MMQA2RCD","short_pith_number":"pith:DRT6B3ZJ","schema_version":"1.0","canonical_sha256":"1c67e0ef29cfa6bcb086b718c8035110f1c85b1eaa2f4c55682c228aa913e58a","source":{"kind":"arxiv","id":"1905.03835","version":1},"attestation_state":"computed","paper":{"title":"Bidding Mechanisms in Graph Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"{\\DJ}or{\\dj}e \\v{Z}ikeli\\'c, Guy Avni, Thomas A. Henzinger","submitted_at":"2019-05-09T19:58:42Z","abstract_excerpt":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner or payoff of the game. We study {\\em bidding games} in which the players bid for the right to move the token. Several bidding rules were studied previously. In {\\em Richman} bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. {\\em Poorman} bidding is similar except that the winner of the bidding pays the \"bank\" rather than the other player. {\\em Taxman} bidding spans the spectrum between Ric"},"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":"1905.03835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-05-09T19:58:42Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"64e2327f8896c02a8866e53e3284b3e0f3212bbbb6097080abf0aecd58c26a13","abstract_canon_sha256":"2db3ccf41cb874fa37c64acf8e8e0ac2b9fd7ff43b5556c82e38a668525d19bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:35.492600Z","signature_b64":"4zC8F2346wcKXJbqcmNgIhucn8v79NxRV7jvd6YlV5rOyS/Yu3HMhwSo44asc1CtjYVLGml28sxfhQPfw5GbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c67e0ef29cfa6bcb086b718c8035110f1c85b1eaa2f4c55682c228aa913e58a","last_reissued_at":"2026-05-17T23:46:35.491993Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:35.491993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bidding Mechanisms in Graph Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"{\\DJ}or{\\dj}e \\v{Z}ikeli\\'c, Guy Avni, Thomas A. Henzinger","submitted_at":"2019-05-09T19:58:42Z","abstract_excerpt":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner or payoff of the game. We study {\\em bidding games} in which the players bid for the right to move the token. Several bidding rules were studied previously. In {\\em Richman} bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. {\\em Poorman} bidding is similar except that the winner of the bidding pays the \"bank\" rather than the other player. {\\em Taxman} bidding spans the spectrum between Ric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03835","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":"1905.03835","created_at":"2026-05-17T23:46:35.492075+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03835v1","created_at":"2026-05-17T23:46:35.492075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03835","created_at":"2026-05-17T23:46:35.492075+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRT6B3ZJZ6TL","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRT6B3ZJZ6TLZMEG","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRT6B3ZJ","created_at":"2026-05-18T12:33:15.570797+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/DRT6B3ZJZ6TLZMEGW4MMQA2RCD","json":"https://pith.science/pith/DRT6B3ZJZ6TLZMEGW4MMQA2RCD.json","graph_json":"https://pith.science/api/pith-number/DRT6B3ZJZ6TLZMEGW4MMQA2RCD/graph.json","events_json":"https://pith.science/api/pith-number/DRT6B3ZJZ6TLZMEGW4MMQA2RCD/events.json","paper":"https://pith.science/paper/DRT6B3ZJ"},"agent_actions":{"view_html":"https://pith.science/pith/DRT6B3ZJZ6TLZMEGW4MMQA2RCD","download_json":"https://pith.science/pith/DRT6B3ZJZ6TLZMEGW4MMQA2RCD.json","view_paper":"https://pith.science/paper/DRT6B3ZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03835&json=true","fetch_graph":"https://pith.science/api/pith-number/DRT6B3ZJZ6TLZMEGW4MMQA2RCD/graph.json","fetch_events":"https://pith.science/api/pith-number/DRT6B3ZJZ6TLZMEGW4MMQA2RCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRT6B3ZJZ6TLZMEGW4MMQA2RCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRT6B3ZJZ6TLZMEGW4MMQA2RCD/action/storage_attestation","attest_author":"https://pith.science/pith/DRT6B3ZJZ6TLZMEGW4MMQA2RCD/action/author_attestation","sign_citation":"https://pith.science/pith/DRT6B3ZJZ6TLZMEGW4MMQA2RCD/action/citation_signature","submit_replication":"https://pith.science/pith/DRT6B3ZJZ6TLZMEGW4MMQA2RCD/action/replication_record"}},"created_at":"2026-05-17T23:46:35.492075+00:00","updated_at":"2026-05-17T23:46:35.492075+00:00"}