{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NETXKX4TLGIVKTHH3GBJGIM6IT","short_pith_number":"pith:NETXKX4T","canonical_record":{"source":{"id":"1808.09853","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-29T14:40:21Z","cross_cats_sorted":[],"title_canon_sha256":"df26a180d1a4bc35a1845f6a2f64cf5a2ecfcc091718d55b68167dbc37e5f275","abstract_canon_sha256":"fffee2c92faa881118ae421709814ef7da38c11af4fc1cc959b5996ce2c9083e"},"schema_version":"1.0"},"canonical_sha256":"6927755f935991554ce7d98293219e44d19b19bd6b7fbc116d5cb2f67c12b0df","source":{"kind":"arxiv","id":"1808.09853","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09853","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09853v1","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09853","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"NETXKX4TLGIV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NETXKX4TLGIVKTHH","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NETXKX4T","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NETXKX4TLGIVKTHH3GBJGIM6IT","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09853","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-29T14:40:21Z","cross_cats_sorted":[],"title_canon_sha256":"df26a180d1a4bc35a1845f6a2f64cf5a2ecfcc091718d55b68167dbc37e5f275","abstract_canon_sha256":"fffee2c92faa881118ae421709814ef7da38c11af4fc1cc959b5996ce2c9083e"},"schema_version":"1.0"},"canonical_sha256":"6927755f935991554ce7d98293219e44d19b19bd6b7fbc116d5cb2f67c12b0df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:54.233162Z","signature_b64":"D9qXRvsxFNt7iYbuy5HZbYQZW6U9CBQsh1g3r8AZjjCG3AUp1+zSodrwJmSZZ91/ZAlozTwo6vQqMccpiUn0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6927755f935991554ce7d98293219e44d19b19bd6b7fbc116d5cb2f67c12b0df","last_reissued_at":"2026-05-18T00:06:54.232499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:54.232499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09853","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:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CGWERqs1CZSSHzWG68sLmvjZ+xJ6MjeKJxjGT2baqT1F1QRIDm+kb+ZJ+cEgNWmJXX4Y+NRFMwviTkQGRVk4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:17:07.022597Z"},"content_sha256":"faead3403e967d45568afe85ebfd205d63f9cd21924e7c48e814946fb40a8155","schema_version":"1.0","event_id":"sha256:faead3403e967d45568afe85ebfd205d63f9cd21924e7c48e814946fb40a8155"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NETXKX4TLGIVKTHH3GBJGIM6IT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Independent Sets in Cocomparability Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Haiko M\\\"uller, Martin Dyer","submitted_at":"2018-08-29T14:40:21Z","abstract_excerpt":"We show that the number of independent sets in cocomparability graphs can be counted in linear time, as can counting cliques in comparability graphs. By contrast, counting cliques in cocomparabilty graphs and counting independent sets in comparability graphs are #P-complete. We extend these results to counting maximal cliques and independent sets. We also consider the fixed-parameter versions of counting cliques and independent sets of given size $k$. Finally, we combine the results to show that both counting cliques and independent sets in permutation graphs are in linear time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09853","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:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hZ9/JZhS6cPoctntvLPgXPmpUcu7Kxeonaf6QoypWwPPzc5WCal2UQlIQUyglXSdJozXnIrujUNZ7VpqE7S+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:17:07.023227Z"},"content_sha256":"744e79e0e540d8d84e0c3006f0383a6aec5b981fdc1ec442fd1d6a1874040498","schema_version":"1.0","event_id":"sha256:744e79e0e540d8d84e0c3006f0383a6aec5b981fdc1ec442fd1d6a1874040498"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NETXKX4TLGIVKTHH3GBJGIM6IT/bundle.json","state_url":"https://pith.science/pith/NETXKX4TLGIVKTHH3GBJGIM6IT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NETXKX4TLGIVKTHH3GBJGIM6IT/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-31T04:17:07Z","links":{"resolver":"https://pith.science/pith/NETXKX4TLGIVKTHH3GBJGIM6IT","bundle":"https://pith.science/pith/NETXKX4TLGIVKTHH3GBJGIM6IT/bundle.json","state":"https://pith.science/pith/NETXKX4TLGIVKTHH3GBJGIM6IT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NETXKX4TLGIVKTHH3GBJGIM6IT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NETXKX4TLGIVKTHH3GBJGIM6IT","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":"fffee2c92faa881118ae421709814ef7da38c11af4fc1cc959b5996ce2c9083e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-29T14:40:21Z","title_canon_sha256":"df26a180d1a4bc35a1845f6a2f64cf5a2ecfcc091718d55b68167dbc37e5f275"},"schema_version":"1.0","source":{"id":"1808.09853","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09853","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09853v1","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09853","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"NETXKX4TLGIV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NETXKX4TLGIVKTHH","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NETXKX4T","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:744e79e0e540d8d84e0c3006f0383a6aec5b981fdc1ec442fd1d6a1874040498","target":"graph","created_at":"2026-05-18T00:06:54Z","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 show that the number of independent sets in cocomparability graphs can be counted in linear time, as can counting cliques in comparability graphs. By contrast, counting cliques in cocomparabilty graphs and counting independent sets in comparability graphs are #P-complete. We extend these results to counting maximal cliques and independent sets. We also consider the fixed-parameter versions of counting cliques and independent sets of given size $k$. Finally, we combine the results to show that both counting cliques and independent sets in permutation graphs are in linear time.","authors_text":"Haiko M\\\"uller, Martin Dyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-29T14:40:21Z","title":"Counting Independent Sets in Cocomparability Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09853","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:faead3403e967d45568afe85ebfd205d63f9cd21924e7c48e814946fb40a8155","target":"record","created_at":"2026-05-18T00:06:54Z","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":"fffee2c92faa881118ae421709814ef7da38c11af4fc1cc959b5996ce2c9083e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-29T14:40:21Z","title_canon_sha256":"df26a180d1a4bc35a1845f6a2f64cf5a2ecfcc091718d55b68167dbc37e5f275"},"schema_version":"1.0","source":{"id":"1808.09853","kind":"arxiv","version":1}},"canonical_sha256":"6927755f935991554ce7d98293219e44d19b19bd6b7fbc116d5cb2f67c12b0df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6927755f935991554ce7d98293219e44d19b19bd6b7fbc116d5cb2f67c12b0df","first_computed_at":"2026-05-18T00:06:54.232499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:54.232499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D9qXRvsxFNt7iYbuy5HZbYQZW6U9CBQsh1g3r8AZjjCG3AUp1+zSodrwJmSZZ91/ZAlozTwo6vQqMccpiUn0Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:54.233162Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09853","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faead3403e967d45568afe85ebfd205d63f9cd21924e7c48e814946fb40a8155","sha256:744e79e0e540d8d84e0c3006f0383a6aec5b981fdc1ec442fd1d6a1874040498"],"state_sha256":"db1331658dc8bb6e2bbaf191485d15b6a4edae0d8bc51016a871ea84c9accfff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LM+s0ykTrtgYUrcVzi9Ckr12wHz2D6V4NGNUDjPL4eMlfKhc1NivRVrhw1mC6wAErEWlWlUmYZmtClmLr/S+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:17:07.026290Z","bundle_sha256":"c6fdf0379aaaa55813a3142d8955a4ef9860ff0a1ce2c82e48bb5e360050ac5a"}}