{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EXSXFGQNL7HDDNJKPQNX6ZM6UG","short_pith_number":"pith:EXSXFGQN","canonical_record":{"source":{"id":"1709.05182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-15T13:03:48Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e9062c306451e41575c74dba208dcc7d43ea677b32981d923bcefd2ae53d1009","abstract_canon_sha256":"b24cefaf3a7099780849aa881a042803bcaae3a4124f78b43b41d5b1d0592af8"},"schema_version":"1.0"},"canonical_sha256":"25e5729a0d5fce31b52a7c1b7f659ea192b9c04707393e8d15e06c878a20df19","source":{"kind":"arxiv","id":"1709.05182","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05182","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05182v1","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05182","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"pith_short_12","alias_value":"EXSXFGQNL7HD","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EXSXFGQNL7HDDNJK","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EXSXFGQN","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EXSXFGQNL7HDDNJKPQNX6ZM6UG","target":"record","payload":{"canonical_record":{"source":{"id":"1709.05182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-15T13:03:48Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e9062c306451e41575c74dba208dcc7d43ea677b32981d923bcefd2ae53d1009","abstract_canon_sha256":"b24cefaf3a7099780849aa881a042803bcaae3a4124f78b43b41d5b1d0592af8"},"schema_version":"1.0"},"canonical_sha256":"25e5729a0d5fce31b52a7c1b7f659ea192b9c04707393e8d15e06c878a20df19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:06.483075Z","signature_b64":"5KOuxYljaJ48pn+Sx07eYO3lGmXIvkSEuvVgx46JAwvNcA/4+KuH2pZ+gL1Ubb9ZOGze1FiSS4K5rnpIcJK3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25e5729a0d5fce31b52a7c1b7f659ea192b9c04707393e8d15e06c878a20df19","last_reissued_at":"2026-05-18T00:35:06.482421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:06.482421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.05182","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:35:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6vPQUjfs8VVtLNMTS2Rn/0QeYEYSvdPX/94jwmEIWfvkmg4lwQyYQc1p7+9C6RFnNxsv8dgJSEmq9eURL6WhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:56:11.658032Z"},"content_sha256":"c5d9c306123c3800e155ed98d1242d590b4ec3dc2f065557facd99d18506ab05","schema_version":"1.0","event_id":"sha256:c5d9c306123c3800e155ed98d1242d590b4ec3dc2f065557facd99d18506ab05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EXSXFGQNL7HDDNJKPQNX6ZM6UG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Dominating Set Problem in Geometric Intersection Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.CG","authors_text":"Gerhard Woeginger, Mark de Berg, S\\'andor Kisfaludi-Bak","submitted_at":"2017-09-15T13:03:48Z","abstract_excerpt":"We study the parameterized complexity of dominating sets in geometric intersection graphs. In one dimension, we investigate intersection graphs induced by translates of a fixed pattern Q that consists of a finite number of intervals and a finite number of isolated points. We prove that Dominating Set on such intersection graphs is polynomially solvable whenever Q contains at least one interval, and whenever Q contains no intervals and for any two point pairs in Q the distance ratio is rational. The remaining case where Q contains no intervals but does contain an irrational distance ratio is sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05182","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:35:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pJakqdU0LKEDzV8El2W0T4sh3YHuM7i1SXlYmLQHLkBUNU/SiciPMAjmp5O8AqBjs9X3ixc+p+XnFez5VUhlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:56:11.658399Z"},"content_sha256":"bfaf4ffca3a82a6bf2ae042f587fa03cacc05204b93d56629da6ffe30dfe517b","schema_version":"1.0","event_id":"sha256:bfaf4ffca3a82a6bf2ae042f587fa03cacc05204b93d56629da6ffe30dfe517b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXSXFGQNL7HDDNJKPQNX6ZM6UG/bundle.json","state_url":"https://pith.science/pith/EXSXFGQNL7HDDNJKPQNX6ZM6UG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXSXFGQNL7HDDNJKPQNX6ZM6UG/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-01T19:56:11Z","links":{"resolver":"https://pith.science/pith/EXSXFGQNL7HDDNJKPQNX6ZM6UG","bundle":"https://pith.science/pith/EXSXFGQNL7HDDNJKPQNX6ZM6UG/bundle.json","state":"https://pith.science/pith/EXSXFGQNL7HDDNJKPQNX6ZM6UG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXSXFGQNL7HDDNJKPQNX6ZM6UG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EXSXFGQNL7HDDNJKPQNX6ZM6UG","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":"b24cefaf3a7099780849aa881a042803bcaae3a4124f78b43b41d5b1d0592af8","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-15T13:03:48Z","title_canon_sha256":"e9062c306451e41575c74dba208dcc7d43ea677b32981d923bcefd2ae53d1009"},"schema_version":"1.0","source":{"id":"1709.05182","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05182","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05182v1","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05182","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"pith_short_12","alias_value":"EXSXFGQNL7HD","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EXSXFGQNL7HDDNJK","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EXSXFGQN","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:bfaf4ffca3a82a6bf2ae042f587fa03cacc05204b93d56629da6ffe30dfe517b","target":"graph","created_at":"2026-05-18T00:35:06Z","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":"We study the parameterized complexity of dominating sets in geometric intersection graphs. In one dimension, we investigate intersection graphs induced by translates of a fixed pattern Q that consists of a finite number of intervals and a finite number of isolated points. We prove that Dominating Set on such intersection graphs is polynomially solvable whenever Q contains at least one interval, and whenever Q contains no intervals and for any two point pairs in Q the distance ratio is rational. The remaining case where Q contains no intervals but does contain an irrational distance ratio is sh","authors_text":"Gerhard Woeginger, Mark de Berg, S\\'andor Kisfaludi-Bak","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-15T13:03:48Z","title":"The Dominating Set Problem in Geometric Intersection Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05182","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:c5d9c306123c3800e155ed98d1242d590b4ec3dc2f065557facd99d18506ab05","target":"record","created_at":"2026-05-18T00:35:06Z","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":"b24cefaf3a7099780849aa881a042803bcaae3a4124f78b43b41d5b1d0592af8","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-15T13:03:48Z","title_canon_sha256":"e9062c306451e41575c74dba208dcc7d43ea677b32981d923bcefd2ae53d1009"},"schema_version":"1.0","source":{"id":"1709.05182","kind":"arxiv","version":1}},"canonical_sha256":"25e5729a0d5fce31b52a7c1b7f659ea192b9c04707393e8d15e06c878a20df19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25e5729a0d5fce31b52a7c1b7f659ea192b9c04707393e8d15e06c878a20df19","first_computed_at":"2026-05-18T00:35:06.482421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:06.482421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5KOuxYljaJ48pn+Sx07eYO3lGmXIvkSEuvVgx46JAwvNcA/4+KuH2pZ+gL1Ubb9ZOGze1FiSS4K5rnpIcJK3BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:06.483075Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05182","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5d9c306123c3800e155ed98d1242d590b4ec3dc2f065557facd99d18506ab05","sha256:bfaf4ffca3a82a6bf2ae042f587fa03cacc05204b93d56629da6ffe30dfe517b"],"state_sha256":"372c9df117040783100595533b072b8f3b6382919291578d1f1aa81839755af4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yciywZ0Xmoov0uQv3o76bx7lny7LsSomWbEjq6fuBnxcpAi6EHT0pGfUvlIsSbUKhMYiMR+DBomgoQLRVm8HCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:56:11.660366Z","bundle_sha256":"5353a4d684ff202b8ab1e70f457e9302b39066b7dc15b3130eead3e4f1eb703a"}}