{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SGU5JEKLMMNVB4GF6JZFA4KA47","short_pith_number":"pith:SGU5JEKL","canonical_record":{"source":{"id":"1809.09990","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-09-26T13:38:56Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"ecba84e1fb9602de3890104941438bd4b3df08ca1b9ed9c521d6b851e9f6a822","abstract_canon_sha256":"714e215f286a24213d03695872ec03355ea5f485dff6218026101611b2192ca7"},"schema_version":"1.0"},"canonical_sha256":"91a9d4914b631b50f0c5f272507140e7d0182153db4d154b390cea7cdcdb12cb","source":{"kind":"arxiv","id":"1809.09990","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09990","created_at":"2026-05-18T00:04:29Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09990v2","created_at":"2026-05-18T00:04:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09990","created_at":"2026-05-18T00:04:29Z"},{"alias_kind":"pith_short_12","alias_value":"SGU5JEKLMMNV","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SGU5JEKLMMNVB4GF","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SGU5JEKL","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SGU5JEKLMMNVB4GF6JZFA4KA47","target":"record","payload":{"canonical_record":{"source":{"id":"1809.09990","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-09-26T13:38:56Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"ecba84e1fb9602de3890104941438bd4b3df08ca1b9ed9c521d6b851e9f6a822","abstract_canon_sha256":"714e215f286a24213d03695872ec03355ea5f485dff6218026101611b2192ca7"},"schema_version":"1.0"},"canonical_sha256":"91a9d4914b631b50f0c5f272507140e7d0182153db4d154b390cea7cdcdb12cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:29.094834Z","signature_b64":"x09gZ5vC82i7eyr6OAJZVR3HzpIYcaPmayPKkhONtEplaXD1Ig1QR6YhYcyau8zx5x66Vq2biBeuk/skMtyLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91a9d4914b631b50f0c5f272507140e7d0182153db4d154b390cea7cdcdb12cb","last_reissued_at":"2026-05-18T00:04:29.094387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:29.094387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.09990","source_version":2,"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:04:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bP4wl0yVPitznNdf/PcBuZEig0ZePnvR8TdfVenj+sLWhyUvy5rgLwfg0q/sdwmeTHRBZb96qIk8484mCPq5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:16:29.115614Z"},"content_sha256":"f68bda29f5299602c2c24934903248c2d032ed23473648dddf448788d57e1d53","schema_version":"1.0","event_id":"sha256:f68bda29f5299602c2c24934903248c2d032ed23473648dddf448788d57e1d53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SGU5JEKLMMNVB4GF6JZFA4KA47","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Minimum Dominating Set on String Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Dibyayan Chakraborty, Joydeep Mukherjee, Sandip Das","submitted_at":"2018-09-26T13:38:56Z","abstract_excerpt":"In this paper, we give approximation algorithms for the \\textsc{Minimum Dominating Set (MDS)} problem on \\emph{string} graphs and its subclasses. A \\emph{path} is a simple curve made up of alternating horizontal and vertical line segments. A \\emph{$k$-bend path} is a path made up of at most $k + 1$ line segments. An \\textsc{L}-path is a $1$-bend path having the shape `\\textsc{L}'. A \\emph{vertically-stabbed-\\textsc{L} graph} is an intersection graph of \\textsc{L}-paths intersecting a common vertical line. We give a polynomial time $8$-approximation algorithm for \\textsc{MDS} problem on vertica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09990","kind":"arxiv","version":2},"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:04:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y+oY+wmRs3IWCkVB0oN9ctUZXfAuXhJ2Z2cX0bx53PVQVKDaNaXvxZd6DklRi6miOthADZuVovNsvwZi9HSiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:16:29.116290Z"},"content_sha256":"18e3fb604f3a5d4813c38ac09781ce162a1ad0d3711f01b24668293f72fb76af","schema_version":"1.0","event_id":"sha256:18e3fb604f3a5d4813c38ac09781ce162a1ad0d3711f01b24668293f72fb76af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SGU5JEKLMMNVB4GF6JZFA4KA47/bundle.json","state_url":"https://pith.science/pith/SGU5JEKLMMNVB4GF6JZFA4KA47/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SGU5JEKLMMNVB4GF6JZFA4KA47/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-25T20:16:29Z","links":{"resolver":"https://pith.science/pith/SGU5JEKLMMNVB4GF6JZFA4KA47","bundle":"https://pith.science/pith/SGU5JEKLMMNVB4GF6JZFA4KA47/bundle.json","state":"https://pith.science/pith/SGU5JEKLMMNVB4GF6JZFA4KA47/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SGU5JEKLMMNVB4GF6JZFA4KA47/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SGU5JEKLMMNVB4GF6JZFA4KA47","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":"714e215f286a24213d03695872ec03355ea5f485dff6218026101611b2192ca7","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-09-26T13:38:56Z","title_canon_sha256":"ecba84e1fb9602de3890104941438bd4b3df08ca1b9ed9c521d6b851e9f6a822"},"schema_version":"1.0","source":{"id":"1809.09990","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09990","created_at":"2026-05-18T00:04:29Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09990v2","created_at":"2026-05-18T00:04:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09990","created_at":"2026-05-18T00:04:29Z"},{"alias_kind":"pith_short_12","alias_value":"SGU5JEKLMMNV","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SGU5JEKLMMNVB4GF","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SGU5JEKL","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:18e3fb604f3a5d4813c38ac09781ce162a1ad0d3711f01b24668293f72fb76af","target":"graph","created_at":"2026-05-18T00:04:29Z","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":"In this paper, we give approximation algorithms for the \\textsc{Minimum Dominating Set (MDS)} problem on \\emph{string} graphs and its subclasses. A \\emph{path} is a simple curve made up of alternating horizontal and vertical line segments. A \\emph{$k$-bend path} is a path made up of at most $k + 1$ line segments. An \\textsc{L}-path is a $1$-bend path having the shape `\\textsc{L}'. A \\emph{vertically-stabbed-\\textsc{L} graph} is an intersection graph of \\textsc{L}-paths intersecting a common vertical line. We give a polynomial time $8$-approximation algorithm for \\textsc{MDS} problem on vertica","authors_text":"Dibyayan Chakraborty, Joydeep Mukherjee, Sandip Das","cross_cats":["cs.CG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-09-26T13:38:56Z","title":"Approximating Minimum Dominating Set on String Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09990","kind":"arxiv","version":2},"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:f68bda29f5299602c2c24934903248c2d032ed23473648dddf448788d57e1d53","target":"record","created_at":"2026-05-18T00:04:29Z","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":"714e215f286a24213d03695872ec03355ea5f485dff6218026101611b2192ca7","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-09-26T13:38:56Z","title_canon_sha256":"ecba84e1fb9602de3890104941438bd4b3df08ca1b9ed9c521d6b851e9f6a822"},"schema_version":"1.0","source":{"id":"1809.09990","kind":"arxiv","version":2}},"canonical_sha256":"91a9d4914b631b50f0c5f272507140e7d0182153db4d154b390cea7cdcdb12cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91a9d4914b631b50f0c5f272507140e7d0182153db4d154b390cea7cdcdb12cb","first_computed_at":"2026-05-18T00:04:29.094387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:29.094387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x09gZ5vC82i7eyr6OAJZVR3HzpIYcaPmayPKkhONtEplaXD1Ig1QR6YhYcyau8zx5x66Vq2biBeuk/skMtyLDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:29.094834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09990","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f68bda29f5299602c2c24934903248c2d032ed23473648dddf448788d57e1d53","sha256:18e3fb604f3a5d4813c38ac09781ce162a1ad0d3711f01b24668293f72fb76af"],"state_sha256":"2d649c9e8afa2810a20ced7ee4022c9a7afc087220fc22cd8afd000a498038b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/EUO9lrvcf0CbnTxEpP23zwYYLafmHVQwH84jQE5B8Nj13Wwyz8FEJEVq7Srip3iXhekDy6A0e56rYUwIMdBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:16:29.119984Z","bundle_sha256":"0c003658a25f4e54266dc8dd5c5f14f22d1f015980515aebc99fdd9367c7ab75"}}