{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZAUKJOEBFSC4RCL3QX24SFFA3S","short_pith_number":"pith:ZAUKJOEB","schema_version":"1.0","canonical_sha256":"c828a4b8812c85c8897b85f5c914a0dc8ff577ce26f0b6161f57f0e6e0d3ee51","source":{"kind":"arxiv","id":"2507.08503","version":3},"attestation_state":"computed","paper":{"title":"Bounds on the game isolation number and exact values for paths and cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, Michael A. Henning, Sandi Klav\\v{z}ar, Tanja Dravec","submitted_at":"2025-07-11T11:24:46Z","abstract_excerpt":"The isolation game is played on a graph $G$ by two players who take turns playing a vertex such that if $X$ is the set of already played vertices, then a vertex can be selected only if it dominates a vertex from a nontrivial component of $G \\setminus N_G[X]$, where $N_G[X]$ is the set of vertices in $X$ or adjacent to a vertex in $X$. Dominator wishes to finish the game with the minimum number of played vertices, while Staller has the opposite goal. The game isolation number $\\iota_{\\rm g}(G)$ is the number of moves in the Dominator-start game where both players play optimally. If Staller star"},"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":"2507.08503","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-11T11:24:46Z","cross_cats_sorted":[],"title_canon_sha256":"890fac89e84936299caf2e2714bb01401a2d362351a2a3c09e87f0eabe41fc39","abstract_canon_sha256":"6145c3cf36136569c90d3beb06705ab84ed978f9d5358b7b7287b5e02c69b9a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:15.130788Z","signature_b64":"+Siv0f7rDXvCRa5Wc7tNG/XtxSx/FOFQlT4vSt+UtiAZAGSfpdrSX/zNoC0IvtWNGTb6Hguwc9WQJWsQK2SkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c828a4b8812c85c8897b85f5c914a0dc8ff577ce26f0b6161f57f0e6e0d3ee51","last_reissued_at":"2026-06-11T01:09:15.129698Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:15.129698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on the game isolation number and exact values for paths and cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, Michael A. Henning, Sandi Klav\\v{z}ar, Tanja Dravec","submitted_at":"2025-07-11T11:24:46Z","abstract_excerpt":"The isolation game is played on a graph $G$ by two players who take turns playing a vertex such that if $X$ is the set of already played vertices, then a vertex can be selected only if it dominates a vertex from a nontrivial component of $G \\setminus N_G[X]$, where $N_G[X]$ is the set of vertices in $X$ or adjacent to a vertex in $X$. Dominator wishes to finish the game with the minimum number of played vertices, while Staller has the opposite goal. The game isolation number $\\iota_{\\rm g}(G)$ is the number of moves in the Dominator-start game where both players play optimally. If Staller star"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.08503","kind":"arxiv","version":3},"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/2507.08503/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":"2507.08503","created_at":"2026-06-11T01:09:15.129833+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.08503v3","created_at":"2026-06-11T01:09:15.129833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.08503","created_at":"2026-06-11T01:09:15.129833+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAUKJOEBFSC4","created_at":"2026-06-11T01:09:15.129833+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAUKJOEBFSC4RCL3","created_at":"2026-06-11T01:09:15.129833+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAUKJOEB","created_at":"2026-06-11T01:09:15.129833+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/ZAUKJOEBFSC4RCL3QX24SFFA3S","json":"https://pith.science/pith/ZAUKJOEBFSC4RCL3QX24SFFA3S.json","graph_json":"https://pith.science/api/pith-number/ZAUKJOEBFSC4RCL3QX24SFFA3S/graph.json","events_json":"https://pith.science/api/pith-number/ZAUKJOEBFSC4RCL3QX24SFFA3S/events.json","paper":"https://pith.science/paper/ZAUKJOEB"},"agent_actions":{"view_html":"https://pith.science/pith/ZAUKJOEBFSC4RCL3QX24SFFA3S","download_json":"https://pith.science/pith/ZAUKJOEBFSC4RCL3QX24SFFA3S.json","view_paper":"https://pith.science/paper/ZAUKJOEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.08503&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAUKJOEBFSC4RCL3QX24SFFA3S/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAUKJOEBFSC4RCL3QX24SFFA3S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAUKJOEBFSC4RCL3QX24SFFA3S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAUKJOEBFSC4RCL3QX24SFFA3S/action/storage_attestation","attest_author":"https://pith.science/pith/ZAUKJOEBFSC4RCL3QX24SFFA3S/action/author_attestation","sign_citation":"https://pith.science/pith/ZAUKJOEBFSC4RCL3QX24SFFA3S/action/citation_signature","submit_replication":"https://pith.science/pith/ZAUKJOEBFSC4RCL3QX24SFFA3S/action/replication_record"}},"created_at":"2026-06-11T01:09:15.129833+00:00","updated_at":"2026-06-11T01:09:15.129833+00:00"}