{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IV3BTXSDH7LKXLHAMZLZQ7Z3OJ","short_pith_number":"pith:IV3BTXSD","canonical_record":{"source":{"id":"1205.3728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-16T16:32:43Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"a421cc69a7815f4e18950cfcb8c5ac222cac247e83c3209a4efb78e8f639a495","abstract_canon_sha256":"627ef8842dc90cadc9b7d155449e4863b144bfdd64bced7324e73c5dd945fe24"},"schema_version":"1.0"},"canonical_sha256":"457619de433fd6abace06657987f3b72575552a0445698ff635e7495af5cfb19","source":{"kind":"arxiv","id":"1205.3728","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3728","created_at":"2026-05-18T03:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3728v1","created_at":"2026-05-18T03:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3728","created_at":"2026-05-18T03:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"IV3BTXSDH7LK","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IV3BTXSDH7LKXLHA","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IV3BTXSD","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IV3BTXSDH7LKXLHAMZLZQ7Z3OJ","target":"record","payload":{"canonical_record":{"source":{"id":"1205.3728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-16T16:32:43Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"a421cc69a7815f4e18950cfcb8c5ac222cac247e83c3209a4efb78e8f639a495","abstract_canon_sha256":"627ef8842dc90cadc9b7d155449e4863b144bfdd64bced7324e73c5dd945fe24"},"schema_version":"1.0"},"canonical_sha256":"457619de433fd6abace06657987f3b72575552a0445698ff635e7495af5cfb19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:25.299645Z","signature_b64":"6kQYhYyip7C1lPbJRgmUKwLWgISTSTGDFQPqe9SNR0Tg6u6XNl4kTAmneYNBhuFsgE+yO8QzeLeSh8I5nGRMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"457619de433fd6abace06657987f3b72575552a0445698ff635e7495af5cfb19","last_reissued_at":"2026-05-18T03:55:25.299110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:25.299110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.3728","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-18T03:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rQuDIIz67+86acDpYXqmmtDH5LStQPBTnchfi32i07LkP+k3AIQdKovq7ukzaSmljdCV8b9ndAkK4tbJRVilCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:47:47.992141Z"},"content_sha256":"fff415d6bda00be79ea9bef786c37d8115e425b822d11bd4bf31d261c55b2ba7","schema_version":"1.0","event_id":"sha256:fff415d6bda00be79ea9bef786c37d8115e425b822d11bd4bf31d261c55b2ba7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IV3BTXSDH7LKXLHAMZLZQ7Z3OJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Domination in Circle Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Christophe Paul, Daniel Gon\\c{c}alves, George B. Mertzios, Ignasi Sau, Nicolas Bousquet, St\\'ephan Thomass\\'e","submitted_at":"2012-05-16T16:32:43Z","abstract_excerpt":"A circle graph is the intersection graph of a set of chords in a circle. Keil [Discrete Applied Mathematics, 42(1):51-63, 1993] proved that Dominating Set, Connected Dominating Set, and Total Dominating Set are NP-complete in circle graphs. To the best of our knowledge, nothing was known about the parameterized complexity of these problems in circle graphs. In this paper we prove the following results, which contribute in this direction:\n  - Dominating Set, Independent Dominating Set, Connected Dominating Set, Total Dominating Set, and Acyclic Dominating Set are W[1]-hard in circle graphs, par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3728","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-18T03:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"33scjXddOaBHHaL4oaOVSFsrbARfQj4zLeoYaNbZdcCTZy4hgkO5dqiTlMJeV9LiZo+TGv6xokgTvA2SOiPXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:47:47.992861Z"},"content_sha256":"c8288b02da1663f854d0e837c7be27358cff5ead5fcda9c3709bf9fb65121249","schema_version":"1.0","event_id":"sha256:c8288b02da1663f854d0e837c7be27358cff5ead5fcda9c3709bf9fb65121249"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IV3BTXSDH7LKXLHAMZLZQ7Z3OJ/bundle.json","state_url":"https://pith.science/pith/IV3BTXSDH7LKXLHAMZLZQ7Z3OJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IV3BTXSDH7LKXLHAMZLZQ7Z3OJ/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-29T17:47:47Z","links":{"resolver":"https://pith.science/pith/IV3BTXSDH7LKXLHAMZLZQ7Z3OJ","bundle":"https://pith.science/pith/IV3BTXSDH7LKXLHAMZLZQ7Z3OJ/bundle.json","state":"https://pith.science/pith/IV3BTXSDH7LKXLHAMZLZQ7Z3OJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IV3BTXSDH7LKXLHAMZLZQ7Z3OJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IV3BTXSDH7LKXLHAMZLZQ7Z3OJ","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":"627ef8842dc90cadc9b7d155449e4863b144bfdd64bced7324e73c5dd945fe24","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-16T16:32:43Z","title_canon_sha256":"a421cc69a7815f4e18950cfcb8c5ac222cac247e83c3209a4efb78e8f639a495"},"schema_version":"1.0","source":{"id":"1205.3728","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3728","created_at":"2026-05-18T03:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3728v1","created_at":"2026-05-18T03:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3728","created_at":"2026-05-18T03:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"IV3BTXSDH7LK","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IV3BTXSDH7LKXLHA","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IV3BTXSD","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:c8288b02da1663f854d0e837c7be27358cff5ead5fcda9c3709bf9fb65121249","target":"graph","created_at":"2026-05-18T03:55:25Z","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":"A circle graph is the intersection graph of a set of chords in a circle. Keil [Discrete Applied Mathematics, 42(1):51-63, 1993] proved that Dominating Set, Connected Dominating Set, and Total Dominating Set are NP-complete in circle graphs. To the best of our knowledge, nothing was known about the parameterized complexity of these problems in circle graphs. In this paper we prove the following results, which contribute in this direction:\n  - Dominating Set, Independent Dominating Set, Connected Dominating Set, Total Dominating Set, and Acyclic Dominating Set are W[1]-hard in circle graphs, par","authors_text":"Christophe Paul, Daniel Gon\\c{c}alves, George B. Mertzios, Ignasi Sau, Nicolas Bousquet, St\\'ephan Thomass\\'e","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-16T16:32:43Z","title":"Parameterized Domination in Circle Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3728","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:fff415d6bda00be79ea9bef786c37d8115e425b822d11bd4bf31d261c55b2ba7","target":"record","created_at":"2026-05-18T03:55:25Z","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":"627ef8842dc90cadc9b7d155449e4863b144bfdd64bced7324e73c5dd945fe24","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-16T16:32:43Z","title_canon_sha256":"a421cc69a7815f4e18950cfcb8c5ac222cac247e83c3209a4efb78e8f639a495"},"schema_version":"1.0","source":{"id":"1205.3728","kind":"arxiv","version":1}},"canonical_sha256":"457619de433fd6abace06657987f3b72575552a0445698ff635e7495af5cfb19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"457619de433fd6abace06657987f3b72575552a0445698ff635e7495af5cfb19","first_computed_at":"2026-05-18T03:55:25.299110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:25.299110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6kQYhYyip7C1lPbJRgmUKwLWgISTSTGDFQPqe9SNR0Tg6u6XNl4kTAmneYNBhuFsgE+yO8QzeLeSh8I5nGRMAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:25.299645Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.3728","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fff415d6bda00be79ea9bef786c37d8115e425b822d11bd4bf31d261c55b2ba7","sha256:c8288b02da1663f854d0e837c7be27358cff5ead5fcda9c3709bf9fb65121249"],"state_sha256":"731af976a3a701a6837e879779e0d1a7574f5ccafd8d9e223c67f52a16ec531f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XwXbZsfIGvRQQGIA5/J6L8oszybuXFKa7i+CcMANA8snguEI6rFTeX/LQoab98q1BJXOr/sYvddxxXH1aGk4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:47:47.996915Z","bundle_sha256":"a75eedbefcab5045a8dadfd441e3f152efb0717161c841e28203949b8687077c"}}