{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:77OB7HK6YVMVPDKVSJ7LN5GUST","short_pith_number":"pith:77OB7HK6","canonical_record":{"source":{"id":"1109.2174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-09T23:28:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c7364d4f828397706d8587dc3d16979d02f846392f7bdca1094b44bb30ccd36d","abstract_canon_sha256":"1a98b101a7f77c3f5a0785db9aaf6d98f75146e2eaeb1d1e81d606f3e6539772"},"schema_version":"1.0"},"canonical_sha256":"ffdc1f9d5ec559578d55927eb6f4d494ef33bf58a33859b9d1157ededec62af4","source":{"kind":"arxiv","id":"1109.2174","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2174","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2174v1","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2174","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"77OB7HK6YVMV","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"77OB7HK6YVMVPDKV","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"77OB7HK6","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:77OB7HK6YVMVPDKVSJ7LN5GUST","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-09T23:28:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c7364d4f828397706d8587dc3d16979d02f846392f7bdca1094b44bb30ccd36d","abstract_canon_sha256":"1a98b101a7f77c3f5a0785db9aaf6d98f75146e2eaeb1d1e81d606f3e6539772"},"schema_version":"1.0"},"canonical_sha256":"ffdc1f9d5ec559578d55927eb6f4d494ef33bf58a33859b9d1157ededec62af4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:38.361541Z","signature_b64":"wTwvwtGr4rDJjYRKNhHyo915ivrkI7ZDBG1uFVe83TQbzOHZAwjbpW6qg0egUBI+A1Dg1ZWR8Jv9/a3go07kBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffdc1f9d5ec559578d55927eb6f4d494ef33bf58a33859b9d1157ededec62af4","last_reissued_at":"2026-05-18T04:13:38.360994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:38.360994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2174","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:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sJwRI/rUJ0VNKXOcTIPIMXxZMIil7BgIx26QFZhZu30z8vIIK0Me/qca0g4Ed6Tlr3DD8XLiXbmPN/alAMswCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:21:06.630342Z"},"content_sha256":"e6c47acc21f3b6688328bf5975cfe0e50f983233a7f215eaa9d9d52302643e81","schema_version":"1.0","event_id":"sha256:e6c47acc21f3b6688328bf5975cfe0e50f983233a7f215eaa9d9d52302643e81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:77OB7HK6YVMVPDKVSJ7LN5GUST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on Total and Paired Domination of Cartesian Product Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"I.V. Hicks, K. Choudhary, S. Margulies","submitted_at":"2011-09-09T23:28:34Z","abstract_excerpt":"A dominating set $D$ for a graph $G$ is a subset of $V(G)$ such that any vertex not in $D$ has at least one neighbor in $D$. The domination number $\\gamma(G)$ is the size of a minimum dominating set in $G$. Vizing's conjecture from 1968 states that for the Cartesian product of graphs $G$ and $H$, $\\gamma(G) \\gamma(H) \\leq \\gamma(G \\Box H)$, and Clark and Suen (2000) proved that $\\gamma(G) \\gamma(H) \\leq 2\\gamma(G \\Box H)$. In this paper, we modify the approach of Clark and Suen to prove a variety of similar bounds related to total and paired domination, and also extend these bounds to the $n$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2174","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:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AOoXR9gYgCHWghrY6zRMh8U7LWvUKWDewVrk/l62XFSYRG0s6YV6OMKrLURuzlPv34MZ5QGfyhY4vtTvbN7qCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:21:06.630692Z"},"content_sha256":"ec30047a095c9507cf10668c1af3b93714312102dd9f2f3376c033a4182d1f89","schema_version":"1.0","event_id":"sha256:ec30047a095c9507cf10668c1af3b93714312102dd9f2f3376c033a4182d1f89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/77OB7HK6YVMVPDKVSJ7LN5GUST/bundle.json","state_url":"https://pith.science/pith/77OB7HK6YVMVPDKVSJ7LN5GUST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/77OB7HK6YVMVPDKVSJ7LN5GUST/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-20T20:21:06Z","links":{"resolver":"https://pith.science/pith/77OB7HK6YVMVPDKVSJ7LN5GUST","bundle":"https://pith.science/pith/77OB7HK6YVMVPDKVSJ7LN5GUST/bundle.json","state":"https://pith.science/pith/77OB7HK6YVMVPDKVSJ7LN5GUST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/77OB7HK6YVMVPDKVSJ7LN5GUST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:77OB7HK6YVMVPDKVSJ7LN5GUST","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":"1a98b101a7f77c3f5a0785db9aaf6d98f75146e2eaeb1d1e81d606f3e6539772","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-09T23:28:34Z","title_canon_sha256":"c7364d4f828397706d8587dc3d16979d02f846392f7bdca1094b44bb30ccd36d"},"schema_version":"1.0","source":{"id":"1109.2174","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2174","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2174v1","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2174","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"77OB7HK6YVMV","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"77OB7HK6YVMVPDKV","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"77OB7HK6","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:ec30047a095c9507cf10668c1af3b93714312102dd9f2f3376c033a4182d1f89","target":"graph","created_at":"2026-05-18T04:13:38Z","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":"A dominating set $D$ for a graph $G$ is a subset of $V(G)$ such that any vertex not in $D$ has at least one neighbor in $D$. The domination number $\\gamma(G)$ is the size of a minimum dominating set in $G$. Vizing's conjecture from 1968 states that for the Cartesian product of graphs $G$ and $H$, $\\gamma(G) \\gamma(H) \\leq \\gamma(G \\Box H)$, and Clark and Suen (2000) proved that $\\gamma(G) \\gamma(H) \\leq 2\\gamma(G \\Box H)$. In this paper, we modify the approach of Clark and Suen to prove a variety of similar bounds related to total and paired domination, and also extend these bounds to the $n$-","authors_text":"I.V. Hicks, K. Choudhary, S. Margulies","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-09T23:28:34Z","title":"A Note on Total and Paired Domination of Cartesian Product Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2174","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:e6c47acc21f3b6688328bf5975cfe0e50f983233a7f215eaa9d9d52302643e81","target":"record","created_at":"2026-05-18T04:13:38Z","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":"1a98b101a7f77c3f5a0785db9aaf6d98f75146e2eaeb1d1e81d606f3e6539772","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-09T23:28:34Z","title_canon_sha256":"c7364d4f828397706d8587dc3d16979d02f846392f7bdca1094b44bb30ccd36d"},"schema_version":"1.0","source":{"id":"1109.2174","kind":"arxiv","version":1}},"canonical_sha256":"ffdc1f9d5ec559578d55927eb6f4d494ef33bf58a33859b9d1157ededec62af4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffdc1f9d5ec559578d55927eb6f4d494ef33bf58a33859b9d1157ededec62af4","first_computed_at":"2026-05-18T04:13:38.360994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:38.360994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wTwvwtGr4rDJjYRKNhHyo915ivrkI7ZDBG1uFVe83TQbzOHZAwjbpW6qg0egUBI+A1Dg1ZWR8Jv9/a3go07kBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:38.361541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2174","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6c47acc21f3b6688328bf5975cfe0e50f983233a7f215eaa9d9d52302643e81","sha256:ec30047a095c9507cf10668c1af3b93714312102dd9f2f3376c033a4182d1f89"],"state_sha256":"36add9954e6bd17bd59d822a12c32f53e62fe020dab401450e636518d3601aef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QEttyhgFX6UGpFAOoeHpBAHITQLIT7yxIryL9B8/gzR0WWGpKesgLnETCjbEXrSriy5mThqja0r7wc+lDnrDAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T20:21:06.632615Z","bundle_sha256":"cf16744eef391c1ffbcedc098ccb1f6a27630fbee83513a96fbed91cdac285ea"}}