{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XZWSFFIV2ORMIGU7EBOIEJ5DCF","short_pith_number":"pith:XZWSFFIV","canonical_record":{"source":{"id":"1304.6450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-24T00:21:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"509549ee482f59d69f306515090b8ee665ae48f9c258216d1a75a20c46ccabf9","abstract_canon_sha256":"9decd9d5c413c4372476d1bfaedd79e589f03e30ae6535f9693607057d929a2c"},"schema_version":"1.0"},"canonical_sha256":"be6d229515d3a2c41a9f205c8227a3116cf451b0d02a9646dbd682001664f7c2","source":{"kind":"arxiv","id":"1304.6450","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6450","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6450v1","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6450","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"XZWSFFIV2ORM","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XZWSFFIV2ORMIGU7","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XZWSFFIV","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XZWSFFIV2ORMIGU7EBOIEJ5DCF","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-24T00:21:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"509549ee482f59d69f306515090b8ee665ae48f9c258216d1a75a20c46ccabf9","abstract_canon_sha256":"9decd9d5c413c4372476d1bfaedd79e589f03e30ae6535f9693607057d929a2c"},"schema_version":"1.0"},"canonical_sha256":"be6d229515d3a2c41a9f205c8227a3116cf451b0d02a9646dbd682001664f7c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:13.090848Z","signature_b64":"XiR4YlMe9UB95qcEPNmyqPLptML5Z41WQSiCW/dw4dz4XkQ7s2XckqrbB+YteDpNlSyed+zLja1lG82C7motDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be6d229515d3a2c41a9f205c8227a3116cf451b0d02a9646dbd682001664f7c2","last_reissued_at":"2026-05-18T03:27:13.090271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:13.090271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6450","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:27:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X5ALL4vHdp06SYi8EXMHuQDsAg+rDYclk0rzBM3BeVfAp5iqhTNQCExiE8fhhJyQ9n8nwvIDGDo5Cy73XSbqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:38:16.949230Z"},"content_sha256":"f346257c9ff3bc50ff77f8895bc80089549bc3a89a339c13101d519836ccb0de","schema_version":"1.0","event_id":"sha256:f346257c9ff3bc50ff77f8895bc80089549bc3a89a339c13101d519836ccb0de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XZWSFFIV2ORMIGU7EBOIEJ5DCF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On independence domination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hsiang Hsuan Liu, Sheung-Hung Poon, Ton Kloks, Wing-Kai Hon, Yue-Li Wang","submitted_at":"2013-04-24T00:21:35Z","abstract_excerpt":"Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of independence domination for graphs in several graph classes related to cographs. We present an exact exponential algorithm. We also present a PTAS for planar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6450","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:27:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G896g+1gEY0T/D0zeXIdv0pyb1IEHKEiEZPTkj/p+vubHEV+dZfVefyhM/oJaGMmbpB8LckDcqBHcHPa4iuQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:38:16.949917Z"},"content_sha256":"c97490151fe4e3172720b4acb2a2c5382444f08f943063bb3743ec4b0a107752","schema_version":"1.0","event_id":"sha256:c97490151fe4e3172720b4acb2a2c5382444f08f943063bb3743ec4b0a107752"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZWSFFIV2ORMIGU7EBOIEJ5DCF/bundle.json","state_url":"https://pith.science/pith/XZWSFFIV2ORMIGU7EBOIEJ5DCF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZWSFFIV2ORMIGU7EBOIEJ5DCF/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-30T10:38:16Z","links":{"resolver":"https://pith.science/pith/XZWSFFIV2ORMIGU7EBOIEJ5DCF","bundle":"https://pith.science/pith/XZWSFFIV2ORMIGU7EBOIEJ5DCF/bundle.json","state":"https://pith.science/pith/XZWSFFIV2ORMIGU7EBOIEJ5DCF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZWSFFIV2ORMIGU7EBOIEJ5DCF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XZWSFFIV2ORMIGU7EBOIEJ5DCF","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":"9decd9d5c413c4372476d1bfaedd79e589f03e30ae6535f9693607057d929a2c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-24T00:21:35Z","title_canon_sha256":"509549ee482f59d69f306515090b8ee665ae48f9c258216d1a75a20c46ccabf9"},"schema_version":"1.0","source":{"id":"1304.6450","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6450","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6450v1","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6450","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"XZWSFFIV2ORM","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XZWSFFIV2ORMIGU7","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XZWSFFIV","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:c97490151fe4e3172720b4acb2a2c5382444f08f943063bb3743ec4b0a107752","target":"graph","created_at":"2026-05-18T03:27:13Z","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":"Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of independence domination for graphs in several graph classes related to cographs. We present an exact exponential algorithm. We also present a PTAS for planar graphs.","authors_text":"Hsiang Hsuan Liu, Sheung-Hung Poon, Ton Kloks, Wing-Kai Hon, Yue-Li Wang","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-24T00:21:35Z","title":"On independence domination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6450","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:f346257c9ff3bc50ff77f8895bc80089549bc3a89a339c13101d519836ccb0de","target":"record","created_at":"2026-05-18T03:27:13Z","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":"9decd9d5c413c4372476d1bfaedd79e589f03e30ae6535f9693607057d929a2c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-24T00:21:35Z","title_canon_sha256":"509549ee482f59d69f306515090b8ee665ae48f9c258216d1a75a20c46ccabf9"},"schema_version":"1.0","source":{"id":"1304.6450","kind":"arxiv","version":1}},"canonical_sha256":"be6d229515d3a2c41a9f205c8227a3116cf451b0d02a9646dbd682001664f7c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be6d229515d3a2c41a9f205c8227a3116cf451b0d02a9646dbd682001664f7c2","first_computed_at":"2026-05-18T03:27:13.090271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:13.090271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XiR4YlMe9UB95qcEPNmyqPLptML5Z41WQSiCW/dw4dz4XkQ7s2XckqrbB+YteDpNlSyed+zLja1lG82C7motDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:13.090848Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6450","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f346257c9ff3bc50ff77f8895bc80089549bc3a89a339c13101d519836ccb0de","sha256:c97490151fe4e3172720b4acb2a2c5382444f08f943063bb3743ec4b0a107752"],"state_sha256":"6bb6ec2351526a058bc561361494dc3ec83a1c23c90f94a3dd0aad87afe36679"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MJ0Nyrn67UsBtFmwS+fIu+Ml1BUb3rmLCgNCCBMiR8eJp5CIsWYhApIEgAeJc2yiRKFWrGGd6zPE4KD9tMISBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:38:16.953242Z","bundle_sha256":"cac317601dc4ed38def70c7a006cce985241cf8720f333560d3da129d8b06886"}}