{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2VY7BYT3O4H6BX7LSEMWL2ZALI","short_pith_number":"pith:2VY7BYT3","schema_version":"1.0","canonical_sha256":"d571f0e27b770fe0dfeb911965eb205a18a6b1153fe416e00c6666cd7624f896","source":{"kind":"arxiv","id":"1109.3929","version":1},"attestation_state":"computed","paper":{"title":"The total bondage number of grid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu, Jun-Ming Xu, You Lu","submitted_at":"2011-09-19T02:45:09Z","abstract_excerpt":"The total domination number of a graph $G$ without isolated vertices is the minimum number of vertices that dominate all vertices in $G$. The total bondage number $b_t(G)$ of $G$ is the minimum number of edges whose removal enlarges the total domination number. This paper considers grid graphs. An $(n,m)$-grid graph $G_{n,m}$ is defined as the cartesian product of two paths $P_n$ and $P_m$. This paper determines the exact values of $b_t(G_{n,2})$ and $b_t(G_{n,3})$, and establishes some upper bounds of $b_t(G_{n,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":"1109.3929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-19T02:45:09Z","cross_cats_sorted":[],"title_canon_sha256":"00f9a6131f4f3ca8a53ccf2df84b80be8fb3d078f07d204e1a2a319fd50f7aa4","abstract_canon_sha256":"a01e7434c99d75f0a80cf9dd1ab8b931ea08e863e4bba85c46ba0cfa560928e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:45.564168Z","signature_b64":"hiOjqUWX57n18rELJFIqBWxTBmSDLMZ+mDV9cSoLDOps/0E7Wqh6PGHY4C1FChaq2hYVs6Hc/I5+4u5P2LPxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d571f0e27b770fe0dfeb911965eb205a18a6b1153fe416e00c6666cd7624f896","last_reissued_at":"2026-05-18T04:12:45.563538Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:45.563538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The total bondage number of grid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu, Jun-Ming Xu, You Lu","submitted_at":"2011-09-19T02:45:09Z","abstract_excerpt":"The total domination number of a graph $G$ without isolated vertices is the minimum number of vertices that dominate all vertices in $G$. The total bondage number $b_t(G)$ of $G$ is the minimum number of edges whose removal enlarges the total domination number. This paper considers grid graphs. An $(n,m)$-grid graph $G_{n,m}$ is defined as the cartesian product of two paths $P_n$ and $P_m$. This paper determines the exact values of $b_t(G_{n,2})$ and $b_t(G_{n,3})$, and establishes some upper bounds of $b_t(G_{n,4})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3929","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":"1109.3929","created_at":"2026-05-18T04:12:45.563634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3929v1","created_at":"2026-05-18T04:12:45.563634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3929","created_at":"2026-05-18T04:12:45.563634+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VY7BYT3O4H6","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VY7BYT3O4H6BX7L","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VY7BYT3","created_at":"2026-05-18T12:26:18.847500+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/2VY7BYT3O4H6BX7LSEMWL2ZALI","json":"https://pith.science/pith/2VY7BYT3O4H6BX7LSEMWL2ZALI.json","graph_json":"https://pith.science/api/pith-number/2VY7BYT3O4H6BX7LSEMWL2ZALI/graph.json","events_json":"https://pith.science/api/pith-number/2VY7BYT3O4H6BX7LSEMWL2ZALI/events.json","paper":"https://pith.science/paper/2VY7BYT3"},"agent_actions":{"view_html":"https://pith.science/pith/2VY7BYT3O4H6BX7LSEMWL2ZALI","download_json":"https://pith.science/pith/2VY7BYT3O4H6BX7LSEMWL2ZALI.json","view_paper":"https://pith.science/paper/2VY7BYT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3929&json=true","fetch_graph":"https://pith.science/api/pith-number/2VY7BYT3O4H6BX7LSEMWL2ZALI/graph.json","fetch_events":"https://pith.science/api/pith-number/2VY7BYT3O4H6BX7LSEMWL2ZALI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VY7BYT3O4H6BX7LSEMWL2ZALI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VY7BYT3O4H6BX7LSEMWL2ZALI/action/storage_attestation","attest_author":"https://pith.science/pith/2VY7BYT3O4H6BX7LSEMWL2ZALI/action/author_attestation","sign_citation":"https://pith.science/pith/2VY7BYT3O4H6BX7LSEMWL2ZALI/action/citation_signature","submit_replication":"https://pith.science/pith/2VY7BYT3O4H6BX7LSEMWL2ZALI/action/replication_record"}},"created_at":"2026-05-18T04:12:45.563634+00:00","updated_at":"2026-05-18T04:12:45.563634+00:00"}