{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:G3WAN65AFIEG2DGBUGPCS6H2BT","short_pith_number":"pith:G3WAN65A","schema_version":"1.0","canonical_sha256":"36ec06fba02a086d0cc1a19e2978fa0ce33af1be648147242b4736fd81976aaf","source":{"kind":"arxiv","id":"2109.14669","version":1},"attestation_state":"computed","paper":{"title":"Pursuit-evasion games on latin square graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alice Huang, Anthony Bonato, Leanna Gittins, Shreya Ahirwar, Tomer Zaidman, Trent G. Marbach","submitted_at":"2021-09-29T19:05:16Z","abstract_excerpt":"We investigate various pursuit-evasion parameters on latin square graphs, including the cop number, metric dimension, and localization number. The cop number of latin square graphs is studied, and for $k$-MOLS$(n),$ bounds for the cop number are given. If $n>(k+1)^2,$ then the cop number is shown to be $k+2.$ Lower and upper bounds are provided for the metric dimension and localization number of latin square graphs. The metric dimension of back-circulant latin squares shows that the lower bound is close to tight. Recent results on covers and partial transversals of latin squares provide the up"},"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":"2109.14669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-29T19:05:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6d596311aa00e4732621f5c50f553d5c9a25dc9a6b72c19df98622cb860c6289","abstract_canon_sha256":"e7eae068c385a50a32580c94d473cc3c53396691cd955bc7c66341fdfe691c7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:18:43.103427Z","signature_b64":"DRGhctAIppsv0BB3jXEWFr+gyRSQyVRo097SqxxGOoHApIOgjtzcWkSEwp9Zu4XwKHkUa+qF0Gh4MjZYTAC0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36ec06fba02a086d0cc1a19e2978fa0ce33af1be648147242b4736fd81976aaf","last_reissued_at":"2026-07-05T03:18:43.102917Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:18:43.102917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pursuit-evasion games on latin square graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alice Huang, Anthony Bonato, Leanna Gittins, Shreya Ahirwar, Tomer Zaidman, Trent G. Marbach","submitted_at":"2021-09-29T19:05:16Z","abstract_excerpt":"We investigate various pursuit-evasion parameters on latin square graphs, including the cop number, metric dimension, and localization number. The cop number of latin square graphs is studied, and for $k$-MOLS$(n),$ bounds for the cop number are given. If $n>(k+1)^2,$ then the cop number is shown to be $k+2.$ Lower and upper bounds are provided for the metric dimension and localization number of latin square graphs. The metric dimension of back-circulant latin squares shows that the lower bound is close to tight. Recent results on covers and partial transversals of latin squares provide the up"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.14669","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/2109.14669/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":"2109.14669","created_at":"2026-07-05T03:18:43.102978+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.14669v1","created_at":"2026-07-05T03:18:43.102978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.14669","created_at":"2026-07-05T03:18:43.102978+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3WAN65AFIEG","created_at":"2026-07-05T03:18:43.102978+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3WAN65AFIEG2DGB","created_at":"2026-07-05T03:18:43.102978+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3WAN65A","created_at":"2026-07-05T03:18:43.102978+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/G3WAN65AFIEG2DGBUGPCS6H2BT","json":"https://pith.science/pith/G3WAN65AFIEG2DGBUGPCS6H2BT.json","graph_json":"https://pith.science/api/pith-number/G3WAN65AFIEG2DGBUGPCS6H2BT/graph.json","events_json":"https://pith.science/api/pith-number/G3WAN65AFIEG2DGBUGPCS6H2BT/events.json","paper":"https://pith.science/paper/G3WAN65A"},"agent_actions":{"view_html":"https://pith.science/pith/G3WAN65AFIEG2DGBUGPCS6H2BT","download_json":"https://pith.science/pith/G3WAN65AFIEG2DGBUGPCS6H2BT.json","view_paper":"https://pith.science/paper/G3WAN65A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.14669&json=true","fetch_graph":"https://pith.science/api/pith-number/G3WAN65AFIEG2DGBUGPCS6H2BT/graph.json","fetch_events":"https://pith.science/api/pith-number/G3WAN65AFIEG2DGBUGPCS6H2BT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3WAN65AFIEG2DGBUGPCS6H2BT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3WAN65AFIEG2DGBUGPCS6H2BT/action/storage_attestation","attest_author":"https://pith.science/pith/G3WAN65AFIEG2DGBUGPCS6H2BT/action/author_attestation","sign_citation":"https://pith.science/pith/G3WAN65AFIEG2DGBUGPCS6H2BT/action/citation_signature","submit_replication":"https://pith.science/pith/G3WAN65AFIEG2DGBUGPCS6H2BT/action/replication_record"}},"created_at":"2026-07-05T03:18:43.102978+00:00","updated_at":"2026-07-05T03:18:43.102978+00:00"}