{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GWSXDFLY2NPGFEBINSAUYR7UDM","short_pith_number":"pith:GWSXDFLY","canonical_record":{"source":{"id":"1311.4055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-16T13:00:19Z","cross_cats_sorted":[],"title_canon_sha256":"ef5137b2a659466e208cd1b17ff8a81061db0a18fd2502491e179b3af6cb0134","abstract_canon_sha256":"6b6db783b684daf17a8faf21cfcb6f98b77adc6621c0c03741f9c5f8d1b10a99"},"schema_version":"1.0"},"canonical_sha256":"35a5719578d35e6290286c814c47f41b2bd632caa8b2e0ff3647a06a0f841e56","source":{"kind":"arxiv","id":"1311.4055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4055","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4055v1","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4055","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"GWSXDFLY2NPG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GWSXDFLY2NPGFEBI","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GWSXDFLY","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GWSXDFLY2NPGFEBINSAUYR7UDM","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-16T13:00:19Z","cross_cats_sorted":[],"title_canon_sha256":"ef5137b2a659466e208cd1b17ff8a81061db0a18fd2502491e179b3af6cb0134","abstract_canon_sha256":"6b6db783b684daf17a8faf21cfcb6f98b77adc6621c0c03741f9c5f8d1b10a99"},"schema_version":"1.0"},"canonical_sha256":"35a5719578d35e6290286c814c47f41b2bd632caa8b2e0ff3647a06a0f841e56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:53.818213Z","signature_b64":"fbGxsU6elvp6gByhNj2UTQ/dVHGDBVqRWlHrqK+3uikgGOlRp+ltp2rKLw/zbbpgcYsCA9ACuJ0ebUpmDwJjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35a5719578d35e6290286c814c47f41b2bd632caa8b2e0ff3647a06a0f841e56","last_reissued_at":"2026-05-18T03:06:53.817668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:53.817668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4055","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-18T03:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fOvE4LHd3W5/fuql920pbmrBQ2vFp/KZ8ijRAu6wGYLIFWPowtR1FZlkWoKFLjUouK97NWCFB/rh82ZpsK/JBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:24:05.051282Z"},"content_sha256":"e6538851e7b832ea68d0f394d6285101f2fb2aa517ad15eb67cf3dd0ad20eaad","schema_version":"1.0","event_id":"sha256:e6538851e7b832ea68d0f394d6285101f2fb2aa517ad15eb67cf3dd0ad20eaad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GWSXDFLY2NPGFEBINSAUYR7UDM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Largest chordal and interval subgraphs faster than 2^n","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Ivan Bliznets, Micha{\\l} Pilipczuk, Yngve Villanger","submitted_at":"2013-11-16T13:00:19Z","abstract_excerpt":"We prove that in an n-vertex graph, induced chordal and interval subgraphs with the maximum number of vertices can be found in time $O(2^{\\lambda n})$ for some $\\lambda<1$. These are the first algorithms breaking the trivial $2^n n^{O(1)}$ bound of the brute-force search for these problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4055","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-18T03:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3iK87HH+K1p5TistWOlCrDUHhYvLpy8fBFX8yDm7yL5vur+Ej/JsB50ec47uelee9Xm0AFpMfDSfHnCgo9QrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:24:05.051896Z"},"content_sha256":"08ea23547df7e3252925a309afe901992090ccab57a0726f899d9023cd348882","schema_version":"1.0","event_id":"sha256:08ea23547df7e3252925a309afe901992090ccab57a0726f899d9023cd348882"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWSXDFLY2NPGFEBINSAUYR7UDM/bundle.json","state_url":"https://pith.science/pith/GWSXDFLY2NPGFEBINSAUYR7UDM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWSXDFLY2NPGFEBINSAUYR7UDM/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-31T23:24:05Z","links":{"resolver":"https://pith.science/pith/GWSXDFLY2NPGFEBINSAUYR7UDM","bundle":"https://pith.science/pith/GWSXDFLY2NPGFEBINSAUYR7UDM/bundle.json","state":"https://pith.science/pith/GWSXDFLY2NPGFEBINSAUYR7UDM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWSXDFLY2NPGFEBINSAUYR7UDM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GWSXDFLY2NPGFEBINSAUYR7UDM","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":"6b6db783b684daf17a8faf21cfcb6f98b77adc6621c0c03741f9c5f8d1b10a99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-16T13:00:19Z","title_canon_sha256":"ef5137b2a659466e208cd1b17ff8a81061db0a18fd2502491e179b3af6cb0134"},"schema_version":"1.0","source":{"id":"1311.4055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4055","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4055v1","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4055","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"GWSXDFLY2NPG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GWSXDFLY2NPGFEBI","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GWSXDFLY","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:08ea23547df7e3252925a309afe901992090ccab57a0726f899d9023cd348882","target":"graph","created_at":"2026-05-18T03:06:53Z","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 prove that in an n-vertex graph, induced chordal and interval subgraphs with the maximum number of vertices can be found in time $O(2^{\\lambda n})$ for some $\\lambda<1$. These are the first algorithms breaking the trivial $2^n n^{O(1)}$ bound of the brute-force search for these problems.","authors_text":"Fedor V. Fomin, Ivan Bliznets, Micha{\\l} Pilipczuk, Yngve Villanger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-16T13:00:19Z","title":"Largest chordal and interval subgraphs faster than 2^n"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4055","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:e6538851e7b832ea68d0f394d6285101f2fb2aa517ad15eb67cf3dd0ad20eaad","target":"record","created_at":"2026-05-18T03:06:53Z","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":"6b6db783b684daf17a8faf21cfcb6f98b77adc6621c0c03741f9c5f8d1b10a99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-16T13:00:19Z","title_canon_sha256":"ef5137b2a659466e208cd1b17ff8a81061db0a18fd2502491e179b3af6cb0134"},"schema_version":"1.0","source":{"id":"1311.4055","kind":"arxiv","version":1}},"canonical_sha256":"35a5719578d35e6290286c814c47f41b2bd632caa8b2e0ff3647a06a0f841e56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35a5719578d35e6290286c814c47f41b2bd632caa8b2e0ff3647a06a0f841e56","first_computed_at":"2026-05-18T03:06:53.817668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:53.817668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fbGxsU6elvp6gByhNj2UTQ/dVHGDBVqRWlHrqK+3uikgGOlRp+ltp2rKLw/zbbpgcYsCA9ACuJ0ebUpmDwJjCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:53.818213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6538851e7b832ea68d0f394d6285101f2fb2aa517ad15eb67cf3dd0ad20eaad","sha256:08ea23547df7e3252925a309afe901992090ccab57a0726f899d9023cd348882"],"state_sha256":"fa308cf9f33adbe094146546a56d40b81b12caaee1cf32e7284e3ae877b0b3ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XzrovRvZ6Otv9Aj/q/t5CTi3S+FgPWb4oeJ1B76tBfDKERnJciJLAv5GPZbV6qhaVf4FsrsUyMwp0LqHk4puCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:24:05.055052Z","bundle_sha256":"c8825364443fb8fbc76cacfa0f5c971e6198249160b126599c1cba9d2ef37ed3"}}