{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4EHXYUSZRKCO4GP23NIFLSRXCH","short_pith_number":"pith:4EHXYUSZ","canonical_record":{"source":{"id":"1209.1842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-09T21:37:30Z","cross_cats_sorted":[],"title_canon_sha256":"1837c10dc77ea564786d8514abdf606bda76f7602692deb3d548a52860a1e0b1","abstract_canon_sha256":"85bcddbec55c8e97a76ac60883ebebfced9cb9e54cff32488d8f9ac0c316d3c9"},"schema_version":"1.0"},"canonical_sha256":"e10f7c52598a84ee19fadb5055ca3711fc44581d41273b317ef9f5196379d0e5","source":{"kind":"arxiv","id":"1209.1842","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1842","created_at":"2026-05-18T03:45:54Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1842v1","created_at":"2026-05-18T03:45:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1842","created_at":"2026-05-18T03:45:54Z"},{"alias_kind":"pith_short_12","alias_value":"4EHXYUSZRKCO","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4EHXYUSZRKCO4GP2","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4EHXYUSZ","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4EHXYUSZRKCO4GP23NIFLSRXCH","target":"record","payload":{"canonical_record":{"source":{"id":"1209.1842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-09T21:37:30Z","cross_cats_sorted":[],"title_canon_sha256":"1837c10dc77ea564786d8514abdf606bda76f7602692deb3d548a52860a1e0b1","abstract_canon_sha256":"85bcddbec55c8e97a76ac60883ebebfced9cb9e54cff32488d8f9ac0c316d3c9"},"schema_version":"1.0"},"canonical_sha256":"e10f7c52598a84ee19fadb5055ca3711fc44581d41273b317ef9f5196379d0e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:54.200845Z","signature_b64":"FPB9z0FuUYOIMcAW1D8QCuZm+MebQ0B4FM7Mwm0WrH2958k0ydjsm2OETZeZM+oE3aQ957+k8ISDHwUsDVF3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e10f7c52598a84ee19fadb5055ca3711fc44581d41273b317ef9f5196379d0e5","last_reissued_at":"2026-05-18T03:45:54.200387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:54.200387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.1842","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-18T03:45:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23Puo8UVv1KJa/s585fe0Mc/Y25THusLZDDGppVSqCRCzhO+FHtF4H/qCxRtZw5gP+i66ZJU1ZnKlyqVb/0TCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T06:11:39.699416Z"},"content_sha256":"59eda0a12a233b9439f59a69842fe40afe43ae96919e6e0f107f53893449cc90","schema_version":"1.0","event_id":"sha256:59eda0a12a233b9439f59a69842fe40afe43ae96919e6e0f107f53893449cc90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4EHXYUSZRKCO4GP23NIFLSRXCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on Integer Domination of Cartesian Product Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"I. V. Hicks, K. Choudhary, S. Margulies","submitted_at":"2012-09-09T21:37:30Z","abstract_excerpt":"Given a graph $G$, a dominating set $D$ is a set of vertices such that any vertex in $G$ has at least one neighbor (or possibly itself) in $D$. A ${k}$-dominating multiset $D_k$ is a multiset of vertices such that any vertex in $G$ has at least $k$ vertices from its closed neighborhood in $D_k$ when counted with multiplicity. In this paper, we utilize the approach developed by Clark and Suen (2000) and properties of binary matrices to prove a \"Vizing-like\" inequality on minimum ${k}$-dominating multisets of graphs $G,H$ and the Cartesian product graph $G \\Box H$. Specifically, denoting the siz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1842","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-18T03:45:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"whejDw0eO1QSUvfM/9e45VTjtzpFdelblFSG8XvFbX8Od5cg2a3NKVFyV6eJ2BfWpQV//8eTAvaY1X6J39u0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T06:11:39.699765Z"},"content_sha256":"f844de1d499754ad000455c292493eac985011db728ef2548fd35ebee16d98cc","schema_version":"1.0","event_id":"sha256:f844de1d499754ad000455c292493eac985011db728ef2548fd35ebee16d98cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EHXYUSZRKCO4GP23NIFLSRXCH/bundle.json","state_url":"https://pith.science/pith/4EHXYUSZRKCO4GP23NIFLSRXCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EHXYUSZRKCO4GP23NIFLSRXCH/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-21T06:11:39Z","links":{"resolver":"https://pith.science/pith/4EHXYUSZRKCO4GP23NIFLSRXCH","bundle":"https://pith.science/pith/4EHXYUSZRKCO4GP23NIFLSRXCH/bundle.json","state":"https://pith.science/pith/4EHXYUSZRKCO4GP23NIFLSRXCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EHXYUSZRKCO4GP23NIFLSRXCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4EHXYUSZRKCO4GP23NIFLSRXCH","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":"85bcddbec55c8e97a76ac60883ebebfced9cb9e54cff32488d8f9ac0c316d3c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-09T21:37:30Z","title_canon_sha256":"1837c10dc77ea564786d8514abdf606bda76f7602692deb3d548a52860a1e0b1"},"schema_version":"1.0","source":{"id":"1209.1842","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1842","created_at":"2026-05-18T03:45:54Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1842v1","created_at":"2026-05-18T03:45:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1842","created_at":"2026-05-18T03:45:54Z"},{"alias_kind":"pith_short_12","alias_value":"4EHXYUSZRKCO","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4EHXYUSZRKCO4GP2","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4EHXYUSZ","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:f844de1d499754ad000455c292493eac985011db728ef2548fd35ebee16d98cc","target":"graph","created_at":"2026-05-18T03:45:54Z","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":"Given a graph $G$, a dominating set $D$ is a set of vertices such that any vertex in $G$ has at least one neighbor (or possibly itself) in $D$. A ${k}$-dominating multiset $D_k$ is a multiset of vertices such that any vertex in $G$ has at least $k$ vertices from its closed neighborhood in $D_k$ when counted with multiplicity. In this paper, we utilize the approach developed by Clark and Suen (2000) and properties of binary matrices to prove a \"Vizing-like\" inequality on minimum ${k}$-dominating multisets of graphs $G,H$ and the Cartesian product graph $G \\Box H$. Specifically, denoting the siz","authors_text":"I. V. Hicks, K. Choudhary, S. Margulies","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-09T21:37:30Z","title":"A Note on Integer Domination of Cartesian Product Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1842","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:59eda0a12a233b9439f59a69842fe40afe43ae96919e6e0f107f53893449cc90","target":"record","created_at":"2026-05-18T03:45:54Z","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":"85bcddbec55c8e97a76ac60883ebebfced9cb9e54cff32488d8f9ac0c316d3c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-09T21:37:30Z","title_canon_sha256":"1837c10dc77ea564786d8514abdf606bda76f7602692deb3d548a52860a1e0b1"},"schema_version":"1.0","source":{"id":"1209.1842","kind":"arxiv","version":1}},"canonical_sha256":"e10f7c52598a84ee19fadb5055ca3711fc44581d41273b317ef9f5196379d0e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e10f7c52598a84ee19fadb5055ca3711fc44581d41273b317ef9f5196379d0e5","first_computed_at":"2026-05-18T03:45:54.200387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:54.200387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FPB9z0FuUYOIMcAW1D8QCuZm+MebQ0B4FM7Mwm0WrH2958k0ydjsm2OETZeZM+oE3aQ957+k8ISDHwUsDVF3AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:54.200845Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.1842","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59eda0a12a233b9439f59a69842fe40afe43ae96919e6e0f107f53893449cc90","sha256:f844de1d499754ad000455c292493eac985011db728ef2548fd35ebee16d98cc"],"state_sha256":"a3fa25ad98ea27f676e8f644e39e1614d402ee509521121e6badc7a53f4508f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p/BJmfKUx7eaOtX4JPnzo6Dc7P9u5TQwJCzKA9wv6pD3RvZJtf9T2AxrDVzfNP4QKRlWgye9aur1FEqVb++sCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T06:11:39.702069Z","bundle_sha256":"491a05404ae96e474e1797e9e2cc0c1067e5e20aefd7bddfd908f6b04d3917f5"}}