{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RRYAGLVDDUVH7NIP5IIGUL2NDH","short_pith_number":"pith:RRYAGLVD","schema_version":"1.0","canonical_sha256":"8c70032ea31d2a7fb50fea106a2f4d19f6c90bce61d028ce74da31a9708bb079","source":{"kind":"arxiv","id":"1404.0843","version":1},"attestation_state":"computed","paper":{"title":"First Cycle Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LO","authors_text":"Benjamin Aminof (IST Austria), Sasha Rubin (IST Austria, TU Wien)","submitted_at":"2014-04-03T10:38:54Z","abstract_excerpt":"First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determined by some fixed property Y of the sequence of labels of the edges (or nodes) forming this cycle. These games are traditionally of interest because of their connection with infinite-duration games such as parity and mean-payoff games.\n  We study the memory requirements for winning strategies of FCGs and certain associated infinite duration games. We exhibit a simple FCG that is not memoryless determined (this correc"},"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":"1404.0843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-04-03T10:38:54Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"f2cdc5df8fec63c801d8263d5e0fbd539a3cdee31c122457012315fdf6022ef9","abstract_canon_sha256":"9708d08c824ba794c5f7742677be3891093f8384401003b37a17ee768bb3b192"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:55.302485Z","signature_b64":"gqnPXqKvLMa+WmOijJWuKAxI+Mm4fN8F+CYL5DA/sOOvKskfDhYKRIYjlmD1anXyUEkloHyHkx4jMPdVo6wUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c70032ea31d2a7fb50fea106a2f4d19f6c90bce61d028ce74da31a9708bb079","last_reissued_at":"2026-05-18T02:54:55.301968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:55.301968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First Cycle Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LO","authors_text":"Benjamin Aminof (IST Austria), Sasha Rubin (IST Austria, TU Wien)","submitted_at":"2014-04-03T10:38:54Z","abstract_excerpt":"First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determined by some fixed property Y of the sequence of labels of the edges (or nodes) forming this cycle. These games are traditionally of interest because of their connection with infinite-duration games such as parity and mean-payoff games.\n  We study the memory requirements for winning strategies of FCGs and certain associated infinite duration games. We exhibit a simple FCG that is not memoryless determined (this correc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0843","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":"1404.0843","created_at":"2026-05-18T02:54:55.302047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0843v1","created_at":"2026-05-18T02:54:55.302047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0843","created_at":"2026-05-18T02:54:55.302047+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRYAGLVDDUVH","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRYAGLVDDUVH7NIP","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRYAGLVD","created_at":"2026-05-18T12:28:46.137349+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/RRYAGLVDDUVH7NIP5IIGUL2NDH","json":"https://pith.science/pith/RRYAGLVDDUVH7NIP5IIGUL2NDH.json","graph_json":"https://pith.science/api/pith-number/RRYAGLVDDUVH7NIP5IIGUL2NDH/graph.json","events_json":"https://pith.science/api/pith-number/RRYAGLVDDUVH7NIP5IIGUL2NDH/events.json","paper":"https://pith.science/paper/RRYAGLVD"},"agent_actions":{"view_html":"https://pith.science/pith/RRYAGLVDDUVH7NIP5IIGUL2NDH","download_json":"https://pith.science/pith/RRYAGLVDDUVH7NIP5IIGUL2NDH.json","view_paper":"https://pith.science/paper/RRYAGLVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0843&json=true","fetch_graph":"https://pith.science/api/pith-number/RRYAGLVDDUVH7NIP5IIGUL2NDH/graph.json","fetch_events":"https://pith.science/api/pith-number/RRYAGLVDDUVH7NIP5IIGUL2NDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRYAGLVDDUVH7NIP5IIGUL2NDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRYAGLVDDUVH7NIP5IIGUL2NDH/action/storage_attestation","attest_author":"https://pith.science/pith/RRYAGLVDDUVH7NIP5IIGUL2NDH/action/author_attestation","sign_citation":"https://pith.science/pith/RRYAGLVDDUVH7NIP5IIGUL2NDH/action/citation_signature","submit_replication":"https://pith.science/pith/RRYAGLVDDUVH7NIP5IIGUL2NDH/action/replication_record"}},"created_at":"2026-05-18T02:54:55.302047+00:00","updated_at":"2026-05-18T02:54:55.302047+00:00"}