{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ULW7LBL7CR5SAB3XBGSBQVGLK5","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":"05ec028f6955edbfd724dc1d2de76caf902041f44e705c12913a54df63d55dd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-13T17:12:25Z","title_canon_sha256":"20cc29025cef03b5ef02dc6d37744b3dc5bfbc899c27000b87db8e6af58142a3"},"schema_version":"1.0","source":{"id":"1803.04940","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04940","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04940v2","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04940","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"pith_short_12","alias_value":"ULW7LBL7CR5S","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"ULW7LBL7CR5SAB3X","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"ULW7LBL7","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:b2238bd1c048cb8d0b2819d18d65551fd72e780eff20e02062b4f8651b5b366c","target":"graph","created_at":"2026-05-17T23:53:44Z","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 give almost tight conditional lower bounds on the running time of the kHyperPath problem. Given an $r$-uniform hypergraph for some integer $r$, kHyperPath seeks a tight path of length $k$. That is, a sequence of $k$ nodes such that every consecutive $r$ of them constitute a hyperedge in the graph. This problem is a natural generalization of the extensively-studied kPath problem in graphs. We show that solving kHyperPath in time $O^*(2^{(1-\\gamma)k})$ where $\\gamma>0$ is independent of $r$ is probably impossible. Specifically, it implies that Set Cover on $n$ elements can be solved in time $","authors_text":"Lior Kamma, Ohad Trabelsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-13T17:12:25Z","title":"Nearly Optimal Time Bounds for kPath in Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04940","kind":"arxiv","version":2},"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:6fca56d94c8978cb9a069790f5a36218205c20808f2ff277297f57fec9328c74","target":"record","created_at":"2026-05-17T23:53:44Z","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":"05ec028f6955edbfd724dc1d2de76caf902041f44e705c12913a54df63d55dd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-13T17:12:25Z","title_canon_sha256":"20cc29025cef03b5ef02dc6d37744b3dc5bfbc899c27000b87db8e6af58142a3"},"schema_version":"1.0","source":{"id":"1803.04940","kind":"arxiv","version":2}},"canonical_sha256":"a2edf5857f147b20077709a41854cb575276d000a53580c7ade55ab094668366","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2edf5857f147b20077709a41854cb575276d000a53580c7ade55ab094668366","first_computed_at":"2026-05-17T23:53:44.292690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:44.292690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EG9or/gp2ZsgVQANAzokFrUp2R2FlJX1UlQ1nVwm0tcrOob/YXwidtB0l1PqkEXmG5vUTl6orNoWTNO4mXtDAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:44.293231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04940","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fca56d94c8978cb9a069790f5a36218205c20808f2ff277297f57fec9328c74","sha256:b2238bd1c048cb8d0b2819d18d65551fd72e780eff20e02062b4f8651b5b366c"],"state_sha256":"42298fdc8f126311e9ef1cba8fd34e4e2d020cf51a0bfade4a56f31b58f58f90"}