{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YLHE7CETHDZMP3YCR4SJQJROW2","short_pith_number":"pith:YLHE7CET","schema_version":"1.0","canonical_sha256":"c2ce4f889338f2c7ef028f2498262eb6af28832854975abcfa78cf047a188842","source":{"kind":"arxiv","id":"1710.11414","version":1},"attestation_state":"computed","paper":{"title":"Improved Bounds for Online Dominating Sets of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Koji M. Kobayashi","submitted_at":"2017-10-31T11:42:06Z","abstract_excerpt":"The online dominating set problem is an online variant of the minimum dominating set problem, which is one of the most important NP-hard problems on graphs. This problem is defined as follows: Given an undirected graph $G = (V, E)$, in which $V$ is a set of vertices and $E$ is a set of edges. We say that a set $D \\subseteq V$ of vertices is a {\\em dominating set} of $G$ if for each $v \\in V \\setminus D$, there exists a vertex $u \\in D$ such that $\\{ u, v \\} \\in E$. The vertices are revealed to an online algorithm one by one over time. When a vertex is revealed, edges between the vertex and ver"},"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":"1710.11414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T11:42:06Z","cross_cats_sorted":[],"title_canon_sha256":"ffd49f8d2e95e4ddd1e5de1f3fde40023c62a49f79fc0363aefa8e15c4cb8ed3","abstract_canon_sha256":"461025f937bf0777d653479b39d0987d918a334db7d605d1a6d6dacf0418a988"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:37.482511Z","signature_b64":"8YbnGLdcbQvsdLH2TdrT9zyNUFdpc2YILEjTy9hDspINdw4FJ2lMMUzM5hq68jOm83RI27f47ug5OVs4sQDmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2ce4f889338f2c7ef028f2498262eb6af28832854975abcfa78cf047a188842","last_reissued_at":"2026-05-18T00:31:37.481823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:37.481823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Bounds for Online Dominating Sets of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Koji M. Kobayashi","submitted_at":"2017-10-31T11:42:06Z","abstract_excerpt":"The online dominating set problem is an online variant of the minimum dominating set problem, which is one of the most important NP-hard problems on graphs. This problem is defined as follows: Given an undirected graph $G = (V, E)$, in which $V$ is a set of vertices and $E$ is a set of edges. We say that a set $D \\subseteq V$ of vertices is a {\\em dominating set} of $G$ if for each $v \\in V \\setminus D$, there exists a vertex $u \\in D$ such that $\\{ u, v \\} \\in E$. The vertices are revealed to an online algorithm one by one over time. When a vertex is revealed, edges between the vertex and ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11414","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.11414","created_at":"2026-05-18T00:31:37.481915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.11414v1","created_at":"2026-05-18T00:31:37.481915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11414","created_at":"2026-05-18T00:31:37.481915+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLHE7CETHDZM","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLHE7CETHDZMP3YC","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLHE7CET","created_at":"2026-05-18T12:31:56.362134+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/YLHE7CETHDZMP3YCR4SJQJROW2","json":"https://pith.science/pith/YLHE7CETHDZMP3YCR4SJQJROW2.json","graph_json":"https://pith.science/api/pith-number/YLHE7CETHDZMP3YCR4SJQJROW2/graph.json","events_json":"https://pith.science/api/pith-number/YLHE7CETHDZMP3YCR4SJQJROW2/events.json","paper":"https://pith.science/paper/YLHE7CET"},"agent_actions":{"view_html":"https://pith.science/pith/YLHE7CETHDZMP3YCR4SJQJROW2","download_json":"https://pith.science/pith/YLHE7CETHDZMP3YCR4SJQJROW2.json","view_paper":"https://pith.science/paper/YLHE7CET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.11414&json=true","fetch_graph":"https://pith.science/api/pith-number/YLHE7CETHDZMP3YCR4SJQJROW2/graph.json","fetch_events":"https://pith.science/api/pith-number/YLHE7CETHDZMP3YCR4SJQJROW2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLHE7CETHDZMP3YCR4SJQJROW2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLHE7CETHDZMP3YCR4SJQJROW2/action/storage_attestation","attest_author":"https://pith.science/pith/YLHE7CETHDZMP3YCR4SJQJROW2/action/author_attestation","sign_citation":"https://pith.science/pith/YLHE7CETHDZMP3YCR4SJQJROW2/action/citation_signature","submit_replication":"https://pith.science/pith/YLHE7CETHDZMP3YCR4SJQJROW2/action/replication_record"}},"created_at":"2026-05-18T00:31:37.481915+00:00","updated_at":"2026-05-18T00:31:37.481915+00:00"}