{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Q2JEEKA3AJWQ4BG5JBOFSVJWKV","short_pith_number":"pith:Q2JEEKA3","schema_version":"1.0","canonical_sha256":"869242281b026d0e04dd485c595536557813760819fd3271cdb59e1e7d937eb6","source":{"kind":"arxiv","id":"1107.4709","version":1},"attestation_state":"computed","paper":{"title":"Applications of Derandomization Theory in Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"cs.DM","authors_text":"Mahdi Cheraghchi","submitted_at":"2011-07-23T21:07:03Z","abstract_excerpt":"Randomized techniques play a fundamental role in theoretical computer science and discrete mathematics, in particular for the design of efficient algorithms and construction of combinatorial objects. The basic goal in derandomization theory is to eliminate or reduce the need for randomness in such randomized constructions. In this thesis, we explore some applications of the fundamental notions in derandomization theory to problems outside the core of theoretical computer science, and in particular, certain problems related to coding theory.\n  First, we consider the wiretap channel problem whic"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1107.4709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-23T21:07:03Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"title_canon_sha256":"fd479ce1f905a28db41885b882ab3ebdff3eea0fa70d2794d3b830bc0244bb46","abstract_canon_sha256":"1826b1a71eb8339393bd68bf40fdc5f2d064c8c6d5177038ba7bc2cd58d2bbf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:01.998787Z","signature_b64":"j+g3ksxx/EnjzZz7+wRP3DS1KCXUWJf2jxmAUS7I/M/4xJ1I7FQS7uRXaHZ7d/B2/f/R9UZw7zMFxhs3uC9iAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"869242281b026d0e04dd485c595536557813760819fd3271cdb59e1e7d937eb6","last_reissued_at":"2026-05-18T04:17:01.998062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:01.998062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Applications of Derandomization Theory in Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"cs.DM","authors_text":"Mahdi Cheraghchi","submitted_at":"2011-07-23T21:07:03Z","abstract_excerpt":"Randomized techniques play a fundamental role in theoretical computer science and discrete mathematics, in particular for the design of efficient algorithms and construction of combinatorial objects. The basic goal in derandomization theory is to eliminate or reduce the need for randomness in such randomized constructions. In this thesis, we explore some applications of the fundamental notions in derandomization theory to problems outside the core of theoretical computer science, and in particular, certain problems related to coding theory.\n  First, we consider the wiretap channel problem whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4709","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.4709","created_at":"2026-05-18T04:17:01.998184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4709v1","created_at":"2026-05-18T04:17:01.998184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4709","created_at":"2026-05-18T04:17:01.998184+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2JEEKA3AJWQ","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2JEEKA3AJWQ4BG5","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2JEEKA3","created_at":"2026-05-18T12:26:39.201973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q2JEEKA3AJWQ4BG5JBOFSVJWKV","json":"https://pith.science/pith/Q2JEEKA3AJWQ4BG5JBOFSVJWKV.json","graph_json":"https://pith.science/api/pith-number/Q2JEEKA3AJWQ4BG5JBOFSVJWKV/graph.json","events_json":"https://pith.science/api/pith-number/Q2JEEKA3AJWQ4BG5JBOFSVJWKV/events.json","paper":"https://pith.science/paper/Q2JEEKA3"},"agent_actions":{"view_html":"https://pith.science/pith/Q2JEEKA3AJWQ4BG5JBOFSVJWKV","download_json":"https://pith.science/pith/Q2JEEKA3AJWQ4BG5JBOFSVJWKV.json","view_paper":"https://pith.science/paper/Q2JEEKA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4709&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2JEEKA3AJWQ4BG5JBOFSVJWKV/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2JEEKA3AJWQ4BG5JBOFSVJWKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2JEEKA3AJWQ4BG5JBOFSVJWKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2JEEKA3AJWQ4BG5JBOFSVJWKV/action/storage_attestation","attest_author":"https://pith.science/pith/Q2JEEKA3AJWQ4BG5JBOFSVJWKV/action/author_attestation","sign_citation":"https://pith.science/pith/Q2JEEKA3AJWQ4BG5JBOFSVJWKV/action/citation_signature","submit_replication":"https://pith.science/pith/Q2JEEKA3AJWQ4BG5JBOFSVJWKV/action/replication_record"}},"created_at":"2026-05-18T04:17:01.998184+00:00","updated_at":"2026-05-18T04:17:01.998184+00:00"}