{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:N5SDQDF7TUQ6DUUWM2CHBKHZ52","short_pith_number":"pith:N5SDQDF7","schema_version":"1.0","canonical_sha256":"6f64380cbf9d21e1d296668470a8f9eea37167f7ce96eff69a5af8945c03a248","source":{"kind":"arxiv","id":"1406.0373","version":1},"attestation_state":"computed","paper":{"title":"Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Masaki Yamamoto, Osamu Watanabe, Ryuhei Mori, Takeshi Koshiba","submitted_at":"2014-06-02T14:01:18Z","abstract_excerpt":"Goldreich suggested candidates of one-way functions and pseudorandom generators included in $\\mathsf{NC}^0$. It is known that randomly generated Goldreich's generator using $(r-1)$-wise independent predicates with $n$ input variables and $m=C n^{r/2}$ output variables is not pseudorandom generator with high probability for sufficiently large constant $C$. Most of the previous works assume that the alphabet is binary and use techniques available only for the binary alphabet. In this paper, we deal with non-binary generalization of Goldreich's generator and derives the tight threshold for linear"},"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":"1406.0373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-06-02T14:01:18Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"title_canon_sha256":"2085c0ed41355eaccb062878e85947ff8d1cc55c63ab90c00756c7d5b0ee11d2","abstract_canon_sha256":"25f7a99d173e32bf44d48fde0b5a8f9c09cc27f6f531e26e0ab80f089e54a0ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:41.082511Z","signature_b64":"QEf7O/mj4trZ2foJOU3wUDe4XdhGVhPbYIKS6HjlN6ipo8dKvchoWW2xFwDbb/wbEyIJmV25lI+CMNWmpg+uDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f64380cbf9d21e1d296668470a8f9eea37167f7ce96eff69a5af8945c03a248","last_reissued_at":"2026-05-18T02:50:41.081908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:41.081908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Masaki Yamamoto, Osamu Watanabe, Ryuhei Mori, Takeshi Koshiba","submitted_at":"2014-06-02T14:01:18Z","abstract_excerpt":"Goldreich suggested candidates of one-way functions and pseudorandom generators included in $\\mathsf{NC}^0$. It is known that randomly generated Goldreich's generator using $(r-1)$-wise independent predicates with $n$ input variables and $m=C n^{r/2}$ output variables is not pseudorandom generator with high probability for sufficiently large constant $C$. Most of the previous works assume that the alphabet is binary and use techniques available only for the binary alphabet. In this paper, we deal with non-binary generalization of Goldreich's generator and derives the tight threshold for linear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0373","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":"1406.0373","created_at":"2026-05-18T02:50:41.082012+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.0373v1","created_at":"2026-05-18T02:50:41.082012+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0373","created_at":"2026-05-18T02:50:41.082012+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5SDQDF7TUQ6","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5SDQDF7TUQ6DUUW","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5SDQDF7","created_at":"2026-05-18T12:28:41.024544+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/N5SDQDF7TUQ6DUUWM2CHBKHZ52","json":"https://pith.science/pith/N5SDQDF7TUQ6DUUWM2CHBKHZ52.json","graph_json":"https://pith.science/api/pith-number/N5SDQDF7TUQ6DUUWM2CHBKHZ52/graph.json","events_json":"https://pith.science/api/pith-number/N5SDQDF7TUQ6DUUWM2CHBKHZ52/events.json","paper":"https://pith.science/paper/N5SDQDF7"},"agent_actions":{"view_html":"https://pith.science/pith/N5SDQDF7TUQ6DUUWM2CHBKHZ52","download_json":"https://pith.science/pith/N5SDQDF7TUQ6DUUWM2CHBKHZ52.json","view_paper":"https://pith.science/paper/N5SDQDF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.0373&json=true","fetch_graph":"https://pith.science/api/pith-number/N5SDQDF7TUQ6DUUWM2CHBKHZ52/graph.json","fetch_events":"https://pith.science/api/pith-number/N5SDQDF7TUQ6DUUWM2CHBKHZ52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5SDQDF7TUQ6DUUWM2CHBKHZ52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5SDQDF7TUQ6DUUWM2CHBKHZ52/action/storage_attestation","attest_author":"https://pith.science/pith/N5SDQDF7TUQ6DUUWM2CHBKHZ52/action/author_attestation","sign_citation":"https://pith.science/pith/N5SDQDF7TUQ6DUUWM2CHBKHZ52/action/citation_signature","submit_replication":"https://pith.science/pith/N5SDQDF7TUQ6DUUWM2CHBKHZ52/action/replication_record"}},"created_at":"2026-05-18T02:50:41.082012+00:00","updated_at":"2026-05-18T02:50:41.082012+00:00"}