{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BZVDCIOL2CCWZTTWSUGKZLW6ME","short_pith_number":"pith:BZVDCIOL","canonical_record":{"source":{"id":"1301.4008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-17T08:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"1c5a2db6de71d9d3d4a09c2e7440171f8e4251efb37fb98285af2af81e4e2576","abstract_canon_sha256":"57f148c5005f782fac28a5e2c93973160d87e06556f81ebb8839357a35f91fcb"},"schema_version":"1.0"},"canonical_sha256":"0e6a3121cbd0856cce76950cacaede6117fe4291cca0a2f10330614b1b7238db","source":{"kind":"arxiv","id":"1301.4008","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4008","created_at":"2026-05-18T03:36:14Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4008v1","created_at":"2026-05-18T03:36:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4008","created_at":"2026-05-18T03:36:14Z"},{"alias_kind":"pith_short_12","alias_value":"BZVDCIOL2CCW","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BZVDCIOL2CCWZTTW","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BZVDCIOL","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BZVDCIOL2CCWZTTWSUGKZLW6ME","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-17T08:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"1c5a2db6de71d9d3d4a09c2e7440171f8e4251efb37fb98285af2af81e4e2576","abstract_canon_sha256":"57f148c5005f782fac28a5e2c93973160d87e06556f81ebb8839357a35f91fcb"},"schema_version":"1.0"},"canonical_sha256":"0e6a3121cbd0856cce76950cacaede6117fe4291cca0a2f10330614b1b7238db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:14.636314Z","signature_b64":"eRBmbZppgstdxdL4NVnsMDtG13kNjWn30w6w0GV5i43l60Tyet4i2dIbgyOcsEvXpOG64a27t8mCNGWfJhc6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e6a3121cbd0856cce76950cacaede6117fe4291cca0a2f10330614b1b7238db","last_reissued_at":"2026-05-18T03:36:14.635633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:14.635633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4008","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:36:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q4ddFqU+SPfdMKuTqK5n9vXcWa0dIOhBp/cPrFvtOfpR+rfYRDWBlrbspBIukvRd/Lna/PPty8VoEJIeOwPaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:00:57.537562Z"},"content_sha256":"2adcfe24775aeb56df526e62719eaa21ca8fe21103b5964ebffc0095673972cf","schema_version":"1.0","event_id":"sha256:2adcfe24775aeb56df526e62719eaa21ca8fe21103b5964ebffc0095673972cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BZVDCIOL2CCWZTTWSUGKZLW6ME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous Domination in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael A. Henning, Yair Caro","submitted_at":"2013-01-17T08:41:18Z","abstract_excerpt":"Let $F_1, F_2, ..., F_k$ be graphs with the same vertex set $V$. A subset $S \\subseteq V$ is a simultaneous dominating set if for every $i$, $1 \\le i \\le k$, every vertex of $F_i$ not in $S$ is adjacent to a vertex in $S$ in $F_i$; that is, the set $S$ is simultaneously a dominating set in each graph $F_i$. The cardinality of a smallest such set is the simultaneous domination number. We present general upper bounds on the simultaneous domination number. We investigate bounds in special cases, including the cases when the factors, $F_i$, are $r$-regular or the disjoint union of copies of $K_r$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4008","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:36:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"974sxlicgKu/LWy/t6rSxJfgqDtzyoeqJxH1PJpWGirWVsLJ8eP3525FjtvFYL/bNjqL0p5ZX1+lnEc2z+koDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:00:57.538208Z"},"content_sha256":"11ffae38d76f461ca2bc1000c527179a9a9a181562893108b199092096b7b645","schema_version":"1.0","event_id":"sha256:11ffae38d76f461ca2bc1000c527179a9a9a181562893108b199092096b7b645"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZVDCIOL2CCWZTTWSUGKZLW6ME/bundle.json","state_url":"https://pith.science/pith/BZVDCIOL2CCWZTTWSUGKZLW6ME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZVDCIOL2CCWZTTWSUGKZLW6ME/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-11T06:00:57Z","links":{"resolver":"https://pith.science/pith/BZVDCIOL2CCWZTTWSUGKZLW6ME","bundle":"https://pith.science/pith/BZVDCIOL2CCWZTTWSUGKZLW6ME/bundle.json","state":"https://pith.science/pith/BZVDCIOL2CCWZTTWSUGKZLW6ME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZVDCIOL2CCWZTTWSUGKZLW6ME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BZVDCIOL2CCWZTTWSUGKZLW6ME","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":"57f148c5005f782fac28a5e2c93973160d87e06556f81ebb8839357a35f91fcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-17T08:41:18Z","title_canon_sha256":"1c5a2db6de71d9d3d4a09c2e7440171f8e4251efb37fb98285af2af81e4e2576"},"schema_version":"1.0","source":{"id":"1301.4008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4008","created_at":"2026-05-18T03:36:14Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4008v1","created_at":"2026-05-18T03:36:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4008","created_at":"2026-05-18T03:36:14Z"},{"alias_kind":"pith_short_12","alias_value":"BZVDCIOL2CCW","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BZVDCIOL2CCWZTTW","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BZVDCIOL","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:11ffae38d76f461ca2bc1000c527179a9a9a181562893108b199092096b7b645","target":"graph","created_at":"2026-05-18T03:36:14Z","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":"Let $F_1, F_2, ..., F_k$ be graphs with the same vertex set $V$. A subset $S \\subseteq V$ is a simultaneous dominating set if for every $i$, $1 \\le i \\le k$, every vertex of $F_i$ not in $S$ is adjacent to a vertex in $S$ in $F_i$; that is, the set $S$ is simultaneously a dominating set in each graph $F_i$. The cardinality of a smallest such set is the simultaneous domination number. We present general upper bounds on the simultaneous domination number. We investigate bounds in special cases, including the cases when the factors, $F_i$, are $r$-regular or the disjoint union of copies of $K_r$.","authors_text":"Michael A. Henning, Yair Caro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-17T08:41:18Z","title":"Simultaneous Domination in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4008","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:2adcfe24775aeb56df526e62719eaa21ca8fe21103b5964ebffc0095673972cf","target":"record","created_at":"2026-05-18T03:36:14Z","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":"57f148c5005f782fac28a5e2c93973160d87e06556f81ebb8839357a35f91fcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-17T08:41:18Z","title_canon_sha256":"1c5a2db6de71d9d3d4a09c2e7440171f8e4251efb37fb98285af2af81e4e2576"},"schema_version":"1.0","source":{"id":"1301.4008","kind":"arxiv","version":1}},"canonical_sha256":"0e6a3121cbd0856cce76950cacaede6117fe4291cca0a2f10330614b1b7238db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e6a3121cbd0856cce76950cacaede6117fe4291cca0a2f10330614b1b7238db","first_computed_at":"2026-05-18T03:36:14.635633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:14.635633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eRBmbZppgstdxdL4NVnsMDtG13kNjWn30w6w0GV5i43l60Tyet4i2dIbgyOcsEvXpOG64a27t8mCNGWfJhc6Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:14.636314Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2adcfe24775aeb56df526e62719eaa21ca8fe21103b5964ebffc0095673972cf","sha256:11ffae38d76f461ca2bc1000c527179a9a9a181562893108b199092096b7b645"],"state_sha256":"6f6561e5105ded8ff30faa704071f394c34cd80f75f2e1ded1b828c188d02cae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9yBCqoAyZg5r588yhcDNmbS56A0ULlzxfGmXapKUxP/Io3OikYs2BpaWSgTpLlNjAqqV6W9ipZYffZ6Wt+RxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:00:57.542006Z","bundle_sha256":"3fb392a61ad507985c3a3e4220e5103285c92ef9d6f28e1d4d38c694d05cb93b"}}