{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BY54JGB3UTSMYLVMCQSCE6C73R","short_pith_number":"pith:BY54JGB3","canonical_record":{"source":{"id":"1106.3161","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-06-16T07:19:22Z","cross_cats_sorted":[],"title_canon_sha256":"7ec5baf27080a4cbea8f1816bbb3f370a117205d02d54a18a753798dac3a0972","abstract_canon_sha256":"38778a7a1f7e7719c097a1addb399b0069162fe6c6fa2ff8ad745d11225ad875"},"schema_version":"1.0"},"canonical_sha256":"0e3bc4983ba4e4cc2eac142422785fdc5a4c264b44020a982998a3bc914ea832","source":{"kind":"arxiv","id":"1106.3161","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3161","created_at":"2026-05-18T04:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3161v6","created_at":"2026-05-18T04:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3161","created_at":"2026-05-18T04:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"BY54JGB3UTSM","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BY54JGB3UTSMYLVM","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BY54JGB3","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BY54JGB3UTSMYLVMCQSCE6C73R","target":"record","payload":{"canonical_record":{"source":{"id":"1106.3161","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-06-16T07:19:22Z","cross_cats_sorted":[],"title_canon_sha256":"7ec5baf27080a4cbea8f1816bbb3f370a117205d02d54a18a753798dac3a0972","abstract_canon_sha256":"38778a7a1f7e7719c097a1addb399b0069162fe6c6fa2ff8ad745d11225ad875"},"schema_version":"1.0"},"canonical_sha256":"0e3bc4983ba4e4cc2eac142422785fdc5a4c264b44020a982998a3bc914ea832","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:54.011710Z","signature_b64":"2r6bmMZ9+RaS/KfQh+gBqPN5wH4HNa9ILP9Eos+Dzbp2v7YHuZBCmOKJtBvpBTZqoe0nXIxdZ+W/8AdmyF9xDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e3bc4983ba4e4cc2eac142422785fdc5a4c264b44020a982998a3bc914ea832","last_reissued_at":"2026-05-18T04:07:54.011152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:54.011152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.3161","source_version":6,"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:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/zkR5S//4NESXkjxynulUXhfbKtLBBLBtGacjTe1lPp/lLfv0hPkEyvl70Po22K/e99u1M6CgqxK/iPXiHCeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:12:40.249585Z"},"content_sha256":"3513a1c52c5b769c9bc6a0a81b332ae52cceb3f54c5b99fd0232dbd9cf3387e7","schema_version":"1.0","event_id":"sha256:3513a1c52c5b769c9bc6a0a81b332ae52cceb3f54c5b99fd0232dbd9cf3387e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BY54JGB3UTSMYLVMCQSCE6C73R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Confronting Intractability via Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dimitrios M. Thilikos, Rodney G. Downey","submitted_at":"2011-06-16T07:19:22Z","abstract_excerpt":"One approach to confronting computational hardness is to try to understand the contribution of various parameters to the running time of algorithms and the complexity of computational tasks. Almost no computational tasks in real life are specified by their size alone. It is not hard to imagine that some parameters contribute more intractability than others and it seems reasonable to develop a theory of computational complexity which seeks to exploit this fact. Such a theory should be able to address the needs of practicioners in algorithmics. The last twenty years have seen the development of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3161","kind":"arxiv","version":6},"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:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5j/wKV+YKZtsDUqk0V78fsSB3LCG2aNE/J4jyjY1pyCQY/Art8CPNI8xIDzHkY8PECKZs2CArlbmikF3pd4mBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:12:40.249920Z"},"content_sha256":"2393e2c032f42d7e80c205266d545b92571bac13bd33d91a874b2adeb8fe9254","schema_version":"1.0","event_id":"sha256:2393e2c032f42d7e80c205266d545b92571bac13bd33d91a874b2adeb8fe9254"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BY54JGB3UTSMYLVMCQSCE6C73R/bundle.json","state_url":"https://pith.science/pith/BY54JGB3UTSMYLVMCQSCE6C73R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BY54JGB3UTSMYLVMCQSCE6C73R/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-02T10:12:40Z","links":{"resolver":"https://pith.science/pith/BY54JGB3UTSMYLVMCQSCE6C73R","bundle":"https://pith.science/pith/BY54JGB3UTSMYLVMCQSCE6C73R/bundle.json","state":"https://pith.science/pith/BY54JGB3UTSMYLVMCQSCE6C73R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BY54JGB3UTSMYLVMCQSCE6C73R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BY54JGB3UTSMYLVMCQSCE6C73R","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":"38778a7a1f7e7719c097a1addb399b0069162fe6c6fa2ff8ad745d11225ad875","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-06-16T07:19:22Z","title_canon_sha256":"7ec5baf27080a4cbea8f1816bbb3f370a117205d02d54a18a753798dac3a0972"},"schema_version":"1.0","source":{"id":"1106.3161","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3161","created_at":"2026-05-18T04:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3161v6","created_at":"2026-05-18T04:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3161","created_at":"2026-05-18T04:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"BY54JGB3UTSM","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BY54JGB3UTSMYLVM","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BY54JGB3","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:2393e2c032f42d7e80c205266d545b92571bac13bd33d91a874b2adeb8fe9254","target":"graph","created_at":"2026-05-18T04:07:54Z","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":"One approach to confronting computational hardness is to try to understand the contribution of various parameters to the running time of algorithms and the complexity of computational tasks. Almost no computational tasks in real life are specified by their size alone. It is not hard to imagine that some parameters contribute more intractability than others and it seems reasonable to develop a theory of computational complexity which seeks to exploit this fact. Such a theory should be able to address the needs of practicioners in algorithmics. The last twenty years have seen the development of ","authors_text":"Dimitrios M. Thilikos, Rodney G. Downey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-06-16T07:19:22Z","title":"Confronting Intractability via Parameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3161","kind":"arxiv","version":6},"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:3513a1c52c5b769c9bc6a0a81b332ae52cceb3f54c5b99fd0232dbd9cf3387e7","target":"record","created_at":"2026-05-18T04:07:54Z","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":"38778a7a1f7e7719c097a1addb399b0069162fe6c6fa2ff8ad745d11225ad875","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-06-16T07:19:22Z","title_canon_sha256":"7ec5baf27080a4cbea8f1816bbb3f370a117205d02d54a18a753798dac3a0972"},"schema_version":"1.0","source":{"id":"1106.3161","kind":"arxiv","version":6}},"canonical_sha256":"0e3bc4983ba4e4cc2eac142422785fdc5a4c264b44020a982998a3bc914ea832","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e3bc4983ba4e4cc2eac142422785fdc5a4c264b44020a982998a3bc914ea832","first_computed_at":"2026-05-18T04:07:54.011152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:54.011152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2r6bmMZ9+RaS/KfQh+gBqPN5wH4HNa9ILP9Eos+Dzbp2v7YHuZBCmOKJtBvpBTZqoe0nXIxdZ+W/8AdmyF9xDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:54.011710Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.3161","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3513a1c52c5b769c9bc6a0a81b332ae52cceb3f54c5b99fd0232dbd9cf3387e7","sha256:2393e2c032f42d7e80c205266d545b92571bac13bd33d91a874b2adeb8fe9254"],"state_sha256":"5f92f15d047a3ae2596813ce0a9327fc5c21a18b572679e2b0501818bd95a6b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"79tCVHaGGo9NUmWrYkBhe3IDKClD2UEmTRXT45vyRQ8eansVDcW76OQavWx+RnWdA1A3Ksh8jycXe/oU0E7FDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:12:40.252106Z","bundle_sha256":"e3b228a4480413f38e4384a362b4e10522829716d5f9f01a266d107ac2511cf9"}}