{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TI5UQRZTZCQYQIK6CCGCRMM5ER","short_pith_number":"pith:TI5UQRZT","canonical_record":{"source":{"id":"1406.3247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-12T14:13:20Z","cross_cats_sorted":[],"title_canon_sha256":"fb919b01160683010ce34ef8fa25a812ddb6d09988c604200bfac37df2ad2511","abstract_canon_sha256":"fc4c965569a8519ed279e25211800c46d2240048cb4a141a3dd387057f4ededd"},"schema_version":"1.0"},"canonical_sha256":"9a3b484733c8a188215e108c28b19d244ff120f6620b2e925aaf17d8eb251d6c","source":{"kind":"arxiv","id":"1406.3247","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3247","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3247v1","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3247","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"TI5UQRZTZCQY","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TI5UQRZTZCQYQIK6","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TI5UQRZT","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TI5UQRZTZCQYQIK6CCGCRMM5ER","target":"record","payload":{"canonical_record":{"source":{"id":"1406.3247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-12T14:13:20Z","cross_cats_sorted":[],"title_canon_sha256":"fb919b01160683010ce34ef8fa25a812ddb6d09988c604200bfac37df2ad2511","abstract_canon_sha256":"fc4c965569a8519ed279e25211800c46d2240048cb4a141a3dd387057f4ededd"},"schema_version":"1.0"},"canonical_sha256":"9a3b484733c8a188215e108c28b19d244ff120f6620b2e925aaf17d8eb251d6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:52.751191Z","signature_b64":"nzGKF7fbB7nM3d87jQNaDcWaFzNPZnCWcfWV33JsdFdPO5wIO8XfySSAudZcKX/2TXH6L8UjvJHJp0eeN40MBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a3b484733c8a188215e108c28b19d244ff120f6620b2e925aaf17d8eb251d6c","last_reissued_at":"2026-05-18T02:49:52.750740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:52.750740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.3247","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-18T02:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PDsZtV3hwTFbkDT2qwlx7hLJ7tzPdJhqdf0yyaUYYX5/hLTBilFUugAExy/RaxkB4ooCdqJQgoM4TNgKy5QvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:19:13.369617Z"},"content_sha256":"ebea08876e8ee28e65de1d3d1e05e5b51fa4a1af65f80d81f8a186973818add4","schema_version":"1.0","event_id":"sha256:ebea08876e8ee28e65de1d3d1e05e5b51fa4a1af65f80d81f8a186973818add4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TI5UQRZTZCQYQIK6CCGCRMM5ER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hannes Uppman, Johannes Schmidt, Peter Jonsson, Victor Lagerkvist","submitted_at":"2014-06-12T14:13:20Z","abstract_excerpt":"Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the time complexity of the parameterized SAT($\\cdot$) problem correlates to the lattice of strong partial clones. With this ordering they isolated a relation $R$ such that SAT($R$) can be solved at least as fast as any other NP-hard SAT($\\cdot$) problem. In this paper we extend this method and show that such languages also exist for the max ones problem (MaxOnes($\\Gamma$)) and the Boolean valued constraint satisfaction p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3247","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-18T02:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ycrtUQ1x8kRUHqiadEWxqocQmxU02FlVx+QnNqp7AR6SG5w8pidqDaCcdqzqDhBpMvGhNXUbZYNa6oM7f3ZeCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:19:13.370258Z"},"content_sha256":"2010c4390e0af0047da98a8343e5b717d52f5a2c783cc5bcbb2dea1ac983b71f","schema_version":"1.0","event_id":"sha256:2010c4390e0af0047da98a8343e5b717d52f5a2c783cc5bcbb2dea1ac983b71f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TI5UQRZTZCQYQIK6CCGCRMM5ER/bundle.json","state_url":"https://pith.science/pith/TI5UQRZTZCQYQIK6CCGCRMM5ER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TI5UQRZTZCQYQIK6CCGCRMM5ER/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-07T02:19:13Z","links":{"resolver":"https://pith.science/pith/TI5UQRZTZCQYQIK6CCGCRMM5ER","bundle":"https://pith.science/pith/TI5UQRZTZCQYQIK6CCGCRMM5ER/bundle.json","state":"https://pith.science/pith/TI5UQRZTZCQYQIK6CCGCRMM5ER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TI5UQRZTZCQYQIK6CCGCRMM5ER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TI5UQRZTZCQYQIK6CCGCRMM5ER","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":"fc4c965569a8519ed279e25211800c46d2240048cb4a141a3dd387057f4ededd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-12T14:13:20Z","title_canon_sha256":"fb919b01160683010ce34ef8fa25a812ddb6d09988c604200bfac37df2ad2511"},"schema_version":"1.0","source":{"id":"1406.3247","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3247","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3247v1","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3247","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"TI5UQRZTZCQY","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TI5UQRZTZCQYQIK6","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TI5UQRZT","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:2010c4390e0af0047da98a8343e5b717d52f5a2c783cc5bcbb2dea1ac983b71f","target":"graph","created_at":"2026-05-18T02:49:52Z","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":"Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the time complexity of the parameterized SAT($\\cdot$) problem correlates to the lattice of strong partial clones. With this ordering they isolated a relation $R$ such that SAT($R$) can be solved at least as fast as any other NP-hard SAT($\\cdot$) problem. In this paper we extend this method and show that such languages also exist for the max ones problem (MaxOnes($\\Gamma$)) and the Boolean valued constraint satisfaction p","authors_text":"Hannes Uppman, Johannes Schmidt, Peter Jonsson, Victor Lagerkvist","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-12T14:13:20Z","title":"Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3247","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:ebea08876e8ee28e65de1d3d1e05e5b51fa4a1af65f80d81f8a186973818add4","target":"record","created_at":"2026-05-18T02:49:52Z","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":"fc4c965569a8519ed279e25211800c46d2240048cb4a141a3dd387057f4ededd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-12T14:13:20Z","title_canon_sha256":"fb919b01160683010ce34ef8fa25a812ddb6d09988c604200bfac37df2ad2511"},"schema_version":"1.0","source":{"id":"1406.3247","kind":"arxiv","version":1}},"canonical_sha256":"9a3b484733c8a188215e108c28b19d244ff120f6620b2e925aaf17d8eb251d6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a3b484733c8a188215e108c28b19d244ff120f6620b2e925aaf17d8eb251d6c","first_computed_at":"2026-05-18T02:49:52.750740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:52.750740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nzGKF7fbB7nM3d87jQNaDcWaFzNPZnCWcfWV33JsdFdPO5wIO8XfySSAudZcKX/2TXH6L8UjvJHJp0eeN40MBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:52.751191Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3247","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebea08876e8ee28e65de1d3d1e05e5b51fa4a1af65f80d81f8a186973818add4","sha256:2010c4390e0af0047da98a8343e5b717d52f5a2c783cc5bcbb2dea1ac983b71f"],"state_sha256":"c8d87c9cd20d61c12bcc30792b8ea9621c97c0fa3bfd91649a83472256e698e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IoWk5d1S3pqYnyQyatOoAHQWMr9rJYCE+9gttk0fbDJym+SwpQBGYH3AYZF5r2M8r2qWczh+rGvHhruzRbRHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T02:19:13.373393Z","bundle_sha256":"b8ff9c04d0972eac60878abb0932720fda206fcf8c6a2536f23bb2b19a1bbcb1"}}