{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WFZAF4XJCMEYLZX554DIPQKG3W","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":"ab32517811294676036bbce41c56503e4075704df89357f33b3514478299199c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-18T15:41:34Z","title_canon_sha256":"2fec041ad48fbe4f879fca811702e23cd38cccb5dea2cb4a70d271e714d1a564"},"schema_version":"1.0","source":{"id":"1512.05996","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05996","created_at":"2026-05-18T01:24:05Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05996v1","created_at":"2026-05-18T01:24:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05996","created_at":"2026-05-18T01:24:05Z"},{"alias_kind":"pith_short_12","alias_value":"WFZAF4XJCMEY","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WFZAF4XJCMEYLZX5","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WFZAF4XJ","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:e846e14637c4098bd48a3b470b68f3a7974b47d02c100a332b45b80762aac4c6","target":"graph","created_at":"2026-05-18T01:24:05Z","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":"Several well-studied graph problems aim to select a largest (or smallest) induced subgraph with a given property of the input graph. Examples of such problems include maximum independent set, maximum planar graph, and many others. We consider these problems, where the vertices are presented online. With each vertex, the online algorithm must decide whether to include it into the constructed subgraph, based only on the subgraph induced by the vertices presented so far. We study the properties that are common to all these problems by investigating the generalized problem: for a hereditary proper","authors_text":"Christian Kudahl, Dennis Komm, Rastislav Kr\\'alovi\\v{c}, Richard Kr\\'alovi\\v{c}","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-18T15:41:34Z","title":"Advice Complexity of the Online Induced Subgraph Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05996","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:50fe8429112737a54a3c56eda70b67de3af9188a51bc347a75d10687103a6fb5","target":"record","created_at":"2026-05-18T01:24:05Z","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":"ab32517811294676036bbce41c56503e4075704df89357f33b3514478299199c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-18T15:41:34Z","title_canon_sha256":"2fec041ad48fbe4f879fca811702e23cd38cccb5dea2cb4a70d271e714d1a564"},"schema_version":"1.0","source":{"id":"1512.05996","kind":"arxiv","version":1}},"canonical_sha256":"b17202f2e9130985e6fdef0687c146dd8e2d774c18c6c3b5b08d1d08753f27e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b17202f2e9130985e6fdef0687c146dd8e2d774c18c6c3b5b08d1d08753f27e1","first_computed_at":"2026-05-18T01:24:05.691564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:05.691564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1Od43rHjOcaZVeVPgtfepP7S3ImigIIlBDj+lJ+RgFJ2eD8sHpo8cQ9doBqMgVXq8BG2OfOEG9J4dBhl8VccCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:05.692276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05996","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50fe8429112737a54a3c56eda70b67de3af9188a51bc347a75d10687103a6fb5","sha256:e846e14637c4098bd48a3b470b68f3a7974b47d02c100a332b45b80762aac4c6"],"state_sha256":"516abf36dcbc0f9bbc90cf2b970204d493c9436a2df3cca5e82c5c5661a42517"}