{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EY63J7EC5WFZDFYODE2KSZXMWG","short_pith_number":"pith:EY63J7EC","schema_version":"1.0","canonical_sha256":"263db4fc82ed8b91970e1934a966ecb1840ec9809aebfe8af46edfe5ca77ceae","source":{"kind":"arxiv","id":"1109.3927","version":1},"attestation_state":"computed","paper":{"title":"The Bondage Number of Mesh Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu, Jun-Ming Xu, Yong-Chang Cao","submitted_at":"2011-09-19T02:34:40Z","abstract_excerpt":"The bondage number $b(G)$ of a nonempty graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with domination number greater than that of $G$. Denote $P_n\\times P_m$ be the Cartesian product of two paths $P_n$ and $P_m$. This paper determines that the exact value of $b(P_n\\times P_2)$, $b(P_n\\times P_3)$ and $b(P_n\\times P_4)$ for $n\\ge 2$."},"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.3927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-19T02:34:40Z","cross_cats_sorted":[],"title_canon_sha256":"ab7662c4732454d42fa10356065a0065bc4b01b91e599d7c1f8cd8cbff2f021a","abstract_canon_sha256":"461c61754cf1149e31348466a4fd7f8ca2fb17b8f192f90253572b6acacc3cf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:45.576895Z","signature_b64":"Se/vQkhjowPuGoiY0tiIHGOvLlJNzGOQjwDw8y2D9FXTe993E1AKamKroyM4bH4y6MzPlKHjKmquNpmh6iNIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"263db4fc82ed8b91970e1934a966ecb1840ec9809aebfe8af46edfe5ca77ceae","last_reissued_at":"2026-05-18T04:12:45.576456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:45.576456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Bondage Number of Mesh Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu, Jun-Ming Xu, Yong-Chang Cao","submitted_at":"2011-09-19T02:34:40Z","abstract_excerpt":"The bondage number $b(G)$ of a nonempty graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with domination number greater than that of $G$. Denote $P_n\\times P_m$ be the Cartesian product of two paths $P_n$ and $P_m$. This paper determines that the exact value of $b(P_n\\times P_2)$, $b(P_n\\times P_3)$ and $b(P_n\\times P_4)$ for $n\\ge 2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3927","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.3927","created_at":"2026-05-18T04:12:45.576517+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3927v1","created_at":"2026-05-18T04:12:45.576517+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3927","created_at":"2026-05-18T04:12:45.576517+00:00"},{"alias_kind":"pith_short_12","alias_value":"EY63J7EC5WFZ","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EY63J7EC5WFZDFYO","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EY63J7EC","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/EY63J7EC5WFZDFYODE2KSZXMWG","json":"https://pith.science/pith/EY63J7EC5WFZDFYODE2KSZXMWG.json","graph_json":"https://pith.science/api/pith-number/EY63J7EC5WFZDFYODE2KSZXMWG/graph.json","events_json":"https://pith.science/api/pith-number/EY63J7EC5WFZDFYODE2KSZXMWG/events.json","paper":"https://pith.science/paper/EY63J7EC"},"agent_actions":{"view_html":"https://pith.science/pith/EY63J7EC5WFZDFYODE2KSZXMWG","download_json":"https://pith.science/pith/EY63J7EC5WFZDFYODE2KSZXMWG.json","view_paper":"https://pith.science/paper/EY63J7EC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3927&json=true","fetch_graph":"https://pith.science/api/pith-number/EY63J7EC5WFZDFYODE2KSZXMWG/graph.json","fetch_events":"https://pith.science/api/pith-number/EY63J7EC5WFZDFYODE2KSZXMWG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EY63J7EC5WFZDFYODE2KSZXMWG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EY63J7EC5WFZDFYODE2KSZXMWG/action/storage_attestation","attest_author":"https://pith.science/pith/EY63J7EC5WFZDFYODE2KSZXMWG/action/author_attestation","sign_citation":"https://pith.science/pith/EY63J7EC5WFZDFYODE2KSZXMWG/action/citation_signature","submit_replication":"https://pith.science/pith/EY63J7EC5WFZDFYODE2KSZXMWG/action/replication_record"}},"created_at":"2026-05-18T04:12:45.576517+00:00","updated_at":"2026-05-18T04:12:45.576517+00:00"}