{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7I7H6EBWP32V3ULGLFAO4WXHVL","short_pith_number":"pith:7I7H6EBW","canonical_record":{"source":{"id":"2607.27456","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-29T20:45:06Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"00baf6cc0bfcab9d9ecd4e872eae2ba47f4e023edb48b9c54ac9345d927379ac","abstract_canon_sha256":"a5d1e59746b8a4f055ae928931c5ead8c354384f676b43947727a45d6218c695"},"schema_version":"1.0"},"canonical_sha256":"fa3e7f10367ef55dd1665940ee5ae7aafe4ad44c087b60ae7374fd8d776f039a","source":{"kind":"arxiv","id":"2607.27456","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27456","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27456v1","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27456","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"pith_short_12","alias_value":"7I7H6EBWP32V","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"pith_short_16","alias_value":"7I7H6EBWP32V3ULG","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"pith_short_8","alias_value":"7I7H6EBW","created_at":"2026-07-31T00:12:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7I7H6EBWP32V3ULGLFAO4WXHVL","target":"record","payload":{"canonical_record":{"source":{"id":"2607.27456","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-29T20:45:06Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"00baf6cc0bfcab9d9ecd4e872eae2ba47f4e023edb48b9c54ac9345d927379ac","abstract_canon_sha256":"a5d1e59746b8a4f055ae928931c5ead8c354384f676b43947727a45d6218c695"},"schema_version":"1.0"},"canonical_sha256":"fa3e7f10367ef55dd1665940ee5ae7aafe4ad44c087b60ae7374fd8d776f039a","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa3e7f10367ef55dd1665940ee5ae7aafe4ad44c087b60ae7374fd8d776f039a","last_reissued_at":"2026-07-31T00:12:13.173178Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T00:12:13.173178Z"},"source_kind":"arxiv","source_id":"2607.27456","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T00:12:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QiyqaFRCzUQwCaTGV+W0ZvaMKVOmSi7HgVkCcrJGxe7WaI9GeAvbd3zHEPTNgpOW6YiE1Brw3qHkTTNb/5SxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T12:16:47.949059Z"},"content_sha256":"96c99357131458b0edab157ed9fe512e401e727aacd48c783d15916b1f8c8812","schema_version":"1.0","event_id":"sha256:96c99357131458b0edab157ed9fe512e401e727aacd48c783d15916b1f8c8812"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7I7H6EBWP32V3ULGLFAO4WXHVL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Player Discrete-Bidding Games; Determinacy, Equilibria, and Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.GT","authors_text":"Fatima Murra, Guy Avni","submitted_at":"2026-07-29T20:45:06Z","abstract_excerpt":"Games on graphs constitute a fundamental model. Applications include reactive synthesis, which reduces to solving a zero-sum two-player game, and reasoning about multi-agent systems by modeling them as a multi-player game. We study a class of graph games called bidding games in which the players are allocated a budget, and in each turn, an auction determines which player moves the token. Two-player bidding games have been extensively studied. We study, for the first time, multi-player bidding games. We focus on discrete bidding, which imposes granularity restrictions on the players' budgets an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27456","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/2607.27456/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T00:12:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"We6Di7j38BrhNZywdMmK6186iTb73fe3cNXR+h8krphsyHFTQB/rEy5LhJttblrWY6mIcTt9RaPKfo4Gs7GbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T12:16:47.949662Z"},"content_sha256":"1397d4304cd3607625d0c9491e63dd93cd0362625ed8ff1de3aca1354d4b9801","schema_version":"1.0","event_id":"sha256:1397d4304cd3607625d0c9491e63dd93cd0362625ed8ff1de3aca1354d4b9801"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7I7H6EBWP32V3ULGLFAO4WXHVL/bundle.json","state_url":"https://pith.science/pith/7I7H6EBWP32V3ULGLFAO4WXHVL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7I7H6EBWP32V3ULGLFAO4WXHVL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T12:16:47Z","links":{"resolver":"https://pith.science/pith/7I7H6EBWP32V3ULGLFAO4WXHVL","bundle":"https://pith.science/pith/7I7H6EBWP32V3ULGLFAO4WXHVL/bundle.json","state":"https://pith.science/pith/7I7H6EBWP32V3ULGLFAO4WXHVL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7I7H6EBWP32V3ULGLFAO4WXHVL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7I7H6EBWP32V3ULGLFAO4WXHVL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a5d1e59746b8a4f055ae928931c5ead8c354384f676b43947727a45d6218c695","cross_cats_sorted":["cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-29T20:45:06Z","title_canon_sha256":"00baf6cc0bfcab9d9ecd4e872eae2ba47f4e023edb48b9c54ac9345d927379ac"},"schema_version":"1.0","source":{"id":"2607.27456","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27456","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27456v1","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27456","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"pith_short_12","alias_value":"7I7H6EBWP32V","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"pith_short_16","alias_value":"7I7H6EBWP32V3ULG","created_at":"2026-07-31T00:12:13Z"},{"alias_kind":"pith_short_8","alias_value":"7I7H6EBW","created_at":"2026-07-31T00:12:13Z"}],"graph_snapshots":[{"event_id":"sha256:1397d4304cd3607625d0c9491e63dd93cd0362625ed8ff1de3aca1354d4b9801","target":"graph","created_at":"2026-07-31T00:12:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.27456/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Games on graphs constitute a fundamental model. Applications include reactive synthesis, which reduces to solving a zero-sum two-player game, and reasoning about multi-agent systems by modeling them as a multi-player game. We study a class of graph games called bidding games in which the players are allocated a budget, and in each turn, an auction determines which player moves the token. Two-player bidding games have been extensively studied. We study, for the first time, multi-player bidding games. We focus on discrete bidding, which imposes granularity restrictions on the players' budgets an","authors_text":"Fatima Murra, Guy Avni","cross_cats":["cs.FL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-29T20:45:06Z","title":"Multi-Player Discrete-Bidding Games; Determinacy, Equilibria, and Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27456","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:96c99357131458b0edab157ed9fe512e401e727aacd48c783d15916b1f8c8812","target":"record","created_at":"2026-07-31T00:12:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a5d1e59746b8a4f055ae928931c5ead8c354384f676b43947727a45d6218c695","cross_cats_sorted":["cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-29T20:45:06Z","title_canon_sha256":"00baf6cc0bfcab9d9ecd4e872eae2ba47f4e023edb48b9c54ac9345d927379ac"},"schema_version":"1.0","source":{"id":"2607.27456","kind":"arxiv","version":1}},"canonical_sha256":"fa3e7f10367ef55dd1665940ee5ae7aafe4ad44c087b60ae7374fd8d776f039a","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa3e7f10367ef55dd1665940ee5ae7aafe4ad44c087b60ae7374fd8d776f039a","first_computed_at":"2026-07-31T00:12:13.173178Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T00:12:13.173178Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27456","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96c99357131458b0edab157ed9fe512e401e727aacd48c783d15916b1f8c8812","sha256:1397d4304cd3607625d0c9491e63dd93cd0362625ed8ff1de3aca1354d4b9801"],"state_sha256":"83b22cbd8ef6e4f7d72ccb6818538c3fc4f1dfaf202210c2ab95aeb72523d258"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rnS5/9IVC63L0BUakfypMHDAa2KizkEv7Jq7RBaygqhWIlLAxOzMKBFnpD1GL8ysJwYwcP6Sl54tOzVsG3bsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T12:16:47.958905Z","bundle_sha256":"6e593734bdea62c9913eae84edcfbdc9bc1f3bd15e069fad0d5c65cbeb9e8d96"}}