{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PXPZ2CSJUNRZKOS4HRZOD7EBEZ","short_pith_number":"pith:PXPZ2CSJ","canonical_record":{"source":{"id":"1806.09992","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T13:54:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"acc238c7b00c705a644372daa685f3955f7ce030e9a204e5afec97ef222af8be","abstract_canon_sha256":"ea005046b5469ea687612967ba23cbe3657d4f5ffec02d0f2deeca83c05ca7da"},"schema_version":"1.0"},"canonical_sha256":"7ddf9d0a49a363953a5c3c72e1fc812675ac71ccc98b6539f64954d781d06ca1","source":{"kind":"arxiv","id":"1806.09992","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09992","created_at":"2026-05-18T00:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09992v1","created_at":"2026-05-18T00:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09992","created_at":"2026-05-18T00:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"PXPZ2CSJUNRZ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PXPZ2CSJUNRZKOS4","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PXPZ2CSJ","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PXPZ2CSJUNRZKOS4HRZOD7EBEZ","target":"record","payload":{"canonical_record":{"source":{"id":"1806.09992","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T13:54:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"acc238c7b00c705a644372daa685f3955f7ce030e9a204e5afec97ef222af8be","abstract_canon_sha256":"ea005046b5469ea687612967ba23cbe3657d4f5ffec02d0f2deeca83c05ca7da"},"schema_version":"1.0"},"canonical_sha256":"7ddf9d0a49a363953a5c3c72e1fc812675ac71ccc98b6539f64954d781d06ca1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:22.486868Z","signature_b64":"mtLAlCSj0vtyq9U3lrVEJsOB78mptcjx0qcFX92YhEyvNGNppOSa321pBYvaGCNkhx1GYEVkv8b66amP69P5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ddf9d0a49a363953a5c3c72e1fc812675ac71ccc98b6539f64954d781d06ca1","last_reissued_at":"2026-05-18T00:12:22.486249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:22.486249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.09992","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:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rfank+8bNT4/j1B7/YwIDbdTd7eguBhBzlaYm05Jfww+3dgam9PH/gku5YXoretO3F0EHUoMlcgYVRAXquFWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:17:41.285826Z"},"content_sha256":"0d31359320b7e154a4ab4b59787e35b5ab849be060be76f459d4579e39aced8a","schema_version":"1.0","event_id":"sha256:0d31359320b7e154a4ab4b59787e35b5ab849be060be76f459d4579e39aced8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PXPZ2CSJUNRZKOS4HRZOD7EBEZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding a Maximum-Weight Convex Set in a Chordal Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Jean Cardinal, Jean-Paul Doignon, Keno Merckx","submitted_at":"2018-06-26T13:54:51Z","abstract_excerpt":"We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal graph is (monophonically) convex if it contains the vertices of all chordless paths between any two vertices of the set. The problem is to find a maximum-weight convex subset of a given vertex-weighted chordal graph. It generalizes previously studied special cases in trees and split graphs. It also happens to be closely related to the closure problem in partially ordered sets and directed graphs. We give the first polyno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09992","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:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qhXyfpxzgSSJYtlNBTphrlJjOE3rp1ULOPS2sAPNc8kUhkg0F5q6CU++HVvaYaKeib8tM8bxaGJEa6dejTL1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:17:41.286836Z"},"content_sha256":"690c042e5431b87c8df85f9c725f8c82c74e9568962878630a60dcdc0ee1473d","schema_version":"1.0","event_id":"sha256:690c042e5431b87c8df85f9c725f8c82c74e9568962878630a60dcdc0ee1473d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PXPZ2CSJUNRZKOS4HRZOD7EBEZ/bundle.json","state_url":"https://pith.science/pith/PXPZ2CSJUNRZKOS4HRZOD7EBEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PXPZ2CSJUNRZKOS4HRZOD7EBEZ/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-25T13:17:41Z","links":{"resolver":"https://pith.science/pith/PXPZ2CSJUNRZKOS4HRZOD7EBEZ","bundle":"https://pith.science/pith/PXPZ2CSJUNRZKOS4HRZOD7EBEZ/bundle.json","state":"https://pith.science/pith/PXPZ2CSJUNRZKOS4HRZOD7EBEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PXPZ2CSJUNRZKOS4HRZOD7EBEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PXPZ2CSJUNRZKOS4HRZOD7EBEZ","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":"ea005046b5469ea687612967ba23cbe3657d4f5ffec02d0f2deeca83c05ca7da","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T13:54:51Z","title_canon_sha256":"acc238c7b00c705a644372daa685f3955f7ce030e9a204e5afec97ef222af8be"},"schema_version":"1.0","source":{"id":"1806.09992","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09992","created_at":"2026-05-18T00:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09992v1","created_at":"2026-05-18T00:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09992","created_at":"2026-05-18T00:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"PXPZ2CSJUNRZ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PXPZ2CSJUNRZKOS4","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PXPZ2CSJ","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:690c042e5431b87c8df85f9c725f8c82c74e9568962878630a60dcdc0ee1473d","target":"graph","created_at":"2026-05-18T00:12:22Z","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 consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal graph is (monophonically) convex if it contains the vertices of all chordless paths between any two vertices of the set. The problem is to find a maximum-weight convex subset of a given vertex-weighted chordal graph. It generalizes previously studied special cases in trees and split graphs. It also happens to be closely related to the closure problem in partially ordered sets and directed graphs. We give the first polyno","authors_text":"Jean Cardinal, Jean-Paul Doignon, Keno Merckx","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T13:54:51Z","title":"Finding a Maximum-Weight Convex Set in a Chordal Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09992","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:0d31359320b7e154a4ab4b59787e35b5ab849be060be76f459d4579e39aced8a","target":"record","created_at":"2026-05-18T00:12:22Z","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":"ea005046b5469ea687612967ba23cbe3657d4f5ffec02d0f2deeca83c05ca7da","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T13:54:51Z","title_canon_sha256":"acc238c7b00c705a644372daa685f3955f7ce030e9a204e5afec97ef222af8be"},"schema_version":"1.0","source":{"id":"1806.09992","kind":"arxiv","version":1}},"canonical_sha256":"7ddf9d0a49a363953a5c3c72e1fc812675ac71ccc98b6539f64954d781d06ca1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ddf9d0a49a363953a5c3c72e1fc812675ac71ccc98b6539f64954d781d06ca1","first_computed_at":"2026-05-18T00:12:22.486249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:22.486249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mtLAlCSj0vtyq9U3lrVEJsOB78mptcjx0qcFX92YhEyvNGNppOSa321pBYvaGCNkhx1GYEVkv8b66amP69P5Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:22.486868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09992","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d31359320b7e154a4ab4b59787e35b5ab849be060be76f459d4579e39aced8a","sha256:690c042e5431b87c8df85f9c725f8c82c74e9568962878630a60dcdc0ee1473d"],"state_sha256":"aae7f9573771982023f1db86f5fd3b5be76b4b6fb08cf29d698b9d56235fbd5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VBk3p28iqu8wr9xgi3JV8xVZNetotP6wc9EBwizP7c7GsJqDH9Kw4U15aY8GZLzoINshnR1JUwD/yjPl4FqXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:17:41.290699Z","bundle_sha256":"5a74954c4a3cd609904e0ee922d61f2ca9485e4cfb9d113107a90e4a786623ea"}}