{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CHPZ2JZTSPJU4O7RPAN462LXPE","short_pith_number":"pith:CHPZ2JZT","schema_version":"1.0","canonical_sha256":"11df9d273393d34e3bf1781bcf6977791bd66ac7ae4e2b17ef37e2a418c5e0ae","source":{"kind":"arxiv","id":"1604.07200","version":2},"attestation_state":"computed","paper":{"title":"Characterization and Lower Bounds for Branching Program Size using Projective Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jayalal Sarma, Krishnamoorthy Dinesh, Sajin Koroth","submitted_at":"2016-04-25T11:04:39Z","abstract_excerpt":"We study projective dimension, a graph parameter (denoted by pd$(G)$ for a graph $G$), introduced by (Pudl\\'ak, R\\\"odl 1992), who showed that proving lower bounds for pd$(G_f)$ for bipartite graphs $G_f$ associated with a Boolean function $f$ imply size lower bounds for branching programs computing $f$. Despite several attempts (Pudl\\'ak, R\\\"odl 1992 ; Babai, R\\'{o}nyai, Ganapathy 2000), proving super-linear lower bounds for projective dimension of explicit families of graphs has remained elusive.\n  We show that there exist a Boolean function $f$ (on $n$ bits) for which the gap between the pro"},"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":"1604.07200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-25T11:04:39Z","cross_cats_sorted":[],"title_canon_sha256":"459555fbeb0ae7ddc1157750b15e858cf44018bbd5db2824b0c0248a67f284b6","abstract_canon_sha256":"b5bc73945ddf60dbb3fc991b7d79b0caf3934f8a99a14d0e84e4e09e50c7a73b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:32:20.123480Z","signature_b64":"Mu0dMPyO3w8ycnbiVTL6WpWRU4zLkYDJrF5QU+252FgUTUxrtHDTbi5baPN41dKrPySZDd5mcnlc93dixBNgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11df9d273393d34e3bf1781bcf6977791bd66ac7ae4e2b17ef37e2a418c5e0ae","last_reissued_at":"2026-07-05T00:32:20.123039Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:32:20.123039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterization and Lower Bounds for Branching Program Size using Projective Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jayalal Sarma, Krishnamoorthy Dinesh, Sajin Koroth","submitted_at":"2016-04-25T11:04:39Z","abstract_excerpt":"We study projective dimension, a graph parameter (denoted by pd$(G)$ for a graph $G$), introduced by (Pudl\\'ak, R\\\"odl 1992), who showed that proving lower bounds for pd$(G_f)$ for bipartite graphs $G_f$ associated with a Boolean function $f$ imply size lower bounds for branching programs computing $f$. Despite several attempts (Pudl\\'ak, R\\\"odl 1992 ; Babai, R\\'{o}nyai, Ganapathy 2000), proving super-linear lower bounds for projective dimension of explicit families of graphs has remained elusive.\n  We show that there exist a Boolean function $f$ (on $n$ bits) for which the gap between the pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07200","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1604.07200/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1604.07200","created_at":"2026-07-05T00:32:20.123094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07200v2","created_at":"2026-07-05T00:32:20.123094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07200","created_at":"2026-07-05T00:32:20.123094+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHPZ2JZTSPJU","created_at":"2026-07-05T00:32:20.123094+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHPZ2JZTSPJU4O7R","created_at":"2026-07-05T00:32:20.123094+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHPZ2JZT","created_at":"2026-07-05T00:32:20.123094+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/CHPZ2JZTSPJU4O7RPAN462LXPE","json":"https://pith.science/pith/CHPZ2JZTSPJU4O7RPAN462LXPE.json","graph_json":"https://pith.science/api/pith-number/CHPZ2JZTSPJU4O7RPAN462LXPE/graph.json","events_json":"https://pith.science/api/pith-number/CHPZ2JZTSPJU4O7RPAN462LXPE/events.json","paper":"https://pith.science/paper/CHPZ2JZT"},"agent_actions":{"view_html":"https://pith.science/pith/CHPZ2JZTSPJU4O7RPAN462LXPE","download_json":"https://pith.science/pith/CHPZ2JZTSPJU4O7RPAN462LXPE.json","view_paper":"https://pith.science/paper/CHPZ2JZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07200&json=true","fetch_graph":"https://pith.science/api/pith-number/CHPZ2JZTSPJU4O7RPAN462LXPE/graph.json","fetch_events":"https://pith.science/api/pith-number/CHPZ2JZTSPJU4O7RPAN462LXPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHPZ2JZTSPJU4O7RPAN462LXPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHPZ2JZTSPJU4O7RPAN462LXPE/action/storage_attestation","attest_author":"https://pith.science/pith/CHPZ2JZTSPJU4O7RPAN462LXPE/action/author_attestation","sign_citation":"https://pith.science/pith/CHPZ2JZTSPJU4O7RPAN462LXPE/action/citation_signature","submit_replication":"https://pith.science/pith/CHPZ2JZTSPJU4O7RPAN462LXPE/action/replication_record"}},"created_at":"2026-07-05T00:32:20.123094+00:00","updated_at":"2026-07-05T00:32:20.123094+00:00"}