{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2VY7BYT3O4H6BX7LSEMWL2ZALI","short_pith_number":"pith:2VY7BYT3","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"},"canonical_sha256":"d571f0e27b770fe0dfeb911965eb205a18a6b1153fe416e00c6666cd7624f896","source":{"kind":"arxiv","id":"1109.3929","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3929","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3929v1","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3929","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"pith_short_12","alias_value":"2VY7BYT3O4H6","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2VY7BYT3O4H6BX7L","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2VY7BYT3","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2VY7BYT3O4H6BX7LSEMWL2ZALI","target":"record","payload":{"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"},"canonical_sha256":"d571f0e27b770fe0dfeb911965eb205a18a6b1153fe416e00c6666cd7624f896","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"},"source_kind":"arxiv","source_id":"1109.3929","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:12:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Yyj4MwtUGLzSL+xtv0yH3Hv0T0P4IEbJorT64qOwOr4bTbBauKKJp1BFw3ygUw97lYS6ZHkor1oW0EHKc1lAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:50:41.709433Z"},"content_sha256":"4d3ba929fb2cc8229268aba9c7a510cef2ee19efd28ee993f3b7ec6d9a266ca5","schema_version":"1.0","event_id":"sha256:4d3ba929fb2cc8229268aba9c7a510cef2ee19efd28ee993f3b7ec6d9a266ca5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2VY7BYT3O4H6BX7LSEMWL2ZALI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:12:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bThTCEubt4NSzkrBO3/EtskrrdnCauiC/Yh0Hwz44vTh1B61CIyhkoC8FZTiVhESA4hnoYQvSlIzyq3W/RYfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:50:41.709789Z"},"content_sha256":"bdaaaf1708cc0ff9b3ceda9b9c1ca557bcc35d592cdd84bf1c40150fa4957dc6","schema_version":"1.0","event_id":"sha256:bdaaaf1708cc0ff9b3ceda9b9c1ca557bcc35d592cdd84bf1c40150fa4957dc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2VY7BYT3O4H6BX7LSEMWL2ZALI/bundle.json","state_url":"https://pith.science/pith/2VY7BYT3O4H6BX7LSEMWL2ZALI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2VY7BYT3O4H6BX7LSEMWL2ZALI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T01:50:41Z","links":{"resolver":"https://pith.science/pith/2VY7BYT3O4H6BX7LSEMWL2ZALI","bundle":"https://pith.science/pith/2VY7BYT3O4H6BX7LSEMWL2ZALI/bundle.json","state":"https://pith.science/pith/2VY7BYT3O4H6BX7LSEMWL2ZALI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2VY7BYT3O4H6BX7LSEMWL2ZALI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2VY7BYT3O4H6BX7LSEMWL2ZALI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a01e7434c99d75f0a80cf9dd1ab8b931ea08e863e4bba85c46ba0cfa560928e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-19T02:45:09Z","title_canon_sha256":"00f9a6131f4f3ca8a53ccf2df84b80be8fb3d078f07d204e1a2a319fd50f7aa4"},"schema_version":"1.0","source":{"id":"1109.3929","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3929","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3929v1","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3929","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"pith_short_12","alias_value":"2VY7BYT3O4H6","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2VY7BYT3O4H6BX7L","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2VY7BYT3","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:bdaaaf1708cc0ff9b3ceda9b9c1ca557bcc35d592cdd84bf1c40150fa4957dc6","target":"graph","created_at":"2026-05-18T04:12:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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})$.","authors_text":"Fu-Tao Hu, Jun-Ming Xu, You Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-19T02:45:09Z","title":"The total bondage number of grid graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3929","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4d3ba929fb2cc8229268aba9c7a510cef2ee19efd28ee993f3b7ec6d9a266ca5","target":"record","created_at":"2026-05-18T04:12:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a01e7434c99d75f0a80cf9dd1ab8b931ea08e863e4bba85c46ba0cfa560928e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-19T02:45:09Z","title_canon_sha256":"00f9a6131f4f3ca8a53ccf2df84b80be8fb3d078f07d204e1a2a319fd50f7aa4"},"schema_version":"1.0","source":{"id":"1109.3929","kind":"arxiv","version":1}},"canonical_sha256":"d571f0e27b770fe0dfeb911965eb205a18a6b1153fe416e00c6666cd7624f896","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d571f0e27b770fe0dfeb911965eb205a18a6b1153fe416e00c6666cd7624f896","first_computed_at":"2026-05-18T04:12:45.563538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:45.563538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hiOjqUWX57n18rELJFIqBWxTBmSDLMZ+mDV9cSoLDOps/0E7Wqh6PGHY4C1FChaq2hYVs6Hc/I5+4u5P2LPxBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:45.564168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3929","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d3ba929fb2cc8229268aba9c7a510cef2ee19efd28ee993f3b7ec6d9a266ca5","sha256:bdaaaf1708cc0ff9b3ceda9b9c1ca557bcc35d592cdd84bf1c40150fa4957dc6"],"state_sha256":"b7e3b21a5cf6db9974f3fb69ee28482daddd851d03f635d7cab7f9c553cc1616"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1UcbKm2OkGaSairYHcuH50FIBgXFFE2hEf/yN0a3wwNrC6yJBjnTEx52NbU3zrSAHI7wrKIQxPiZLnwXHNi8Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T01:50:41.711808Z","bundle_sha256":"4d34269273ba5e6ba4fee55038f16b9fae2cfeb5e2e93cfa66eb68ebe9538157"}}