{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NIZT62VNGWHYUZK2RTHNWOUWMD","short_pith_number":"pith:NIZT62VN","schema_version":"1.0","canonical_sha256":"6a333f6aad358f8a655a8ccedb3a9660f452ac700b5333131c4653255d74c4fe","source":{"kind":"arxiv","id":"1306.5041","version":3},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.5041","created_at":"2026-05-18T03:11:59.093918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5041v3","created_at":"2026-05-18T03:11:59.093918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5041","created_at":"2026-05-18T03:11:59.093918+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIZT62VNGWHY","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIZT62VNGWHYUZK2","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIZT62VN","created_at":"2026-05-18T12:27:52.871228+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/NIZT62VNGWHYUZK2RTHNWOUWMD","json":"https://pith.science/pith/NIZT62VNGWHYUZK2RTHNWOUWMD.json","graph_json":"https://pith.science/api/pith-number/NIZT62VNGWHYUZK2RTHNWOUWMD/graph.json","events_json":"https://pith.science/api/pith-number/NIZT62VNGWHYUZK2RTHNWOUWMD/events.json","paper":"https://pith.science/paper/NIZT62VN"},"agent_actions":{"view_html":"https://pith.science/pith/NIZT62VNGWHYUZK2RTHNWOUWMD","download_json":"https://pith.science/pith/NIZT62VNGWHYUZK2RTHNWOUWMD.json","view_paper":"https://pith.science/paper/NIZT62VN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5041&json=true","fetch_graph":"https://pith.science/api/pith-number/NIZT62VNGWHYUZK2RTHNWOUWMD/graph.json","fetch_events":"https://pith.science/api/pith-number/NIZT62VNGWHYUZK2RTHNWOUWMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIZT62VNGWHYUZK2RTHNWOUWMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIZT62VNGWHYUZK2RTHNWOUWMD/action/storage_attestation","attest_author":"https://pith.science/pith/NIZT62VNGWHYUZK2RTHNWOUWMD/action/author_attestation","sign_citation":"https://pith.science/pith/NIZT62VNGWHYUZK2RTHNWOUWMD/action/citation_signature","submit_replication":"https://pith.science/pith/NIZT62VNGWHYUZK2RTHNWOUWMD/action/replication_record"}},"created_at":"2026-05-18T03:11:59.093918+00:00","updated_at":"2026-05-18T03:11:59.093918+00:00"}