{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5FL5VWBNIK3JII4ACECV5XPTMH","short_pith_number":"pith:5FL5VWBN","canonical_record":{"source":{"id":"1608.03439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-11T12:48:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9e7ebbf74ad22a18af5706419ee06db43935afda80d9a36e3144371e4aea2e43","abstract_canon_sha256":"d9b3b215e31d2d57408cf83f08e7940f91351c8ef203b3643a0660a4af986c8a"},"schema_version":"1.0"},"canonical_sha256":"e957dad82d42b694238011055eddf361d697d0e40857fa2e28317997e542be1c","source":{"kind":"arxiv","id":"1608.03439","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03439","created_at":"2026-05-18T01:09:28Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03439v1","created_at":"2026-05-18T01:09:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03439","created_at":"2026-05-18T01:09:28Z"},{"alias_kind":"pith_short_12","alias_value":"5FL5VWBNIK3J","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5FL5VWBNIK3JII4A","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5FL5VWBN","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5FL5VWBNIK3JII4ACECV5XPTMH","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-11T12:48:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9e7ebbf74ad22a18af5706419ee06db43935afda80d9a36e3144371e4aea2e43","abstract_canon_sha256":"d9b3b215e31d2d57408cf83f08e7940f91351c8ef203b3643a0660a4af986c8a"},"schema_version":"1.0"},"canonical_sha256":"e957dad82d42b694238011055eddf361d697d0e40857fa2e28317997e542be1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:28.921249Z","signature_b64":"qC00gxbDVapOixCiDlREt20pGcNurs/eAG5CjJ4JEZwSwbEXL//pjEA5S268EVMIGcjODrsZbJZOzL5JvnMJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e957dad82d42b694238011055eddf361d697d0e40857fa2e28317997e542be1c","last_reissued_at":"2026-05-18T01:09:28.920759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:28.920759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03439","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:09:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XB2izv0QeIP/fVUzNQqYZLtSTC8Pp+GqRMnyTuyf6277QKk0oGZhrHDDWnKTwc0q3uZaNKCOnaXk9bgfnKd0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:04:08.297983Z"},"content_sha256":"f0aad1619331ac2d161412a3d6e555a5bd07557a26ee56bdf97485050d88a749","schema_version":"1.0","event_id":"sha256:f0aad1619331ac2d161412a3d6e555a5bd07557a26ee56bdf97485050d88a749"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5FL5VWBNIK3JII4ACECV5XPTMH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Large Set Covers Faster via the Representation Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jesper Nederlof","submitted_at":"2016-08-11T12:48:39Z","abstract_excerpt":"The worst-case fastest known algorithm for the Set Cover problem on universes with $n$ elements still essentially is the simple $O^*(2^n)$-time dynamic programming algorithm, and no non-trivial consequences of an $O^*(1.01^n)$-time algorithm are known. Motivated by this chasm, we study the following natural question: Which instances of Set Cover can we solve faster than the simple dynamic programming algorithm? Specifically, we give a Monte Carlo algorithm that determines the existence of a set cover of size $\\sigma n$ in $O^*(2^{(1-\\Omega(\\sigma^4))n})$ time. Our approach is also applicable t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03439","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:09:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxrPMIeLIoIfAEvaxKbDqfg8kWc/TANxG6/S0db++XtgazVWrFJT7wF0/TuqjXxUeOf+JHveLlffH2wVr+9kBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:04:08.298346Z"},"content_sha256":"f48810d66659c7c42a5435d81f857154bdf76e2934e9d5bccaa4082c49308c28","schema_version":"1.0","event_id":"sha256:f48810d66659c7c42a5435d81f857154bdf76e2934e9d5bccaa4082c49308c28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5FL5VWBNIK3JII4ACECV5XPTMH/bundle.json","state_url":"https://pith.science/pith/5FL5VWBNIK3JII4ACECV5XPTMH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5FL5VWBNIK3JII4ACECV5XPTMH/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-05T14:04:08Z","links":{"resolver":"https://pith.science/pith/5FL5VWBNIK3JII4ACECV5XPTMH","bundle":"https://pith.science/pith/5FL5VWBNIK3JII4ACECV5XPTMH/bundle.json","state":"https://pith.science/pith/5FL5VWBNIK3JII4ACECV5XPTMH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5FL5VWBNIK3JII4ACECV5XPTMH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5FL5VWBNIK3JII4ACECV5XPTMH","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":"d9b3b215e31d2d57408cf83f08e7940f91351c8ef203b3643a0660a4af986c8a","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-11T12:48:39Z","title_canon_sha256":"9e7ebbf74ad22a18af5706419ee06db43935afda80d9a36e3144371e4aea2e43"},"schema_version":"1.0","source":{"id":"1608.03439","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03439","created_at":"2026-05-18T01:09:28Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03439v1","created_at":"2026-05-18T01:09:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03439","created_at":"2026-05-18T01:09:28Z"},{"alias_kind":"pith_short_12","alias_value":"5FL5VWBNIK3J","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5FL5VWBNIK3JII4A","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5FL5VWBN","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:f48810d66659c7c42a5435d81f857154bdf76e2934e9d5bccaa4082c49308c28","target":"graph","created_at":"2026-05-18T01:09:28Z","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 worst-case fastest known algorithm for the Set Cover problem on universes with $n$ elements still essentially is the simple $O^*(2^n)$-time dynamic programming algorithm, and no non-trivial consequences of an $O^*(1.01^n)$-time algorithm are known. Motivated by this chasm, we study the following natural question: Which instances of Set Cover can we solve faster than the simple dynamic programming algorithm? Specifically, we give a Monte Carlo algorithm that determines the existence of a set cover of size $\\sigma n$ in $O^*(2^{(1-\\Omega(\\sigma^4))n})$ time. Our approach is also applicable t","authors_text":"Jesper Nederlof","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-11T12:48:39Z","title":"Finding Large Set Covers Faster via the Representation Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03439","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:f0aad1619331ac2d161412a3d6e555a5bd07557a26ee56bdf97485050d88a749","target":"record","created_at":"2026-05-18T01:09:28Z","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":"d9b3b215e31d2d57408cf83f08e7940f91351c8ef203b3643a0660a4af986c8a","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-11T12:48:39Z","title_canon_sha256":"9e7ebbf74ad22a18af5706419ee06db43935afda80d9a36e3144371e4aea2e43"},"schema_version":"1.0","source":{"id":"1608.03439","kind":"arxiv","version":1}},"canonical_sha256":"e957dad82d42b694238011055eddf361d697d0e40857fa2e28317997e542be1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e957dad82d42b694238011055eddf361d697d0e40857fa2e28317997e542be1c","first_computed_at":"2026-05-18T01:09:28.920759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:28.920759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qC00gxbDVapOixCiDlREt20pGcNurs/eAG5CjJ4JEZwSwbEXL//pjEA5S268EVMIGcjODrsZbJZOzL5JvnMJAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:28.921249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03439","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0aad1619331ac2d161412a3d6e555a5bd07557a26ee56bdf97485050d88a749","sha256:f48810d66659c7c42a5435d81f857154bdf76e2934e9d5bccaa4082c49308c28"],"state_sha256":"1d62e5bc3146948c5b7ac71ba32b46cd50a33ef8cd48613b2b48ede70538fafb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xsQiPT3Z1D+UWwYGMDZazT8H2PGdi5yLZjqUouEMs2TyyY3MRcEhC5Nd4FV+ouq1lMuC9cneG9PSNUXrjmkBBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:04:08.300252Z","bundle_sha256":"b439e0dea00a08957489e96e48dff6a73320d9da928318b64e2ec98ceed35771"}}