{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R4QVE5C6TIQY7GO7HO6G2UZJEM","short_pith_number":"pith:R4QVE5C6","canonical_record":{"source":{"id":"1808.08817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-24T16:09:02Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"ad64e62db22311f32b0f6e533cd9920d40acf757d22b9670dfa47349fc5fdb91","abstract_canon_sha256":"d26664ed84b29550e1b0d9a34cf4950cdfbf4f86a35504458e1603aa421e837b"},"schema_version":"1.0"},"canonical_sha256":"8f2152745e9a218f99df3bbc6d5329231acf90f277408ace71a8c61d949cfefc","source":{"kind":"arxiv","id":"1808.08817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08817","created_at":"2026-05-18T00:07:13Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08817v1","created_at":"2026-05-18T00:07:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08817","created_at":"2026-05-18T00:07:13Z"},{"alias_kind":"pith_short_12","alias_value":"R4QVE5C6TIQY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R4QVE5C6TIQY7GO7","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R4QVE5C6","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R4QVE5C6TIQY7GO7HO6G2UZJEM","target":"record","payload":{"canonical_record":{"source":{"id":"1808.08817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-24T16:09:02Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"ad64e62db22311f32b0f6e533cd9920d40acf757d22b9670dfa47349fc5fdb91","abstract_canon_sha256":"d26664ed84b29550e1b0d9a34cf4950cdfbf4f86a35504458e1603aa421e837b"},"schema_version":"1.0"},"canonical_sha256":"8f2152745e9a218f99df3bbc6d5329231acf90f277408ace71a8c61d949cfefc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:13.142493Z","signature_b64":"T8fvrQ+w2CJZHuKbbx9t1V0udpdkQyTD0LbN2sivTfBBBdTVNi4GzZeLWxU85MLb0EQUkEE+Wdo4mudbIueqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f2152745e9a218f99df3bbc6d5329231acf90f277408ace71a8c61d949cfefc","last_reissued_at":"2026-05-18T00:07:13.141825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:13.141825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.08817","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:07:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IcjKLNUpDgHwST9bUxaMXTitj59F65lYVjG3SpCE0SoAx2OONil27mSL0UhXDpFbAgT6x/ggEXOU7r8AKebnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:56:59.267026Z"},"content_sha256":"972d55a7b00ff17d6e64748e9252a420882faad224f4d23b407979b27e35e189","schema_version":"1.0","event_id":"sha256:972d55a7b00ff17d6e64748e9252a420882faad224f4d23b407979b27e35e189"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R4QVE5C6TIQY7GO7HO6G2UZJEM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Detecting strong cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Ademir Hujdurovi\\'c, Bernard Ries, Martin Milani\\v{c}","submitted_at":"2018-08-24T16:09:02Z","abstract_excerpt":"A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliques in graphs and almost completely determine their complexity in the classes of chordal graphs, weakly chordal graphs, line graphs and their complements, and graphs of maximum degree at most three. Our results rely on connections with matchings and relate to several graph properties studied in the literature, including well-covered graphs, localizable graphs, and general partition graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08817","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:07:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v2B4aHRthRFexaNGuX7zfjY2HT+oakndtmqM39ESUPppFiQuwpiRo5R3sqIhzEiDT6ckReu+G2UTJ9AzsaX3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:56:59.267657Z"},"content_sha256":"374a892335d761276043f2f4ae4f38d9f6cfe0b85d28b77f4ec6c42227c4b192","schema_version":"1.0","event_id":"sha256:374a892335d761276043f2f4ae4f38d9f6cfe0b85d28b77f4ec6c42227c4b192"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R4QVE5C6TIQY7GO7HO6G2UZJEM/bundle.json","state_url":"https://pith.science/pith/R4QVE5C6TIQY7GO7HO6G2UZJEM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R4QVE5C6TIQY7GO7HO6G2UZJEM/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-28T17:56:59Z","links":{"resolver":"https://pith.science/pith/R4QVE5C6TIQY7GO7HO6G2UZJEM","bundle":"https://pith.science/pith/R4QVE5C6TIQY7GO7HO6G2UZJEM/bundle.json","state":"https://pith.science/pith/R4QVE5C6TIQY7GO7HO6G2UZJEM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R4QVE5C6TIQY7GO7HO6G2UZJEM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R4QVE5C6TIQY7GO7HO6G2UZJEM","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":"d26664ed84b29550e1b0d9a34cf4950cdfbf4f86a35504458e1603aa421e837b","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-24T16:09:02Z","title_canon_sha256":"ad64e62db22311f32b0f6e533cd9920d40acf757d22b9670dfa47349fc5fdb91"},"schema_version":"1.0","source":{"id":"1808.08817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08817","created_at":"2026-05-18T00:07:13Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08817v1","created_at":"2026-05-18T00:07:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08817","created_at":"2026-05-18T00:07:13Z"},{"alias_kind":"pith_short_12","alias_value":"R4QVE5C6TIQY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R4QVE5C6TIQY7GO7","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R4QVE5C6","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:374a892335d761276043f2f4ae4f38d9f6cfe0b85d28b77f4ec6c42227c4b192","target":"graph","created_at":"2026-05-18T00:07: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":"A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliques in graphs and almost completely determine their complexity in the classes of chordal graphs, weakly chordal graphs, line graphs and their complements, and graphs of maximum degree at most three. Our results rely on connections with matchings and relate to several graph properties studied in the literature, including well-covered graphs, localizable graphs, and general partition graphs.","authors_text":"Ademir Hujdurovi\\'c, Bernard Ries, Martin Milani\\v{c}","cross_cats":["cs.CC","cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-24T16:09:02Z","title":"Detecting strong cliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08817","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:972d55a7b00ff17d6e64748e9252a420882faad224f4d23b407979b27e35e189","target":"record","created_at":"2026-05-18T00:07: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":"d26664ed84b29550e1b0d9a34cf4950cdfbf4f86a35504458e1603aa421e837b","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-24T16:09:02Z","title_canon_sha256":"ad64e62db22311f32b0f6e533cd9920d40acf757d22b9670dfa47349fc5fdb91"},"schema_version":"1.0","source":{"id":"1808.08817","kind":"arxiv","version":1}},"canonical_sha256":"8f2152745e9a218f99df3bbc6d5329231acf90f277408ace71a8c61d949cfefc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f2152745e9a218f99df3bbc6d5329231acf90f277408ace71a8c61d949cfefc","first_computed_at":"2026-05-18T00:07:13.141825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:13.141825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T8fvrQ+w2CJZHuKbbx9t1V0udpdkQyTD0LbN2sivTfBBBdTVNi4GzZeLWxU85MLb0EQUkEE+Wdo4mudbIueqDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:13.142493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.08817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:972d55a7b00ff17d6e64748e9252a420882faad224f4d23b407979b27e35e189","sha256:374a892335d761276043f2f4ae4f38d9f6cfe0b85d28b77f4ec6c42227c4b192"],"state_sha256":"8689e064c7322a0c481740033155f5e45364c079a50c103d3b6f27d2977f4af0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhfqUxzcJxuzvPni9Fdr9pSilc7kz6mvEi7lc9TwhXe94+x/gpJ1HQ780ZQH/l0qInRWd4RYvJe2aQ6Fh0DoCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:56:59.271047Z","bundle_sha256":"c289fcf0f727cfd88a1ad588ccce6badae377451859ae38bc5460d9fbec4fa59"}}