{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WHOM6Y6FU3BGIIJPZTDC2VDH3O","short_pith_number":"pith:WHOM6Y6F","canonical_record":{"source":{"id":"1607.01162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-05T09:18:40Z","cross_cats_sorted":[],"title_canon_sha256":"caa90e0799141cec7453f23c646fc9fbfbb75b8f55f81d2878be2e625bfb03b6","abstract_canon_sha256":"c4647ad52791e212fe6434c6b5b1dba1a59fb99df2759d1ecc05b537e22d7094"},"schema_version":"1.0"},"canonical_sha256":"b1dccf63c5a6c264212fccc62d5467dba48e9bf0d8ace10126c4cfbc6f4e5a1c","source":{"kind":"arxiv","id":"1607.01162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01162","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01162v1","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01162","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"pith_short_12","alias_value":"WHOM6Y6FU3BG","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WHOM6Y6FU3BGIIJP","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WHOM6Y6F","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WHOM6Y6FU3BGIIJPZTDC2VDH3O","target":"record","payload":{"canonical_record":{"source":{"id":"1607.01162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-05T09:18:40Z","cross_cats_sorted":[],"title_canon_sha256":"caa90e0799141cec7453f23c646fc9fbfbb75b8f55f81d2878be2e625bfb03b6","abstract_canon_sha256":"c4647ad52791e212fe6434c6b5b1dba1a59fb99df2759d1ecc05b537e22d7094"},"schema_version":"1.0"},"canonical_sha256":"b1dccf63c5a6c264212fccc62d5467dba48e9bf0d8ace10126c4cfbc6f4e5a1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:30.032296Z","signature_b64":"kMq1k4O16TkZabYdZ7cRMEgktvilQM8WK1f3OQSDxUV5OIE5NIWMg2s2k60UfV5oBxh8YmQAM38lJ3L1tfJ+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1dccf63c5a6c264212fccc62d5467dba48e9bf0d8ace10126c4cfbc6f4e5a1c","last_reissued_at":"2026-05-18T01:11:30.031907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:30.031907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.01162","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:11:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xm3T0/2lWrczrU8sBv6E+1VdkjgPtzJn5rOpKx6CX3fhFuTZ7D4t7q3BxMMUsXZHa1Biz+YCFdHabLmyRG9KBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:03:20.898383Z"},"content_sha256":"59aebb2af3ed712a9ae5bd31d14a58c76589736ca94cc5854ab192598d059f1a","schema_version":"1.0","event_id":"sha256:59aebb2af3ed712a9ae5bd31d14a58c76589736ca94cc5854ab192598d059f1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WHOM6Y6FU3BGIIJPZTDC2VDH3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unit Interval Vertex Deletion: Fewer Vertices are Relevant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jianxin Wang, Xiating Ouyang, Yixin Cao, Yuping Ke","submitted_at":"2016-07-05T09:18:40Z","abstract_excerpt":"The unit interval vertex deletion problem asks for a set of at most $k$ vertices whose deletion from an $n$-vertex graph makes it a unit interval graph. We develop an $O(k^4)$-vertex kernel for the problem, significantly improving the $O(k^{53})$-vertex kernel of Fomin, Saurabh, and Villanger [ESA'12; SIAM J. Discrete Math 27(2013)]. We introduce a novel way of organizing cliques of a unit interval graph. Our constructive proof for the correctness of our algorithm, using interval models, greatly simplifies the destructive proofs, based on forbidden induced subgraphs, for similar problems in li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01162","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:11:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jOsQE6FyqCAcdJTFxo8mDHJaOenYTWpQoY/70TPwxsI0k5vPgnAzalNtL+t4phymMLM3+tYyOBIiNYvjvb6JDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:03:20.898760Z"},"content_sha256":"fdb2b9bc1e6252431cac6588e6d016756069e780b5a11f0b236cbd9c7dae3501","schema_version":"1.0","event_id":"sha256:fdb2b9bc1e6252431cac6588e6d016756069e780b5a11f0b236cbd9c7dae3501"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHOM6Y6FU3BGIIJPZTDC2VDH3O/bundle.json","state_url":"https://pith.science/pith/WHOM6Y6FU3BGIIJPZTDC2VDH3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHOM6Y6FU3BGIIJPZTDC2VDH3O/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-28T03:03:20Z","links":{"resolver":"https://pith.science/pith/WHOM6Y6FU3BGIIJPZTDC2VDH3O","bundle":"https://pith.science/pith/WHOM6Y6FU3BGIIJPZTDC2VDH3O/bundle.json","state":"https://pith.science/pith/WHOM6Y6FU3BGIIJPZTDC2VDH3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHOM6Y6FU3BGIIJPZTDC2VDH3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WHOM6Y6FU3BGIIJPZTDC2VDH3O","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":"c4647ad52791e212fe6434c6b5b1dba1a59fb99df2759d1ecc05b537e22d7094","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-05T09:18:40Z","title_canon_sha256":"caa90e0799141cec7453f23c646fc9fbfbb75b8f55f81d2878be2e625bfb03b6"},"schema_version":"1.0","source":{"id":"1607.01162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01162","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01162v1","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01162","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"pith_short_12","alias_value":"WHOM6Y6FU3BG","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WHOM6Y6FU3BGIIJP","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WHOM6Y6F","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:fdb2b9bc1e6252431cac6588e6d016756069e780b5a11f0b236cbd9c7dae3501","target":"graph","created_at":"2026-05-18T01:11:30Z","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":"The unit interval vertex deletion problem asks for a set of at most $k$ vertices whose deletion from an $n$-vertex graph makes it a unit interval graph. We develop an $O(k^4)$-vertex kernel for the problem, significantly improving the $O(k^{53})$-vertex kernel of Fomin, Saurabh, and Villanger [ESA'12; SIAM J. Discrete Math 27(2013)]. We introduce a novel way of organizing cliques of a unit interval graph. Our constructive proof for the correctness of our algorithm, using interval models, greatly simplifies the destructive proofs, based on forbidden induced subgraphs, for similar problems in li","authors_text":"Jianxin Wang, Xiating Ouyang, Yixin Cao, Yuping Ke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-05T09:18:40Z","title":"Unit Interval Vertex Deletion: Fewer Vertices are Relevant"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01162","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:59aebb2af3ed712a9ae5bd31d14a58c76589736ca94cc5854ab192598d059f1a","target":"record","created_at":"2026-05-18T01:11:30Z","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":"c4647ad52791e212fe6434c6b5b1dba1a59fb99df2759d1ecc05b537e22d7094","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-05T09:18:40Z","title_canon_sha256":"caa90e0799141cec7453f23c646fc9fbfbb75b8f55f81d2878be2e625bfb03b6"},"schema_version":"1.0","source":{"id":"1607.01162","kind":"arxiv","version":1}},"canonical_sha256":"b1dccf63c5a6c264212fccc62d5467dba48e9bf0d8ace10126c4cfbc6f4e5a1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1dccf63c5a6c264212fccc62d5467dba48e9bf0d8ace10126c4cfbc6f4e5a1c","first_computed_at":"2026-05-18T01:11:30.031907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:30.031907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kMq1k4O16TkZabYdZ7cRMEgktvilQM8WK1f3OQSDxUV5OIE5NIWMg2s2k60UfV5oBxh8YmQAM38lJ3L1tfJ+Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:30.032296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59aebb2af3ed712a9ae5bd31d14a58c76589736ca94cc5854ab192598d059f1a","sha256:fdb2b9bc1e6252431cac6588e6d016756069e780b5a11f0b236cbd9c7dae3501"],"state_sha256":"94f395aefa253043e6c04b20b1d1ccf1fb9ffb65a15db99869ab6319f4078d77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ffxhN7qDFt6tTMujNs6IRX8ethSAOR5YRok/oWNySW3hou/TRKr8NUIr8rshSAfiZ0cB3Gxh4XqupTivACHWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:03:20.900789Z","bundle_sha256":"768bda397e4eee0fd70868be8fa5611c8a62ba029509fbcf8ae1947540df54f9"}}