{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VKLVC3AEEFBZV7QU5QYISTUJZI","short_pith_number":"pith:VKLVC3AE","schema_version":"1.0","canonical_sha256":"aa97516c0421439afe14ec30894e89ca02ef06c933ce7c8dbb2c105116160c03","source":{"kind":"arxiv","id":"2605.19497","version":1},"attestation_state":"computed","paper":{"title":"On the disjunctive domination numbers of the torus grid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zhi Qiao","submitted_at":"2026-05-19T07:51:05Z","abstract_excerpt":"Let $\\Gamma=(V,E)$ be a graph. A disjunctive dominating set in $\\Gamma$ is a set $S\\subseteq V$ such that every vertex not in $S$ is adjacent to a vertex of $S$, or has at least two vertices in $S$ at distance $2$ from it.\n  The minimum cardinality of a disjunctive dominating set in $\\Gamma$ is called the disjunctive domination number of $\\Gamma$.\n  In this paper, we give bounds for the disjunctive domination numbers of the torus grid graphs $C_m\\Box C_n$, and determine the disjunctive domination numbers of $C_3\\Box C_n$ and $C_4\\Box C_n$."},"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":"2605.19497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T07:51:05Z","cross_cats_sorted":[],"title_canon_sha256":"7e2bebadccd3932d8cf8ca7517cacab51ea3e9fc46635ccce9dcb1316c2f1e80","abstract_canon_sha256":"a342ae6720a612a710c6b0b2c20507295e88caba89711b4c1a079d77ff44ad8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:48.686869Z","signature_b64":"iDu8X+x/PknLr3iRMTVqAjXqN9cE7rQoSdHDQ2WktAsuluTZOi2kFEN4JEfGMDLS+IGvx+hXKPkhVhTrhaEiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa97516c0421439afe14ec30894e89ca02ef06c933ce7c8dbb2c105116160c03","last_reissued_at":"2026-05-20T01:05:48.686129Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:48.686129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the disjunctive domination numbers of the torus grid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zhi Qiao","submitted_at":"2026-05-19T07:51:05Z","abstract_excerpt":"Let $\\Gamma=(V,E)$ be a graph. A disjunctive dominating set in $\\Gamma$ is a set $S\\subseteq V$ such that every vertex not in $S$ is adjacent to a vertex of $S$, or has at least two vertices in $S$ at distance $2$ from it.\n  The minimum cardinality of a disjunctive dominating set in $\\Gamma$ is called the disjunctive domination number of $\\Gamma$.\n  In this paper, we give bounds for the disjunctive domination numbers of the torus grid graphs $C_m\\Box C_n$, and determine the disjunctive domination numbers of $C_3\\Box C_n$ and $C_4\\Box C_n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19497","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/2605.19497/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":"2605.19497","created_at":"2026-05-20T01:05:48.686228+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19497v1","created_at":"2026-05-20T01:05:48.686228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19497","created_at":"2026-05-20T01:05:48.686228+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKLVC3AEEFBZ","created_at":"2026-05-20T01:05:48.686228+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKLVC3AEEFBZV7QU","created_at":"2026-05-20T01:05:48.686228+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKLVC3AE","created_at":"2026-05-20T01:05:48.686228+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/VKLVC3AEEFBZV7QU5QYISTUJZI","json":"https://pith.science/pith/VKLVC3AEEFBZV7QU5QYISTUJZI.json","graph_json":"https://pith.science/api/pith-number/VKLVC3AEEFBZV7QU5QYISTUJZI/graph.json","events_json":"https://pith.science/api/pith-number/VKLVC3AEEFBZV7QU5QYISTUJZI/events.json","paper":"https://pith.science/paper/VKLVC3AE"},"agent_actions":{"view_html":"https://pith.science/pith/VKLVC3AEEFBZV7QU5QYISTUJZI","download_json":"https://pith.science/pith/VKLVC3AEEFBZV7QU5QYISTUJZI.json","view_paper":"https://pith.science/paper/VKLVC3AE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19497&json=true","fetch_graph":"https://pith.science/api/pith-number/VKLVC3AEEFBZV7QU5QYISTUJZI/graph.json","fetch_events":"https://pith.science/api/pith-number/VKLVC3AEEFBZV7QU5QYISTUJZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKLVC3AEEFBZV7QU5QYISTUJZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKLVC3AEEFBZV7QU5QYISTUJZI/action/storage_attestation","attest_author":"https://pith.science/pith/VKLVC3AEEFBZV7QU5QYISTUJZI/action/author_attestation","sign_citation":"https://pith.science/pith/VKLVC3AEEFBZV7QU5QYISTUJZI/action/citation_signature","submit_replication":"https://pith.science/pith/VKLVC3AEEFBZV7QU5QYISTUJZI/action/replication_record"}},"created_at":"2026-05-20T01:05:48.686228+00:00","updated_at":"2026-05-20T01:05:48.686228+00:00"}