{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FXF4BAT6GD2PISZAI6SFS7JJYG","short_pith_number":"pith:FXF4BAT6","schema_version":"1.0","canonical_sha256":"2dcbc0827e30f4f44b2047a4597d29c18fc5057e67ce2aeb7e6a191791988b59","source":{"kind":"arxiv","id":"1102.5206","version":1},"attestation_state":"computed","paper":{"title":"The Domination Number of Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Daniel Gon\\c{c}alves, Michael Rao, St\\'ephan Thomass\\'e","submitted_at":"2011-02-25T10:39:00Z","abstract_excerpt":"In this paper, we conclude the calculation of the domination number of all $n\\times m$ grid graphs. Indeed, we prove Chang's conjecture saying that for every $16\\le n\\le m$, $\\gamma(G_{n,m})=\\lfloor\\frac{(n+2)(m+2)}{5}\\rfloor -4$."},"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":"1102.5206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-25T10:39:00Z","cross_cats_sorted":[],"title_canon_sha256":"964bcb941e12744f4c16e4677dfe14870d9b99c8792a72fc5f3d0bd60bb1885e","abstract_canon_sha256":"68d20e5144d5da76e46398c7570df4a0ffca3de57bfff0658af784e2120d4e9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:56.702705Z","signature_b64":"pYYuOfIpjz5TXonRhWX46x+wuJudf50KSt9KALl/ZTjF2/AJiRUKa/lWPqEgP2P7EwJCXTesbYKTMn4wZClhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dcbc0827e30f4f44b2047a4597d29c18fc5057e67ce2aeb7e6a191791988b59","last_reissued_at":"2026-05-18T03:01:56.702125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:56.702125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Domination Number of Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Daniel Gon\\c{c}alves, Michael Rao, St\\'ephan Thomass\\'e","submitted_at":"2011-02-25T10:39:00Z","abstract_excerpt":"In this paper, we conclude the calculation of the domination number of all $n\\times m$ grid graphs. Indeed, we prove Chang's conjecture saying that for every $16\\le n\\le m$, $\\gamma(G_{n,m})=\\lfloor\\frac{(n+2)(m+2)}{5}\\rfloor -4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5206","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":"1102.5206","created_at":"2026-05-18T03:01:56.702215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5206v1","created_at":"2026-05-18T03:01:56.702215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5206","created_at":"2026-05-18T03:01:56.702215+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXF4BAT6GD2P","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXF4BAT6GD2PISZA","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXF4BAT6","created_at":"2026-05-18T12:26:28.662955+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/FXF4BAT6GD2PISZAI6SFS7JJYG","json":"https://pith.science/pith/FXF4BAT6GD2PISZAI6SFS7JJYG.json","graph_json":"https://pith.science/api/pith-number/FXF4BAT6GD2PISZAI6SFS7JJYG/graph.json","events_json":"https://pith.science/api/pith-number/FXF4BAT6GD2PISZAI6SFS7JJYG/events.json","paper":"https://pith.science/paper/FXF4BAT6"},"agent_actions":{"view_html":"https://pith.science/pith/FXF4BAT6GD2PISZAI6SFS7JJYG","download_json":"https://pith.science/pith/FXF4BAT6GD2PISZAI6SFS7JJYG.json","view_paper":"https://pith.science/paper/FXF4BAT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5206&json=true","fetch_graph":"https://pith.science/api/pith-number/FXF4BAT6GD2PISZAI6SFS7JJYG/graph.json","fetch_events":"https://pith.science/api/pith-number/FXF4BAT6GD2PISZAI6SFS7JJYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXF4BAT6GD2PISZAI6SFS7JJYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXF4BAT6GD2PISZAI6SFS7JJYG/action/storage_attestation","attest_author":"https://pith.science/pith/FXF4BAT6GD2PISZAI6SFS7JJYG/action/author_attestation","sign_citation":"https://pith.science/pith/FXF4BAT6GD2PISZAI6SFS7JJYG/action/citation_signature","submit_replication":"https://pith.science/pith/FXF4BAT6GD2PISZAI6SFS7JJYG/action/replication_record"}},"created_at":"2026-05-18T03:01:56.702215+00:00","updated_at":"2026-05-18T03:01:56.702215+00:00"}