{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DMCSZE3FGGKAF7THOY2GF4DGTF","short_pith_number":"pith:DMCSZE3F","schema_version":"1.0","canonical_sha256":"1b052c9365319402fe67763462f06699700208d24d2d8942cb36dc5cf6d9eb5a","source":{"kind":"arxiv","id":"2411.13206","version":1},"attestation_state":"computed","paper":{"title":"A Stopping Game on Zero-Sum Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Adrian Dumitrescu, Arsenii Sagdeev","submitted_at":"2024-11-20T11:08:42Z","abstract_excerpt":"We introduce and analyze a natural game formulated as follows. In this one-person game, the player is given a random permutation $A=(a_1,\\dots, a_n)$ of a multiset $M$ of $n$ reals that sum up to $0$, where each of the $n!$ permutation sequences is equally likely. The player only knows the value of $n$ beforehand. The elements of the sequence are revealed one by one and the player can stop the game at any time. Once the process stops, say, after the $i$th element is revealed, the player collects the amount $\\sum_{j=i+1}^{n} a_j$ as his/her payoff and the game is over (the payoff corresponds to"},"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":"2411.13206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-11-20T11:08:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e9373fb0140e52efbf476b50b0e0fc8371e4ee618aeeb019f3713b59b1b5d04f","abstract_canon_sha256":"f101cfcc3da34196d08f19557c14bf7faad3ca2e6f5a8a4e6071bf103e2481ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:09:13.884711Z","signature_b64":"rdDg1zEsKimFT6QEa74lPPME/C20CEUGVXP+cXnffD1mx/z1M8bMkCO2tAjaGP++6DfZfertn5w9Qg98TE2kCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b052c9365319402fe67763462f06699700208d24d2d8942cb36dc5cf6d9eb5a","last_reissued_at":"2026-06-10T01:09:13.883660Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:09:13.883660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Stopping Game on Zero-Sum Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Adrian Dumitrescu, Arsenii Sagdeev","submitted_at":"2024-11-20T11:08:42Z","abstract_excerpt":"We introduce and analyze a natural game formulated as follows. In this one-person game, the player is given a random permutation $A=(a_1,\\dots, a_n)$ of a multiset $M$ of $n$ reals that sum up to $0$, where each of the $n!$ permutation sequences is equally likely. The player only knows the value of $n$ beforehand. The elements of the sequence are revealed one by one and the player can stop the game at any time. Once the process stops, say, after the $i$th element is revealed, the player collects the amount $\\sum_{j=i+1}^{n} a_j$ as his/her payoff and the game is over (the payoff corresponds to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13206","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/2411.13206/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":"2411.13206","created_at":"2026-06-10T01:09:13.883788+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13206v1","created_at":"2026-06-10T01:09:13.883788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13206","created_at":"2026-06-10T01:09:13.883788+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMCSZE3FGGKA","created_at":"2026-06-10T01:09:13.883788+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMCSZE3FGGKAF7TH","created_at":"2026-06-10T01:09:13.883788+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMCSZE3F","created_at":"2026-06-10T01:09:13.883788+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/DMCSZE3FGGKAF7THOY2GF4DGTF","json":"https://pith.science/pith/DMCSZE3FGGKAF7THOY2GF4DGTF.json","graph_json":"https://pith.science/api/pith-number/DMCSZE3FGGKAF7THOY2GF4DGTF/graph.json","events_json":"https://pith.science/api/pith-number/DMCSZE3FGGKAF7THOY2GF4DGTF/events.json","paper":"https://pith.science/paper/DMCSZE3F"},"agent_actions":{"view_html":"https://pith.science/pith/DMCSZE3FGGKAF7THOY2GF4DGTF","download_json":"https://pith.science/pith/DMCSZE3FGGKAF7THOY2GF4DGTF.json","view_paper":"https://pith.science/paper/DMCSZE3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13206&json=true","fetch_graph":"https://pith.science/api/pith-number/DMCSZE3FGGKAF7THOY2GF4DGTF/graph.json","fetch_events":"https://pith.science/api/pith-number/DMCSZE3FGGKAF7THOY2GF4DGTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMCSZE3FGGKAF7THOY2GF4DGTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMCSZE3FGGKAF7THOY2GF4DGTF/action/storage_attestation","attest_author":"https://pith.science/pith/DMCSZE3FGGKAF7THOY2GF4DGTF/action/author_attestation","sign_citation":"https://pith.science/pith/DMCSZE3FGGKAF7THOY2GF4DGTF/action/citation_signature","submit_replication":"https://pith.science/pith/DMCSZE3FGGKAF7THOY2GF4DGTF/action/replication_record"}},"created_at":"2026-06-10T01:09:13.883788+00:00","updated_at":"2026-06-10T01:09:13.883788+00:00"}