{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EC6Z4CYKEMHVG37VSYATHGFFTR","short_pith_number":"pith:EC6Z4CYK","schema_version":"1.0","canonical_sha256":"20bd9e0b0a230f536ff596013398a59c4ac6a1c98bad8c678c4e6c4de07a064b","source":{"kind":"arxiv","id":"2507.09283","version":1},"attestation_state":"computed","paper":{"title":"m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Federico Cor\\`o, Giacomo Paesani, Neeldhara Misra, Saraswati G. Nanoti, Tiziana Calamoneri","submitted_at":"2025-07-12T13:43:19Z","abstract_excerpt":"We study the m-Eternal Domination problem, which is the following two-player game between a defender and an attacker on a graph: initially, the defender positions k guards on vertices of the graph; the game then proceeds in turns between the defender and the attacker, with the attacker selecting a vertex and the defender responding to the attack by moving a guard to the attacked vertex. The defender may move more than one guard on their turn, but guards can only move to neighboring vertices. The defender wins a game on a graph G with k guards if the defender has a strategy such that at every p"},"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.09283","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-07-12T13:43:19Z","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"title_canon_sha256":"71f6582445cc3623d2f37d4862662ca753063661afe3e213449a4d30707668f6","abstract_canon_sha256":"45bc09c5d8632c32aa7178504bf77c132a61cdb8ce407a835b968f20228939bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:06.740402Z","signature_b64":"jTgaGp4ZQDItCDjGacpMJY3xQ66vSeytWGW/Es7hLqzjy7j8l6yzGXmeGxf8RMboHMCiA43tZ+b3pm6zDI13AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20bd9e0b0a230f536ff596013398a59c4ac6a1c98bad8c678c4e6c4de07a064b","last_reissued_at":"2026-07-05T11:36:06.740027Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:06.740027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Federico Cor\\`o, Giacomo Paesani, Neeldhara Misra, Saraswati G. Nanoti, Tiziana Calamoneri","submitted_at":"2025-07-12T13:43:19Z","abstract_excerpt":"We study the m-Eternal Domination problem, which is the following two-player game between a defender and an attacker on a graph: initially, the defender positions k guards on vertices of the graph; the game then proceeds in turns between the defender and the attacker, with the attacker selecting a vertex and the defender responding to the attack by moving a guard to the attacked vertex. The defender may move more than one guard on their turn, but guards can only move to neighboring vertices. The defender wins a game on a graph G with k guards if the defender has a strategy such that at every p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09283","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/2507.09283/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.09283","created_at":"2026-07-05T11:36:06.740082+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.09283v1","created_at":"2026-07-05T11:36:06.740082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09283","created_at":"2026-07-05T11:36:06.740082+00:00"},{"alias_kind":"pith_short_12","alias_value":"EC6Z4CYKEMHV","created_at":"2026-07-05T11:36:06.740082+00:00"},{"alias_kind":"pith_short_16","alias_value":"EC6Z4CYKEMHVG37V","created_at":"2026-07-05T11:36:06.740082+00:00"},{"alias_kind":"pith_short_8","alias_value":"EC6Z4CYK","created_at":"2026-07-05T11:36:06.740082+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/EC6Z4CYKEMHVG37VSYATHGFFTR","json":"https://pith.science/pith/EC6Z4CYKEMHVG37VSYATHGFFTR.json","graph_json":"https://pith.science/api/pith-number/EC6Z4CYKEMHVG37VSYATHGFFTR/graph.json","events_json":"https://pith.science/api/pith-number/EC6Z4CYKEMHVG37VSYATHGFFTR/events.json","paper":"https://pith.science/paper/EC6Z4CYK"},"agent_actions":{"view_html":"https://pith.science/pith/EC6Z4CYKEMHVG37VSYATHGFFTR","download_json":"https://pith.science/pith/EC6Z4CYKEMHVG37VSYATHGFFTR.json","view_paper":"https://pith.science/paper/EC6Z4CYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.09283&json=true","fetch_graph":"https://pith.science/api/pith-number/EC6Z4CYKEMHVG37VSYATHGFFTR/graph.json","fetch_events":"https://pith.science/api/pith-number/EC6Z4CYKEMHVG37VSYATHGFFTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EC6Z4CYKEMHVG37VSYATHGFFTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EC6Z4CYKEMHVG37VSYATHGFFTR/action/storage_attestation","attest_author":"https://pith.science/pith/EC6Z4CYKEMHVG37VSYATHGFFTR/action/author_attestation","sign_citation":"https://pith.science/pith/EC6Z4CYKEMHVG37VSYATHGFFTR/action/citation_signature","submit_replication":"https://pith.science/pith/EC6Z4CYKEMHVG37VSYATHGFFTR/action/replication_record"}},"created_at":"2026-07-05T11:36:06.740082+00:00","updated_at":"2026-07-05T11:36:06.740082+00:00"}