{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BCXOKVYZYYWWJ5WFGE6KSTDMDB","short_pith_number":"pith:BCXOKVYZ","canonical_record":{"source":{"id":"1710.09502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-26T01:03:25Z","cross_cats_sorted":[],"title_canon_sha256":"ac6547c9f66d8e963a0a5ce1c9d5a0486e1781c7fb1ce4882361f8892c7d56ef","abstract_canon_sha256":"fad0215e9fcc1bfdea848aabb61c955ee1db7317a320a66fc015b182266f6270"},"schema_version":"1.0"},"canonical_sha256":"08aee55719c62d64f6c5313ca94c6c1867f3ad918020c47fab5a9381d1056dfe","source":{"kind":"arxiv","id":"1710.09502","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09502","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09502v1","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09502","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"pith_short_12","alias_value":"BCXOKVYZYYWW","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BCXOKVYZYYWWJ5WF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BCXOKVYZ","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BCXOKVYZYYWWJ5WFGE6KSTDMDB","target":"record","payload":{"canonical_record":{"source":{"id":"1710.09502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-26T01:03:25Z","cross_cats_sorted":[],"title_canon_sha256":"ac6547c9f66d8e963a0a5ce1c9d5a0486e1781c7fb1ce4882361f8892c7d56ef","abstract_canon_sha256":"fad0215e9fcc1bfdea848aabb61c955ee1db7317a320a66fc015b182266f6270"},"schema_version":"1.0"},"canonical_sha256":"08aee55719c62d64f6c5313ca94c6c1867f3ad918020c47fab5a9381d1056dfe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:59.272094Z","signature_b64":"paCKQuL0lmgvDjlaO01vFVDUwN4i37n4Oy46q5YolDcr90bYsUq3gjx8BBlnAArlT6NW+SW/wR0K2KTHE+2CCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08aee55719c62d64f6c5313ca94c6c1867f3ad918020c47fab5a9381d1056dfe","last_reissued_at":"2026-05-18T00:31:59.271603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:59.271603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.09502","source_version":1,"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-05-18T00:31:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HxrB/pi+QQ5N4G6sDChVm0g580TNS9xX2KtEZ3k4jvcVttrrTXUzqjkn5OD7GZDHZyGOQCzOEr9wPSvmLEEODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:25:10.642970Z"},"content_sha256":"927c3b7615a2d85a77a72975d4203df2a901fbf47c714be064d6ac893224d758","schema_version":"1.0","event_id":"sha256:927c3b7615a2d85a77a72975d4203df2a901fbf47c714be064d6ac893224d758"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BCXOKVYZYYWWJ5WFGE6KSTDMDB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Barriers for Rank Methods in Arithmetic Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ankit Garg, Avi Wigderson, Klim Efremenko, Rafael Oliveira","submitted_at":"2017-10-26T01:03:25Z","abstract_excerpt":"Arithmetic complexity is considered simpler to understand than Boolean complexity, namely computing Boolean functions via logical gates. And indeed, we seem to have significantly more lower bound techniques and results in arithmetic complexity than in Boolean complexity. Despite many successes and rapid progress, however, challenges like proving super-polynomial lower bounds on circuit or formula size for explicit polynomials, or super-linear lower bounds on explicit 3-dimensional tensors, remain elusive.\n  At the same time, we have plenty more \"barrier results\" for failing to prove basic lowe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09502","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"},"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-05-18T00:31:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WWk+b/vRG0KnpnUrk3VlDUHr00LNzKjUmCejnRMxquCqoLctKRpB7NKE4td7wUd+wYG1oBOGwrylWqPRI86jAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:25:10.643655Z"},"content_sha256":"5c4fded99f9dcc0d9464338e1068632e29e05471dba437ca8d1a348887de88b8","schema_version":"1.0","event_id":"sha256:5c4fded99f9dcc0d9464338e1068632e29e05471dba437ca8d1a348887de88b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCXOKVYZYYWWJ5WFGE6KSTDMDB/bundle.json","state_url":"https://pith.science/pith/BCXOKVYZYYWWJ5WFGE6KSTDMDB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCXOKVYZYYWWJ5WFGE6KSTDMDB/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-05-29T22:25:10Z","links":{"resolver":"https://pith.science/pith/BCXOKVYZYYWWJ5WFGE6KSTDMDB","bundle":"https://pith.science/pith/BCXOKVYZYYWWJ5WFGE6KSTDMDB/bundle.json","state":"https://pith.science/pith/BCXOKVYZYYWWJ5WFGE6KSTDMDB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCXOKVYZYYWWJ5WFGE6KSTDMDB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BCXOKVYZYYWWJ5WFGE6KSTDMDB","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":"fad0215e9fcc1bfdea848aabb61c955ee1db7317a320a66fc015b182266f6270","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-26T01:03:25Z","title_canon_sha256":"ac6547c9f66d8e963a0a5ce1c9d5a0486e1781c7fb1ce4882361f8892c7d56ef"},"schema_version":"1.0","source":{"id":"1710.09502","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09502","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09502v1","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09502","created_at":"2026-05-18T00:31:59Z"},{"alias_kind":"pith_short_12","alias_value":"BCXOKVYZYYWW","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BCXOKVYZYYWWJ5WF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BCXOKVYZ","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:5c4fded99f9dcc0d9464338e1068632e29e05471dba437ca8d1a348887de88b8","target":"graph","created_at":"2026-05-18T00:31:59Z","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"},"paper":{"abstract_excerpt":"Arithmetic complexity is considered simpler to understand than Boolean complexity, namely computing Boolean functions via logical gates. And indeed, we seem to have significantly more lower bound techniques and results in arithmetic complexity than in Boolean complexity. Despite many successes and rapid progress, however, challenges like proving super-polynomial lower bounds on circuit or formula size for explicit polynomials, or super-linear lower bounds on explicit 3-dimensional tensors, remain elusive.\n  At the same time, we have plenty more \"barrier results\" for failing to prove basic lowe","authors_text":"Ankit Garg, Avi Wigderson, Klim Efremenko, Rafael Oliveira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-26T01:03:25Z","title":"Barriers for Rank Methods in Arithmetic Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09502","kind":"arxiv","version":1},"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:927c3b7615a2d85a77a72975d4203df2a901fbf47c714be064d6ac893224d758","target":"record","created_at":"2026-05-18T00:31:59Z","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":"fad0215e9fcc1bfdea848aabb61c955ee1db7317a320a66fc015b182266f6270","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-26T01:03:25Z","title_canon_sha256":"ac6547c9f66d8e963a0a5ce1c9d5a0486e1781c7fb1ce4882361f8892c7d56ef"},"schema_version":"1.0","source":{"id":"1710.09502","kind":"arxiv","version":1}},"canonical_sha256":"08aee55719c62d64f6c5313ca94c6c1867f3ad918020c47fab5a9381d1056dfe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08aee55719c62d64f6c5313ca94c6c1867f3ad918020c47fab5a9381d1056dfe","first_computed_at":"2026-05-18T00:31:59.271603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:59.271603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"paCKQuL0lmgvDjlaO01vFVDUwN4i37n4Oy46q5YolDcr90bYsUq3gjx8BBlnAArlT6NW+SW/wR0K2KTHE+2CCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:59.272094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.09502","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:927c3b7615a2d85a77a72975d4203df2a901fbf47c714be064d6ac893224d758","sha256:5c4fded99f9dcc0d9464338e1068632e29e05471dba437ca8d1a348887de88b8"],"state_sha256":"5a950916ba811929df02d18df937c1f1238530dd2be3d4f6fcb8a42803565619"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bq0r0rEW8F5S5IrmbW1/xv11vICyxaSJ96m63T8+Me2yNtFEHGMYfD1PqbBT6j6MgvhkUFxDdupdVKgZZFXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:25:10.647155Z","bundle_sha256":"545197c01d8a3f83a446e892c259875990cb9132592ba6a682938c992511159b"}}