{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IR5BRHGOXHUWXHDRSGDWMUHLMI","short_pith_number":"pith:IR5BRHGO","canonical_record":{"source":{"id":"1611.02002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-07T11:54:18Z","cross_cats_sorted":[],"title_canon_sha256":"b47b28ac2524837fa589679fb4ed952ec74716a8e9e3c6cbaf6c96c7e70e2fc2","abstract_canon_sha256":"a4b4c731c2a68004bf01e36189e1a949825fe59c75247cc3f979636bee800f06"},"schema_version":"1.0"},"canonical_sha256":"447a189cceb9e96b9c7191876650eb62028d9131efa3067bba957e2d426ac766","source":{"kind":"arxiv","id":"1611.02002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02002","created_at":"2026-05-18T01:00:03Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02002v1","created_at":"2026-05-18T01:00:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02002","created_at":"2026-05-18T01:00:03Z"},{"alias_kind":"pith_short_12","alias_value":"IR5BRHGOXHUW","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IR5BRHGOXHUWXHDR","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IR5BRHGO","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IR5BRHGOXHUWXHDRSGDWMUHLMI","target":"record","payload":{"canonical_record":{"source":{"id":"1611.02002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-07T11:54:18Z","cross_cats_sorted":[],"title_canon_sha256":"b47b28ac2524837fa589679fb4ed952ec74716a8e9e3c6cbaf6c96c7e70e2fc2","abstract_canon_sha256":"a4b4c731c2a68004bf01e36189e1a949825fe59c75247cc3f979636bee800f06"},"schema_version":"1.0"},"canonical_sha256":"447a189cceb9e96b9c7191876650eb62028d9131efa3067bba957e2d426ac766","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:03.971979Z","signature_b64":"up3gwV7XioOdas4wn5QNN0osI/e2lVWc9mHQFgkIqWQsb7FJPPSDOhrwMWqNKXfXw8Cc25DunHp9Zjp6lAxSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"447a189cceb9e96b9c7191876650eb62028d9131efa3067bba957e2d426ac766","last_reissued_at":"2026-05-18T01:00:03.971396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:03.971396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.02002","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-18T01:00:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b5XAchwd77Y9v96XpICSrWnuJd9IOVR2XUyGCSKfRXz6ExltmjgoVTijq07Mjuk6HYn01Y5M5kBPxgvERFFSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:33:13.191156Z"},"content_sha256":"221151cc7f0065f0af83b1e45ad56b1480dbe2bc8d0da3a83de8563b51738ece","schema_version":"1.0","event_id":"sha256:221151cc7f0065f0af83b1e45ad56b1480dbe2bc8d0da3a83de8563b51738ece"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IR5BRHGOXHUWXHDRSGDWMUHLMI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal cliques structure for cocomparability graphs and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Derek G. Corneil, J\\'er\\'emie Dusart, Michel Habib","submitted_at":"2016-11-07T11:54:18Z","abstract_excerpt":"A cocomparability graph is a graph whose complement admits a transitive orientation. An interval graph is the intersection graph of a family of intervals on the real line. In this paper we investigate the relationships between interval and cocomparability graphs. This study is motivated by recent results Corneil,Dalton, Habib (2013) and Dusart, Habib (2016) and that show that for some problems, the algorithm used on interval graphs can also be used with small modifications on cocomparability graphs. Many of these algorithms are based on graph searches that preserve cocomparability orderings.\n "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02002","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-18T01:00:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jUkxPXvhnaSMHjJQWuQBBD3Ripm+TuVeuXgAITSfMspO4zVlYcRCHzLYTMFnmpR5ilPwEGz1MI6S5Crs4uVDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:33:13.191514Z"},"content_sha256":"d3da3f72bd4c97fd7870d2b6ae92a626fbb66dbafaed627cabdbd245018be43e","schema_version":"1.0","event_id":"sha256:d3da3f72bd4c97fd7870d2b6ae92a626fbb66dbafaed627cabdbd245018be43e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IR5BRHGOXHUWXHDRSGDWMUHLMI/bundle.json","state_url":"https://pith.science/pith/IR5BRHGOXHUWXHDRSGDWMUHLMI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IR5BRHGOXHUWXHDRSGDWMUHLMI/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-05T16:33:13Z","links":{"resolver":"https://pith.science/pith/IR5BRHGOXHUWXHDRSGDWMUHLMI","bundle":"https://pith.science/pith/IR5BRHGOXHUWXHDRSGDWMUHLMI/bundle.json","state":"https://pith.science/pith/IR5BRHGOXHUWXHDRSGDWMUHLMI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IR5BRHGOXHUWXHDRSGDWMUHLMI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IR5BRHGOXHUWXHDRSGDWMUHLMI","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":"a4b4c731c2a68004bf01e36189e1a949825fe59c75247cc3f979636bee800f06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-07T11:54:18Z","title_canon_sha256":"b47b28ac2524837fa589679fb4ed952ec74716a8e9e3c6cbaf6c96c7e70e2fc2"},"schema_version":"1.0","source":{"id":"1611.02002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02002","created_at":"2026-05-18T01:00:03Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02002v1","created_at":"2026-05-18T01:00:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02002","created_at":"2026-05-18T01:00:03Z"},{"alias_kind":"pith_short_12","alias_value":"IR5BRHGOXHUW","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IR5BRHGOXHUWXHDR","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IR5BRHGO","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:d3da3f72bd4c97fd7870d2b6ae92a626fbb66dbafaed627cabdbd245018be43e","target":"graph","created_at":"2026-05-18T01:00:03Z","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 cocomparability graph is a graph whose complement admits a transitive orientation. An interval graph is the intersection graph of a family of intervals on the real line. In this paper we investigate the relationships between interval and cocomparability graphs. This study is motivated by recent results Corneil,Dalton, Habib (2013) and Dusart, Habib (2016) and that show that for some problems, the algorithm used on interval graphs can also be used with small modifications on cocomparability graphs. Many of these algorithms are based on graph searches that preserve cocomparability orderings.\n ","authors_text":"Derek G. Corneil, J\\'er\\'emie Dusart, Michel Habib","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-07T11:54:18Z","title":"Maximal cliques structure for cocomparability graphs and applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02002","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:221151cc7f0065f0af83b1e45ad56b1480dbe2bc8d0da3a83de8563b51738ece","target":"record","created_at":"2026-05-18T01:00:03Z","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":"a4b4c731c2a68004bf01e36189e1a949825fe59c75247cc3f979636bee800f06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-07T11:54:18Z","title_canon_sha256":"b47b28ac2524837fa589679fb4ed952ec74716a8e9e3c6cbaf6c96c7e70e2fc2"},"schema_version":"1.0","source":{"id":"1611.02002","kind":"arxiv","version":1}},"canonical_sha256":"447a189cceb9e96b9c7191876650eb62028d9131efa3067bba957e2d426ac766","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"447a189cceb9e96b9c7191876650eb62028d9131efa3067bba957e2d426ac766","first_computed_at":"2026-05-18T01:00:03.971396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:03.971396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"up3gwV7XioOdas4wn5QNN0osI/e2lVWc9mHQFgkIqWQsb7FJPPSDOhrwMWqNKXfXw8Cc25DunHp9Zjp6lAxSAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:03.971979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:221151cc7f0065f0af83b1e45ad56b1480dbe2bc8d0da3a83de8563b51738ece","sha256:d3da3f72bd4c97fd7870d2b6ae92a626fbb66dbafaed627cabdbd245018be43e"],"state_sha256":"e1dea21435db1deeab292b35d9e1b0678d9b6b9d49beeced12d654cfa9909ebe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YUJupaFYzp0uX169PPM5L/GyUVP/MFZjm5jnrYG/lYo9pzMGpO0eXlF722wi7uFgosOW4cg7IZcnj+YzHJ9MCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:33:13.193439Z","bundle_sha256":"2963886a1d97eb8bda272b7193add19929524b830a97fd9948e5962f457cbb37"}}