{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:F6Z6WX64RP2GET3ADVS5Q6FLT5","short_pith_number":"pith:F6Z6WX64","canonical_record":{"source":{"id":"1108.4501","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-08-23T05:54:32Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"facdd9c5dc8e3a200bf69dd3c89b99e1fe846133602965eb036ecdb21ed9fb56","abstract_canon_sha256":"52c0f19c849f3294c2ff41833821a30346f704ce03bb4acfd1ef1c719e881183"},"schema_version":"1.0"},"canonical_sha256":"2fb3eb5fdc8bf4624f601d65d878ab9f5085e83a5313eb2dba7e43ee572b75e1","source":{"kind":"arxiv","id":"1108.4501","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4501","created_at":"2026-05-18T04:05:59Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4501v2","created_at":"2026-05-18T04:05:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4501","created_at":"2026-05-18T04:05:59Z"},{"alias_kind":"pith_short_12","alias_value":"F6Z6WX64RP2G","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"F6Z6WX64RP2GET3A","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"F6Z6WX64","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:F6Z6WX64RP2GET3ADVS5Q6FLT5","target":"record","payload":{"canonical_record":{"source":{"id":"1108.4501","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-08-23T05:54:32Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"facdd9c5dc8e3a200bf69dd3c89b99e1fe846133602965eb036ecdb21ed9fb56","abstract_canon_sha256":"52c0f19c849f3294c2ff41833821a30346f704ce03bb4acfd1ef1c719e881183"},"schema_version":"1.0"},"canonical_sha256":"2fb3eb5fdc8bf4624f601d65d878ab9f5085e83a5313eb2dba7e43ee572b75e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:59.066530Z","signature_b64":"rizeo1bNyIQjl0b5W1AaiEgKpE1yvGYuOvc67mv9b07Pd8pZN9ddCwtul2pu52TWemoT/3h3zM3oDuuEyBm0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fb3eb5fdc8bf4624f601d65d878ab9f5085e83a5313eb2dba7e43ee572b75e1","last_reissued_at":"2026-05-18T04:05:59.066025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:59.066025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.4501","source_version":2,"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-18T04:05:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ba6o0dNqs4tCjXzI2QKROnHnh1Gj7RdsHdX/jhG4N40bMdWCNVxvYhFI+1Hpk8b7DDw8JPIT8wdg/ZF5rtoXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:49:00.289004Z"},"content_sha256":"8463432254c988a93a56ba5ced35f2d90969a4bcab7b9bfacbca4ecaf7abaecf","schema_version":"1.0","event_id":"sha256:8463432254c988a93a56ba5ced35f2d90969a4bcab7b9bfacbca4ecaf7abaecf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:F6Z6WX64RP2GET3ADVS5Q6FLT5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of MaxSat Above Average","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"Gregory Gutin, Mark Jones, Robert Crowston, Saket Saurabh, Venkatesh Raman","submitted_at":"2011-08-23T05:54:32Z","abstract_excerpt":"In MaxSat, we are given a CNF formula $F$ with $n$ variables and $m$ clauses and asked to find a truth assignment satisfying the maximum number of clauses. Let $r_1,..., r_m$ be the number of literals in the clauses of $F$. Then $asat(F)=\\sum_{i=1}^m (1-2^{-r_i})$ is the expected number of clauses satisfied by a random truth assignment (the truth values to the variables are distributed uniformly and independently). It is well-known that, in polynomial time, one can find a truth assignment satisfying at least $asat(F)$ clauses. In the parameterized problem MaxSat-AA, we are to decide whether th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4501","kind":"arxiv","version":2},"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-18T04:05:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lpOxZpZysXUWZ01QRaMxnIES1h7hLz2YyPaa3uIGwGUnAtziP48Q/2QoKJV7zsBRwkf2N7etMKr368kzcyS0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:49:00.289722Z"},"content_sha256":"4d245c064a9b29a0637bdbefb60f944a0047669653b76371752516c009e9ed36","schema_version":"1.0","event_id":"sha256:4d245c064a9b29a0637bdbefb60f944a0047669653b76371752516c009e9ed36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6Z6WX64RP2GET3ADVS5Q6FLT5/bundle.json","state_url":"https://pith.science/pith/F6Z6WX64RP2GET3ADVS5Q6FLT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6Z6WX64RP2GET3ADVS5Q6FLT5/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-22T21:49:00Z","links":{"resolver":"https://pith.science/pith/F6Z6WX64RP2GET3ADVS5Q6FLT5","bundle":"https://pith.science/pith/F6Z6WX64RP2GET3ADVS5Q6FLT5/bundle.json","state":"https://pith.science/pith/F6Z6WX64RP2GET3ADVS5Q6FLT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6Z6WX64RP2GET3ADVS5Q6FLT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:F6Z6WX64RP2GET3ADVS5Q6FLT5","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":"52c0f19c849f3294c2ff41833821a30346f704ce03bb4acfd1ef1c719e881183","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-08-23T05:54:32Z","title_canon_sha256":"facdd9c5dc8e3a200bf69dd3c89b99e1fe846133602965eb036ecdb21ed9fb56"},"schema_version":"1.0","source":{"id":"1108.4501","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4501","created_at":"2026-05-18T04:05:59Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4501v2","created_at":"2026-05-18T04:05:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4501","created_at":"2026-05-18T04:05:59Z"},{"alias_kind":"pith_short_12","alias_value":"F6Z6WX64RP2G","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"F6Z6WX64RP2GET3A","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"F6Z6WX64","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:4d245c064a9b29a0637bdbefb60f944a0047669653b76371752516c009e9ed36","target":"graph","created_at":"2026-05-18T04:05:59Z","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":"In MaxSat, we are given a CNF formula $F$ with $n$ variables and $m$ clauses and asked to find a truth assignment satisfying the maximum number of clauses. Let $r_1,..., r_m$ be the number of literals in the clauses of $F$. Then $asat(F)=\\sum_{i=1}^m (1-2^{-r_i})$ is the expected number of clauses satisfied by a random truth assignment (the truth values to the variables are distributed uniformly and independently). It is well-known that, in polynomial time, one can find a truth assignment satisfying at least $asat(F)$ clauses. In the parameterized problem MaxSat-AA, we are to decide whether th","authors_text":"Gregory Gutin, Mark Jones, Robert Crowston, Saket Saurabh, Venkatesh Raman","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-08-23T05:54:32Z","title":"Parameterized Complexity of MaxSat Above Average"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4501","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:8463432254c988a93a56ba5ced35f2d90969a4bcab7b9bfacbca4ecaf7abaecf","target":"record","created_at":"2026-05-18T04:05:59Z","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":"52c0f19c849f3294c2ff41833821a30346f704ce03bb4acfd1ef1c719e881183","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-08-23T05:54:32Z","title_canon_sha256":"facdd9c5dc8e3a200bf69dd3c89b99e1fe846133602965eb036ecdb21ed9fb56"},"schema_version":"1.0","source":{"id":"1108.4501","kind":"arxiv","version":2}},"canonical_sha256":"2fb3eb5fdc8bf4624f601d65d878ab9f5085e83a5313eb2dba7e43ee572b75e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fb3eb5fdc8bf4624f601d65d878ab9f5085e83a5313eb2dba7e43ee572b75e1","first_computed_at":"2026-05-18T04:05:59.066025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:59.066025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rizeo1bNyIQjl0b5W1AaiEgKpE1yvGYuOvc67mv9b07Pd8pZN9ddCwtul2pu52TWemoT/3h3zM3oDuuEyBm0CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:59.066530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4501","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8463432254c988a93a56ba5ced35f2d90969a4bcab7b9bfacbca4ecaf7abaecf","sha256:4d245c064a9b29a0637bdbefb60f944a0047669653b76371752516c009e9ed36"],"state_sha256":"61f1ed059535edafb2460b666d5e64594933a9d5d1c7956d8973180fef970583"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KF9VKcHJ9E5oJxNuBrFvk8FA+O7MefW6p73fgAWfIqu8Po66Gm1n0ENXjFgwFHnz3FikwxmKor9kTLpAQsBBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T21:49:00.293555Z","bundle_sha256":"97c326d53f2df8f9c09a0aef22ee94046ed000dbac46450c5d731f326e16d9f4"}}