{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NIZT62VNGWHYUZK2RTHNWOUWMD","short_pith_number":"pith:NIZT62VN","canonical_record":{"source":{"id":"1306.5041","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-21T03:46:54Z","cross_cats_sorted":[],"title_canon_sha256":"71749577f91f4bc5461100d501035c14bc5e84ab7a3484eb52c1f5ebbdf507d8","abstract_canon_sha256":"ec27f3e7bf66d65972fabf4d7f4b73cde14084f95bfe8c93ad7289720ad6ff8c"},"schema_version":"1.0"},"canonical_sha256":"6a333f6aad358f8a655a8ccedb3a9660f452ac700b5333131c4653255d74c4fe","source":{"kind":"arxiv","id":"1306.5041","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5041","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5041v3","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5041","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"pith_short_12","alias_value":"NIZT62VNGWHY","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NIZT62VNGWHYUZK2","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NIZT62VN","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NIZT62VNGWHYUZK2RTHNWOUWMD","target":"record","payload":{"canonical_record":{"source":{"id":"1306.5041","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-21T03:46:54Z","cross_cats_sorted":[],"title_canon_sha256":"71749577f91f4bc5461100d501035c14bc5e84ab7a3484eb52c1f5ebbdf507d8","abstract_canon_sha256":"ec27f3e7bf66d65972fabf4d7f4b73cde14084f95bfe8c93ad7289720ad6ff8c"},"schema_version":"1.0"},"canonical_sha256":"6a333f6aad358f8a655a8ccedb3a9660f452ac700b5333131c4653255d74c4fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:59.094554Z","signature_b64":"rFo1+7zdIl0Ng5q30+SMPHUirhGvOJMytrh3MG264YgRpE0wVyz9nsVxcPjLNRPBdz2FWJgqnK81jC+5+J+2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a333f6aad358f8a655a8ccedb3a9660f452ac700b5333131c4653255d74c4fe","last_reissued_at":"2026-05-18T03:11:59.093785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:59.093785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.5041","source_version":3,"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:11:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XP2fwdqGShvMPVyPtgnltmg4CNDSM7rCKHQnuRAlc3QIOhsYhFWO/N2o3Vui57K7VImQyC6/jfOsqg+OPxhxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:26:24.953761Z"},"content_sha256":"c6776b8113342d90c8608c0742f63541c7dd0194f3ac9e0a399dfd138244bb17","schema_version":"1.0","event_id":"sha256:c6776b8113342d90c8608c0742f63541c7dd0194f3ac9e0a399dfd138244bb17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NIZT62VNGWHYUZK2RTHNWOUWMD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"(Total) Vector Domination for Graphs with Bounded Branchwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hirotaka Ono, Toshimasa Ishii, Yushi Uno","submitted_at":"2013-06-21T03:46:54Z","abstract_excerpt":"Given a graph $G=(V,E)$ of order $n$ and an $n$-dimensional non-negative vector $d=(d(1),d(2),\\ldots,d(n))$, called demand vector, the vector domination (resp., total vector domination) is the problem of finding a minimum $S\\subseteq V$ such that every vertex $v$ in $V\\setminus S$ (resp., in $V$) has at least $d(v)$ neighbors in $S$. The (total) vector domination is a generalization of many dominating set type problems, e.g., the dominating set problem, the $k$-tuple dominating set problem (this $k$ is different from the solution size), and so on, and its approximability and inapproximability "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5041","kind":"arxiv","version":3},"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:11:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLauj36cYU0/2jy0JSZkmZ2qguwJmQjhCAnKdW38MlEUpu7bS+E4smukj6RfcSEjZ3ho5tORfQAtn/PHR+2cAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:26:24.954446Z"},"content_sha256":"aae113d6af248fe34b9ee152c9b9832f83a34bd1efa21ffaba42025ad967765c","schema_version":"1.0","event_id":"sha256:aae113d6af248fe34b9ee152c9b9832f83a34bd1efa21ffaba42025ad967765c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NIZT62VNGWHYUZK2RTHNWOUWMD/bundle.json","state_url":"https://pith.science/pith/NIZT62VNGWHYUZK2RTHNWOUWMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NIZT62VNGWHYUZK2RTHNWOUWMD/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-05-22T00:26:24Z","links":{"resolver":"https://pith.science/pith/NIZT62VNGWHYUZK2RTHNWOUWMD","bundle":"https://pith.science/pith/NIZT62VNGWHYUZK2RTHNWOUWMD/bundle.json","state":"https://pith.science/pith/NIZT62VNGWHYUZK2RTHNWOUWMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NIZT62VNGWHYUZK2RTHNWOUWMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NIZT62VNGWHYUZK2RTHNWOUWMD","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":"ec27f3e7bf66d65972fabf4d7f4b73cde14084f95bfe8c93ad7289720ad6ff8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-21T03:46:54Z","title_canon_sha256":"71749577f91f4bc5461100d501035c14bc5e84ab7a3484eb52c1f5ebbdf507d8"},"schema_version":"1.0","source":{"id":"1306.5041","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5041","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5041v3","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5041","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"pith_short_12","alias_value":"NIZT62VNGWHY","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NIZT62VNGWHYUZK2","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NIZT62VN","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:aae113d6af248fe34b9ee152c9b9832f83a34bd1efa21ffaba42025ad967765c","target":"graph","created_at":"2026-05-18T03:11:59Z","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=(V,E)$ of order $n$ and an $n$-dimensional non-negative vector $d=(d(1),d(2),\\ldots,d(n))$, called demand vector, the vector domination (resp., total vector domination) is the problem of finding a minimum $S\\subseteq V$ such that every vertex $v$ in $V\\setminus S$ (resp., in $V$) has at least $d(v)$ neighbors in $S$. The (total) vector domination is a generalization of many dominating set type problems, e.g., the dominating set problem, the $k$-tuple dominating set problem (this $k$ is different from the solution size), and so on, and its approximability and inapproximability ","authors_text":"Hirotaka Ono, Toshimasa Ishii, Yushi Uno","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-21T03:46:54Z","title":"(Total) Vector Domination for Graphs with Bounded Branchwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5041","kind":"arxiv","version":3},"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:c6776b8113342d90c8608c0742f63541c7dd0194f3ac9e0a399dfd138244bb17","target":"record","created_at":"2026-05-18T03:11:59Z","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":"ec27f3e7bf66d65972fabf4d7f4b73cde14084f95bfe8c93ad7289720ad6ff8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-21T03:46:54Z","title_canon_sha256":"71749577f91f4bc5461100d501035c14bc5e84ab7a3484eb52c1f5ebbdf507d8"},"schema_version":"1.0","source":{"id":"1306.5041","kind":"arxiv","version":3}},"canonical_sha256":"6a333f6aad358f8a655a8ccedb3a9660f452ac700b5333131c4653255d74c4fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a333f6aad358f8a655a8ccedb3a9660f452ac700b5333131c4653255d74c4fe","first_computed_at":"2026-05-18T03:11:59.093785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:59.093785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rFo1+7zdIl0Ng5q30+SMPHUirhGvOJMytrh3MG264YgRpE0wVyz9nsVxcPjLNRPBdz2FWJgqnK81jC+5+J+2Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:59.094554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.5041","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6776b8113342d90c8608c0742f63541c7dd0194f3ac9e0a399dfd138244bb17","sha256:aae113d6af248fe34b9ee152c9b9832f83a34bd1efa21ffaba42025ad967765c"],"state_sha256":"75403a07325a997086b9f0e010142cf490f6b3a6fc8096f5f4224ade1f5f69e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kDXB3CYQoFI+sRgH5ZtoHjtIXLfS5KB022t825sLgPHQF2KkKflsiHLxH1EVB113RPRr1Wmm6gnPYGD+U7R1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T00:26:24.958175Z","bundle_sha256":"71153e6870a7021adaa04f811d040cfafab5f0f83cbb3bc6542dabee8d970667"}}