{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BHAVHSJYP4QNUFXDUSXCFSLHGD","short_pith_number":"pith:BHAVHSJY","schema_version":"1.0","canonical_sha256":"09c153c9387f20da16e3a4ae22c96730cbfbdbcb7f5bcc4528db90b1bb3f0c9d","source":{"kind":"arxiv","id":"1312.2143","version":1},"attestation_state":"computed","paper":{"title":"A composition theorem for parity kill number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"John Wright, Li-Yang Tan, Ryan O'Donnell, Xiaorui Sun, Yu Zhao","submitted_at":"2013-12-07T21:40:43Z","abstract_excerpt":"In this work, we study the parity complexity measures ${\\mathsf{C}^{\\oplus}_{\\min}}[f]$ and ${\\mathsf{DT^{\\oplus}}}[f]$. ${\\mathsf{C}^{\\oplus}_{\\min}}[f]$ is the \\emph{parity kill number} of $f$, the fewest number of parities on the input variables one has to fix in order to \"kill\" $f$, i.e. to make it constant. ${\\mathsf{DT^{\\oplus}}}[f]$ is the depth of the shortest \\emph{parity decision tree} which computes $f$. These complexity measures have in recent years become increasingly important in the fields of communication complexity \\cite{ZS09, MO09, ZS10, TWXZ13} and pseudorandomness \\cite{BK1"},"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":"1312.2143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-07T21:40:43Z","cross_cats_sorted":[],"title_canon_sha256":"e10f3cff535c838a62689061e75aff1cac9935e757bbf8fe4a78359b6e6f330c","abstract_canon_sha256":"7d72b101e15f495b5f3a2c14e393b88ec51d24fe22203e780af8557f0ac5b1b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:17.131776Z","signature_b64":"b4lsitMp4TbTBV1Xv2bha0M1++EavpxVd3HDjL3xDEMXk2al7Nxs75h5OsXQO/CSVVDXFSZz9rMaPTkBx5fyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09c153c9387f20da16e3a4ae22c96730cbfbdbcb7f5bcc4528db90b1bb3f0c9d","last_reissued_at":"2026-05-18T03:05:17.131356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:17.131356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A composition theorem for parity kill number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"John Wright, Li-Yang Tan, Ryan O'Donnell, Xiaorui Sun, Yu Zhao","submitted_at":"2013-12-07T21:40:43Z","abstract_excerpt":"In this work, we study the parity complexity measures ${\\mathsf{C}^{\\oplus}_{\\min}}[f]$ and ${\\mathsf{DT^{\\oplus}}}[f]$. ${\\mathsf{C}^{\\oplus}_{\\min}}[f]$ is the \\emph{parity kill number} of $f$, the fewest number of parities on the input variables one has to fix in order to \"kill\" $f$, i.e. to make it constant. ${\\mathsf{DT^{\\oplus}}}[f]$ is the depth of the shortest \\emph{parity decision tree} which computes $f$. These complexity measures have in recent years become increasingly important in the fields of communication complexity \\cite{ZS09, MO09, ZS10, TWXZ13} and pseudorandomness \\cite{BK1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2143","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":"1312.2143","created_at":"2026-05-18T03:05:17.131419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.2143v1","created_at":"2026-05-18T03:05:17.131419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2143","created_at":"2026-05-18T03:05:17.131419+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHAVHSJYP4QN","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHAVHSJYP4QNUFXD","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHAVHSJY","created_at":"2026-05-18T12:27:38.830355+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/BHAVHSJYP4QNUFXDUSXCFSLHGD","json":"https://pith.science/pith/BHAVHSJYP4QNUFXDUSXCFSLHGD.json","graph_json":"https://pith.science/api/pith-number/BHAVHSJYP4QNUFXDUSXCFSLHGD/graph.json","events_json":"https://pith.science/api/pith-number/BHAVHSJYP4QNUFXDUSXCFSLHGD/events.json","paper":"https://pith.science/paper/BHAVHSJY"},"agent_actions":{"view_html":"https://pith.science/pith/BHAVHSJYP4QNUFXDUSXCFSLHGD","download_json":"https://pith.science/pith/BHAVHSJYP4QNUFXDUSXCFSLHGD.json","view_paper":"https://pith.science/paper/BHAVHSJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.2143&json=true","fetch_graph":"https://pith.science/api/pith-number/BHAVHSJYP4QNUFXDUSXCFSLHGD/graph.json","fetch_events":"https://pith.science/api/pith-number/BHAVHSJYP4QNUFXDUSXCFSLHGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHAVHSJYP4QNUFXDUSXCFSLHGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHAVHSJYP4QNUFXDUSXCFSLHGD/action/storage_attestation","attest_author":"https://pith.science/pith/BHAVHSJYP4QNUFXDUSXCFSLHGD/action/author_attestation","sign_citation":"https://pith.science/pith/BHAVHSJYP4QNUFXDUSXCFSLHGD/action/citation_signature","submit_replication":"https://pith.science/pith/BHAVHSJYP4QNUFXDUSXCFSLHGD/action/replication_record"}},"created_at":"2026-05-18T03:05:17.131419+00:00","updated_at":"2026-05-18T03:05:17.131419+00:00"}