{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3SCDY7HZ5J34X7IFRNOKWAJ53G","short_pith_number":"pith:3SCDY7HZ","schema_version":"1.0","canonical_sha256":"dc843c7cf9ea77cbfd058b5cab013dd9812210282e4a4ac1f68306999416eeed","source":{"kind":"arxiv","id":"1404.7443","version":2},"attestation_state":"computed","paper":{"title":"Depth Lower Bounds against Circuits with Sparse Orientation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jayalal Sarma, Sajin Koroth","submitted_at":"2014-04-29T17:57:47Z","abstract_excerpt":"We study depth lower bounds against non-monotone circuits, parametrized by a new measure of non-monotonicity: the orientation of a function $f$ is the characteristic vector of the minimum sized set of negated variables needed in any DeMorgan circuit computing $f$. We prove trade-off results between the depth and the weight/structure of the orientation vectors in any circuit $C$ computing the Clique function on an $n$ vertex graph. We prove that if $C$ is of depth $d$ and each gate computes a Boolean function with orientation of weight at most $w$ (in terms of the inputs to $C$), then $d \\times"},"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":"1404.7443","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-29T17:57:47Z","cross_cats_sorted":[],"title_canon_sha256":"9d029539243975db480a97d45d9378e0594089b86d985041bb71fd82b8c00123","abstract_canon_sha256":"785eab6d924afd8c4435144517294fa979cf3ebea63846335f21d0a7eb83330d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:05.314277Z","signature_b64":"FnXhevWVaqCnVkTyUXZA2/NYCS0v60pkQ1R+v21wNSz/rMw8aJVplWn/nuTSrebsAM2+YzPNBqdu/MLesfiUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc843c7cf9ea77cbfd058b5cab013dd9812210282e4a4ac1f68306999416eeed","last_reissued_at":"2026-05-18T02:28:05.313883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:05.313883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Depth Lower Bounds against Circuits with Sparse Orientation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jayalal Sarma, Sajin Koroth","submitted_at":"2014-04-29T17:57:47Z","abstract_excerpt":"We study depth lower bounds against non-monotone circuits, parametrized by a new measure of non-monotonicity: the orientation of a function $f$ is the characteristic vector of the minimum sized set of negated variables needed in any DeMorgan circuit computing $f$. We prove trade-off results between the depth and the weight/structure of the orientation vectors in any circuit $C$ computing the Clique function on an $n$ vertex graph. We prove that if $C$ is of depth $d$ and each gate computes a Boolean function with orientation of weight at most $w$ (in terms of the inputs to $C$), then $d \\times"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7443","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.7443","created_at":"2026-05-18T02:28:05.313947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.7443v2","created_at":"2026-05-18T02:28:05.313947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7443","created_at":"2026-05-18T02:28:05.313947+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SCDY7HZ5J34","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SCDY7HZ5J34X7IF","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SCDY7HZ","created_at":"2026-05-18T12:28:11.866339+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/3SCDY7HZ5J34X7IFRNOKWAJ53G","json":"https://pith.science/pith/3SCDY7HZ5J34X7IFRNOKWAJ53G.json","graph_json":"https://pith.science/api/pith-number/3SCDY7HZ5J34X7IFRNOKWAJ53G/graph.json","events_json":"https://pith.science/api/pith-number/3SCDY7HZ5J34X7IFRNOKWAJ53G/events.json","paper":"https://pith.science/paper/3SCDY7HZ"},"agent_actions":{"view_html":"https://pith.science/pith/3SCDY7HZ5J34X7IFRNOKWAJ53G","download_json":"https://pith.science/pith/3SCDY7HZ5J34X7IFRNOKWAJ53G.json","view_paper":"https://pith.science/paper/3SCDY7HZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.7443&json=true","fetch_graph":"https://pith.science/api/pith-number/3SCDY7HZ5J34X7IFRNOKWAJ53G/graph.json","fetch_events":"https://pith.science/api/pith-number/3SCDY7HZ5J34X7IFRNOKWAJ53G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SCDY7HZ5J34X7IFRNOKWAJ53G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SCDY7HZ5J34X7IFRNOKWAJ53G/action/storage_attestation","attest_author":"https://pith.science/pith/3SCDY7HZ5J34X7IFRNOKWAJ53G/action/author_attestation","sign_citation":"https://pith.science/pith/3SCDY7HZ5J34X7IFRNOKWAJ53G/action/citation_signature","submit_replication":"https://pith.science/pith/3SCDY7HZ5J34X7IFRNOKWAJ53G/action/replication_record"}},"created_at":"2026-05-18T02:28:05.313947+00:00","updated_at":"2026-05-18T02:28:05.313947+00:00"}