{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VA6BFVO2H2JPBZDFO7GB3GAZVH","short_pith_number":"pith:VA6BFVO2","canonical_record":{"source":{"id":"2606.18807","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-17T08:23:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"46605919ac51d7777da02b15b5a5dc0083bb3c94052691adbdfd1be066712fcb","abstract_canon_sha256":"8c0b2f6049f2822a400767566db5e8884ac03ebed14a39d5d8e0a7701f709955"},"schema_version":"1.0"},"canonical_sha256":"a83c12d5da3e92f0e46577cc1d9819a9e08c13b8af5f42c9a86cb6e528ff382a","source":{"kind":"arxiv","id":"2606.18807","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18807","created_at":"2026-06-19T16:11:48Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18807v1","created_at":"2026-06-19T16:11:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18807","created_at":"2026-06-19T16:11:48Z"},{"alias_kind":"pith_short_12","alias_value":"VA6BFVO2H2JP","created_at":"2026-06-19T16:11:48Z"},{"alias_kind":"pith_short_16","alias_value":"VA6BFVO2H2JPBZDF","created_at":"2026-06-19T16:11:48Z"},{"alias_kind":"pith_short_8","alias_value":"VA6BFVO2","created_at":"2026-06-19T16:11:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VA6BFVO2H2JPBZDFO7GB3GAZVH","target":"record","payload":{"canonical_record":{"source":{"id":"2606.18807","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-17T08:23:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"46605919ac51d7777da02b15b5a5dc0083bb3c94052691adbdfd1be066712fcb","abstract_canon_sha256":"8c0b2f6049f2822a400767566db5e8884ac03ebed14a39d5d8e0a7701f709955"},"schema_version":"1.0"},"canonical_sha256":"a83c12d5da3e92f0e46577cc1d9819a9e08c13b8af5f42c9a86cb6e528ff382a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:48.079018Z","signature_b64":"t/bezhJ54tgsACnjsdrgXiPDRTuXgKTO+miFlG0Q0IuO9LAyq4lpzyMCUH8c2XJM8CWgxmWKsZ+0ZQaiG4VFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a83c12d5da3e92f0e46577cc1d9819a9e08c13b8af5f42c9a86cb6e528ff382a","last_reissued_at":"2026-06-19T16:11:48.078651Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:48.078651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.18807","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-06-19T16:11:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/RjCtC44X+RHIJxSp9420watWwcQpjyk5KkY3oYB9ndyPSccWlZd1uc8tUDQJJQEPGH7QobnRwPcIDuPDldMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:50:47.201911Z"},"content_sha256":"752c0765749508f9232e371b6ccd4be031b015c97b1cb903de29fc7ad69e069e","schema_version":"1.0","event_id":"sha256:752c0765749508f9232e371b6ccd4be031b015c97b1cb903de29fc7ad69e069e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VA6BFVO2H2JPBZDFO7GB3GAZVH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Augmented Exact Exponential Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Tatiana Belova, Yuriy Dementiev","submitted_at":"2026-06-17T08:23:42Z","abstract_excerpt":"The field of learning-augmented algorithms has demonstrated that machine-learned predictions can bypass worst-case lower bounds across a wide range of problems. So far, however, the focus has been almost exclusively on polynomial-time algorithms, where predictions improve competitive ratios, approximation guarantees, or running times. In this paper, we raise the question of whether predictions can push the frontier of exact exponential-time algorithms for NP-hard problems. We answer this question affirmatively by proposing a general approach that augments an entire family of state-of-the-art e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18807","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.18807/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-19T16:11:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oY+CAy9pZPyWgRsKj2f6v7pQPoTUArTVYPbg1IMaxXMfOwwzX41MRoU3NYIynnkE+8W5SGh98WkBFtadpIPpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:50:47.202282Z"},"content_sha256":"97a4a0fda4a6ee42d3af07bb49ea51bb497c8b0f077df97f4ff7ccc3055a65a5","schema_version":"1.0","event_id":"sha256:97a4a0fda4a6ee42d3af07bb49ea51bb497c8b0f077df97f4ff7ccc3055a65a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VA6BFVO2H2JPBZDFO7GB3GAZVH/bundle.json","state_url":"https://pith.science/pith/VA6BFVO2H2JPBZDFO7GB3GAZVH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VA6BFVO2H2JPBZDFO7GB3GAZVH/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-28T13:50:47Z","links":{"resolver":"https://pith.science/pith/VA6BFVO2H2JPBZDFO7GB3GAZVH","bundle":"https://pith.science/pith/VA6BFVO2H2JPBZDFO7GB3GAZVH/bundle.json","state":"https://pith.science/pith/VA6BFVO2H2JPBZDFO7GB3GAZVH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VA6BFVO2H2JPBZDFO7GB3GAZVH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VA6BFVO2H2JPBZDFO7GB3GAZVH","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":"8c0b2f6049f2822a400767566db5e8884ac03ebed14a39d5d8e0a7701f709955","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-17T08:23:42Z","title_canon_sha256":"46605919ac51d7777da02b15b5a5dc0083bb3c94052691adbdfd1be066712fcb"},"schema_version":"1.0","source":{"id":"2606.18807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18807","created_at":"2026-06-19T16:11:48Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18807v1","created_at":"2026-06-19T16:11:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18807","created_at":"2026-06-19T16:11:48Z"},{"alias_kind":"pith_short_12","alias_value":"VA6BFVO2H2JP","created_at":"2026-06-19T16:11:48Z"},{"alias_kind":"pith_short_16","alias_value":"VA6BFVO2H2JPBZDF","created_at":"2026-06-19T16:11:48Z"},{"alias_kind":"pith_short_8","alias_value":"VA6BFVO2","created_at":"2026-06-19T16:11:48Z"}],"graph_snapshots":[{"event_id":"sha256:97a4a0fda4a6ee42d3af07bb49ea51bb497c8b0f077df97f4ff7ccc3055a65a5","target":"graph","created_at":"2026-06-19T16:11:48Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.18807/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The field of learning-augmented algorithms has demonstrated that machine-learned predictions can bypass worst-case lower bounds across a wide range of problems. So far, however, the focus has been almost exclusively on polynomial-time algorithms, where predictions improve competitive ratios, approximation guarantees, or running times. In this paper, we raise the question of whether predictions can push the frontier of exact exponential-time algorithms for NP-hard problems. We answer this question affirmatively by proposing a general approach that augments an entire family of state-of-the-art e","authors_text":"Danil Sagunov, Tatiana Belova, Yuriy Dementiev","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-17T08:23:42Z","title":"Learning Augmented Exact Exponential Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18807","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:752c0765749508f9232e371b6ccd4be031b015c97b1cb903de29fc7ad69e069e","target":"record","created_at":"2026-06-19T16:11:48Z","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":"8c0b2f6049f2822a400767566db5e8884ac03ebed14a39d5d8e0a7701f709955","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-17T08:23:42Z","title_canon_sha256":"46605919ac51d7777da02b15b5a5dc0083bb3c94052691adbdfd1be066712fcb"},"schema_version":"1.0","source":{"id":"2606.18807","kind":"arxiv","version":1}},"canonical_sha256":"a83c12d5da3e92f0e46577cc1d9819a9e08c13b8af5f42c9a86cb6e528ff382a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a83c12d5da3e92f0e46577cc1d9819a9e08c13b8af5f42c9a86cb6e528ff382a","first_computed_at":"2026-06-19T16:11:48.078651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:11:48.078651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t/bezhJ54tgsACnjsdrgXiPDRTuXgKTO+miFlG0Q0IuO9LAyq4lpzyMCUH8c2XJM8CWgxmWKsZ+0ZQaiG4VFBQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:11:48.079018Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.18807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:752c0765749508f9232e371b6ccd4be031b015c97b1cb903de29fc7ad69e069e","sha256:97a4a0fda4a6ee42d3af07bb49ea51bb497c8b0f077df97f4ff7ccc3055a65a5"],"state_sha256":"63c04a4edd3aba008ffa89f7b3dd2966db980d81ff5d5e72785ac0a46cd1444a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGDNxZuEdi88esZxOFU/DnLd+1V7FAI0zFO835SX+yIpEt8qla/CqpnGj/COSVYdnzwF1dHRHnYuKPS1tagtAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T13:50:47.204360Z","bundle_sha256":"2061392be29de95d13e7a74bf8fc60cae984dfd04abdb5baba6e338f5dce68b4"}}