{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CHPZ2JZTSPJU4O7RPAN462LXPE","short_pith_number":"pith:CHPZ2JZT","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"},"canonical_sha256":"11df9d273393d34e3bf1781bcf6977791bd66ac7ae4e2b17ef37e2a418c5e0ae","source":{"kind":"arxiv","id":"1604.07200","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07200","created_at":"2026-07-05T00:32:20Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07200v2","created_at":"2026-07-05T00:32:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07200","created_at":"2026-07-05T00:32:20Z"},{"alias_kind":"pith_short_12","alias_value":"CHPZ2JZTSPJU","created_at":"2026-07-05T00:32:20Z"},{"alias_kind":"pith_short_16","alias_value":"CHPZ2JZTSPJU4O7R","created_at":"2026-07-05T00:32:20Z"},{"alias_kind":"pith_short_8","alias_value":"CHPZ2JZT","created_at":"2026-07-05T00:32:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CHPZ2JZTSPJU4O7RPAN462LXPE","target":"record","payload":{"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"},"canonical_sha256":"11df9d273393d34e3bf1781bcf6977791bd66ac7ae4e2b17ef37e2a418c5e0ae","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"},"source_kind":"arxiv","source_id":"1604.07200","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:32:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C0eSXm3m9byxIh9MGzFzO3HCr2KvhzPV1bie3y4hil5LH1b0BM20ko5WB7zFLeXirm43FDiM4UREwt5hALxfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:07:42.343627Z"},"content_sha256":"c28619bb1a21a81f5fe313f1417bc56c86fe7180a2320cd0f5e29d660287100a","schema_version":"1.0","event_id":"sha256:c28619bb1a21a81f5fe313f1417bc56c86fe7180a2320cd0f5e29d660287100a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CHPZ2JZTSPJU4O7RPAN462LXPE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:32:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PJ79C7QEm+cLVtZ83f20I60aIVQ8OyYnXePXmvhBx0OoOKN78LiMeTOlS8E0XtfDP4yJE52bsDa1hxSiB3MHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:07:42.344011Z"},"content_sha256":"5a6135623c944cdd1e957d42477797f6dabbc82bfe4e5c8043b541f42247b426","schema_version":"1.0","event_id":"sha256:5a6135623c944cdd1e957d42477797f6dabbc82bfe4e5c8043b541f42247b426"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CHPZ2JZTSPJU4O7RPAN462LXPE/bundle.json","state_url":"https://pith.science/pith/CHPZ2JZTSPJU4O7RPAN462LXPE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CHPZ2JZTSPJU4O7RPAN462LXPE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T01:07:42Z","links":{"resolver":"https://pith.science/pith/CHPZ2JZTSPJU4O7RPAN462LXPE","bundle":"https://pith.science/pith/CHPZ2JZTSPJU4O7RPAN462LXPE/bundle.json","state":"https://pith.science/pith/CHPZ2JZTSPJU4O7RPAN462LXPE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CHPZ2JZTSPJU4O7RPAN462LXPE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CHPZ2JZTSPJU4O7RPAN462LXPE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b5bc73945ddf60dbb3fc991b7d79b0caf3934f8a99a14d0e84e4e09e50c7a73b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-25T11:04:39Z","title_canon_sha256":"459555fbeb0ae7ddc1157750b15e858cf44018bbd5db2824b0c0248a67f284b6"},"schema_version":"1.0","source":{"id":"1604.07200","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07200","created_at":"2026-07-05T00:32:20Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07200v2","created_at":"2026-07-05T00:32:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07200","created_at":"2026-07-05T00:32:20Z"},{"alias_kind":"pith_short_12","alias_value":"CHPZ2JZTSPJU","created_at":"2026-07-05T00:32:20Z"},{"alias_kind":"pith_short_16","alias_value":"CHPZ2JZTSPJU4O7R","created_at":"2026-07-05T00:32:20Z"},{"alias_kind":"pith_short_8","alias_value":"CHPZ2JZT","created_at":"2026-07-05T00:32:20Z"}],"graph_snapshots":[{"event_id":"sha256:5a6135623c944cdd1e957d42477797f6dabbc82bfe4e5c8043b541f42247b426","target":"graph","created_at":"2026-07-05T00:32:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1604.07200/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jayalal Sarma, Krishnamoorthy Dinesh, Sajin Koroth","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-25T11:04:39Z","title":"Characterization and Lower Bounds for Branching Program Size using Projective Dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07200","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c28619bb1a21a81f5fe313f1417bc56c86fe7180a2320cd0f5e29d660287100a","target":"record","created_at":"2026-07-05T00:32:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b5bc73945ddf60dbb3fc991b7d79b0caf3934f8a99a14d0e84e4e09e50c7a73b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-25T11:04:39Z","title_canon_sha256":"459555fbeb0ae7ddc1157750b15e858cf44018bbd5db2824b0c0248a67f284b6"},"schema_version":"1.0","source":{"id":"1604.07200","kind":"arxiv","version":2}},"canonical_sha256":"11df9d273393d34e3bf1781bcf6977791bd66ac7ae4e2b17ef37e2a418c5e0ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11df9d273393d34e3bf1781bcf6977791bd66ac7ae4e2b17ef37e2a418c5e0ae","first_computed_at":"2026-07-05T00:32:20.123039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:32:20.123039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mu0dMPyO3w8ycnbiVTL6WpWRU4zLkYDJrF5QU+252FgUTUxrtHDTbi5baPN41dKrPySZDd5mcnlc93dixBNgCA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:32:20.123480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07200","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c28619bb1a21a81f5fe313f1417bc56c86fe7180a2320cd0f5e29d660287100a","sha256:5a6135623c944cdd1e957d42477797f6dabbc82bfe4e5c8043b541f42247b426"],"state_sha256":"fade18d211046b265c36bc111a66f3a54e025afa74f2dbeefd0294f897e2c9c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PF9iw3KU1e7wHrMHqNrQQZMEvlHeiVdYVXaxwnmatQpI2D+5YHA0219ejhUR2Vx/EHRj07+eXbKtFcnbgG9rCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T01:07:42.346677Z","bundle_sha256":"6136c38f7eb6bc31e69a8a24694f7bee671dc41f9e15d0b065d8572b5dfdd01d"}}