{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YLHE7CETHDZMP3YCR4SJQJROW2","short_pith_number":"pith:YLHE7CET","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"},"canonical_sha256":"c2ce4f889338f2c7ef028f2498262eb6af28832854975abcfa78cf047a188842","source":{"kind":"arxiv","id":"1710.11414","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11414","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11414v1","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11414","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"pith_short_12","alias_value":"YLHE7CETHDZM","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YLHE7CETHDZMP3YC","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YLHE7CET","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YLHE7CETHDZMP3YCR4SJQJROW2","target":"record","payload":{"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"},"canonical_sha256":"c2ce4f889338f2c7ef028f2498262eb6af28832854975abcfa78cf047a188842","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"},"source_kind":"arxiv","source_id":"1710.11414","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-18T00:31:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iNeHCDaT/HVIrs1ZrvrImCQlHWjaYpxt1GB7dOcvPl7XuLqtb69+tuWyj0gY4Orne0BQsPxySNSa7h6d2YDUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:27:56.527636Z"},"content_sha256":"61669ef96ed369c6b6a6202da271a66cd672c79dfa4e052d29425b335ca28db2","schema_version":"1.0","event_id":"sha256:61669ef96ed369c6b6a6202da271a66cd672c79dfa4e052d29425b335ca28db2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YLHE7CETHDZMP3YCR4SJQJROW2","target":"graph","payload":{"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"},"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-18T00:31:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AOcxyIjMAl/yfB6qQGA9gxoNWwmfCYAnpSh3VsftXliqqEsoRJ+CwMU69dnTKPZpcKeWvLGKHsO3WQjsXb6JBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:27:56.527977Z"},"content_sha256":"443b5c4323eb2cb49374dcd497d0ddf855b6157d8debcd45ce7a430be8f341e8","schema_version":"1.0","event_id":"sha256:443b5c4323eb2cb49374dcd497d0ddf855b6157d8debcd45ce7a430be8f341e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLHE7CETHDZMP3YCR4SJQJROW2/bundle.json","state_url":"https://pith.science/pith/YLHE7CETHDZMP3YCR4SJQJROW2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLHE7CETHDZMP3YCR4SJQJROW2/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-02T01:27:56Z","links":{"resolver":"https://pith.science/pith/YLHE7CETHDZMP3YCR4SJQJROW2","bundle":"https://pith.science/pith/YLHE7CETHDZMP3YCR4SJQJROW2/bundle.json","state":"https://pith.science/pith/YLHE7CETHDZMP3YCR4SJQJROW2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLHE7CETHDZMP3YCR4SJQJROW2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YLHE7CETHDZMP3YCR4SJQJROW2","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":"461025f937bf0777d653479b39d0987d918a334db7d605d1a6d6dacf0418a988","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T11:42:06Z","title_canon_sha256":"ffd49f8d2e95e4ddd1e5de1f3fde40023c62a49f79fc0363aefa8e15c4cb8ed3"},"schema_version":"1.0","source":{"id":"1710.11414","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11414","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11414v1","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11414","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"pith_short_12","alias_value":"YLHE7CETHDZM","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YLHE7CETHDZMP3YC","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YLHE7CET","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:443b5c4323eb2cb49374dcd497d0ddf855b6157d8debcd45ce7a430be8f341e8","target":"graph","created_at":"2026-05-18T00:31:37Z","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":"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","authors_text":"Koji M. Kobayashi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T11:42:06Z","title":"Improved Bounds for Online Dominating Sets of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11414","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:61669ef96ed369c6b6a6202da271a66cd672c79dfa4e052d29425b335ca28db2","target":"record","created_at":"2026-05-18T00:31:37Z","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":"461025f937bf0777d653479b39d0987d918a334db7d605d1a6d6dacf0418a988","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T11:42:06Z","title_canon_sha256":"ffd49f8d2e95e4ddd1e5de1f3fde40023c62a49f79fc0363aefa8e15c4cb8ed3"},"schema_version":"1.0","source":{"id":"1710.11414","kind":"arxiv","version":1}},"canonical_sha256":"c2ce4f889338f2c7ef028f2498262eb6af28832854975abcfa78cf047a188842","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2ce4f889338f2c7ef028f2498262eb6af28832854975abcfa78cf047a188842","first_computed_at":"2026-05-18T00:31:37.481823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:37.481823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8YbnGLdcbQvsdLH2TdrT9zyNUFdpc2YILEjTy9hDspINdw4FJ2lMMUzM5hq68jOm83RI27f47ug5OVs4sQDmDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:37.482511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.11414","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61669ef96ed369c6b6a6202da271a66cd672c79dfa4e052d29425b335ca28db2","sha256:443b5c4323eb2cb49374dcd497d0ddf855b6157d8debcd45ce7a430be8f341e8"],"state_sha256":"76202f9b9fb95c017ce0124d070f0c71399f1191f3a3936e1a42d5158688303a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMyNOv6lQu132LzdryXMRc71J5yDLKHxXQWZ0OhiCcn+zftXR92vd0mcw45LFTGYjT9cSTcBWOAO1TOVYlD5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:27:56.529917Z","bundle_sha256":"091e989c3d11675e0023c8d7b8038e585451ee1ceaec62a72656e0381da00042"}}