{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LAJDJNJRJEG3Q2CO2LEH62DFIV","short_pith_number":"pith:LAJDJNJR","canonical_record":{"source":{"id":"1504.00151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-01T09:03:00Z","cross_cats_sorted":[],"title_canon_sha256":"6ec1ee7231f77daab7d152a93968188f94ca462a756949dbae033b04eeb9668b","abstract_canon_sha256":"b3d9b9b24faec56f83cf1431d799fc3221e771ced9fdfc8eefb0de0783f0cc27"},"schema_version":"1.0"},"canonical_sha256":"581234b531490db8684ed2c87f68654569bc766113ac95c0f1fd2a8d0d5a7737","source":{"kind":"arxiv","id":"1504.00151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00151","created_at":"2026-05-18T02:19:44Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00151v1","created_at":"2026-05-18T02:19:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00151","created_at":"2026-05-18T02:19:44Z"},{"alias_kind":"pith_short_12","alias_value":"LAJDJNJRJEG3","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LAJDJNJRJEG3Q2CO","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LAJDJNJR","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LAJDJNJRJEG3Q2CO2LEH62DFIV","target":"record","payload":{"canonical_record":{"source":{"id":"1504.00151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-01T09:03:00Z","cross_cats_sorted":[],"title_canon_sha256":"6ec1ee7231f77daab7d152a93968188f94ca462a756949dbae033b04eeb9668b","abstract_canon_sha256":"b3d9b9b24faec56f83cf1431d799fc3221e771ced9fdfc8eefb0de0783f0cc27"},"schema_version":"1.0"},"canonical_sha256":"581234b531490db8684ed2c87f68654569bc766113ac95c0f1fd2a8d0d5a7737","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:44.433212Z","signature_b64":"h8KG7S7IISGotl9vv3USkdxEUMgumu0rvc6sADTO7fDECi/ibHvOEaYoBuevaeTqUlRCJUHhkdHqG2xtsqkHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"581234b531490db8684ed2c87f68654569bc766113ac95c0f1fd2a8d0d5a7737","last_reissued_at":"2026-05-18T02:19:44.432567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:44.432567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.00151","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-18T02:19:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8t7jgNiV71bMGn6NpQToYs9q9lcbqbcRAvLIAtSW4zd/CHqFfTQ+BEZMfVLOY2Jal2cEKgNU9VDeqqex8opjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T03:43:25.270811Z"},"content_sha256":"2ca506dbeee9ee6906e5b2206124dc45555f94fba930f4891422a9ff4c809261","schema_version":"1.0","event_id":"sha256:2ca506dbeee9ee6906e5b2206124dc45555f94fba930f4891422a9ff4c809261"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LAJDJNJRJEG3Q2CO2LEH62DFIV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bi-polynomial rank and determinantal complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Akihiro Yabe","submitted_at":"2015-04-01T09:03:00Z","abstract_excerpt":"The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the determinantal complexity of the d by d permanent polynomial is d^2/2, due to Mignon and Ressayre in 2004. Inspired by their proof method, we introduce a natural rank concept of polynomials, called the bi-polynomial rank. The bi-polynomial rank is related to width of an arithmetic branching program. The bi-polynomial rank of a homogeneous polynomial p of even degree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00151","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-18T02:19:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2k/MQMM0811kQFFvcs7FlsQKmFKsm1JmP1k7v82WclKz35c56MoVlYyxIXyP5tlmgofLzvmROCEMGmCK+JpBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T03:43:25.271524Z"},"content_sha256":"88eb07e2571c4c421bc878520fc524c0d9f345670c2da4a5c3ff5861f2db03a6","schema_version":"1.0","event_id":"sha256:88eb07e2571c4c421bc878520fc524c0d9f345670c2da4a5c3ff5861f2db03a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAJDJNJRJEG3Q2CO2LEH62DFIV/bundle.json","state_url":"https://pith.science/pith/LAJDJNJRJEG3Q2CO2LEH62DFIV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAJDJNJRJEG3Q2CO2LEH62DFIV/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-20T03:43:25Z","links":{"resolver":"https://pith.science/pith/LAJDJNJRJEG3Q2CO2LEH62DFIV","bundle":"https://pith.science/pith/LAJDJNJRJEG3Q2CO2LEH62DFIV/bundle.json","state":"https://pith.science/pith/LAJDJNJRJEG3Q2CO2LEH62DFIV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAJDJNJRJEG3Q2CO2LEH62DFIV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LAJDJNJRJEG3Q2CO2LEH62DFIV","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":"b3d9b9b24faec56f83cf1431d799fc3221e771ced9fdfc8eefb0de0783f0cc27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-01T09:03:00Z","title_canon_sha256":"6ec1ee7231f77daab7d152a93968188f94ca462a756949dbae033b04eeb9668b"},"schema_version":"1.0","source":{"id":"1504.00151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00151","created_at":"2026-05-18T02:19:44Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00151v1","created_at":"2026-05-18T02:19:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00151","created_at":"2026-05-18T02:19:44Z"},{"alias_kind":"pith_short_12","alias_value":"LAJDJNJRJEG3","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LAJDJNJRJEG3Q2CO","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LAJDJNJR","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:88eb07e2571c4c421bc878520fc524c0d9f345670c2da4a5c3ff5861f2db03a6","target":"graph","created_at":"2026-05-18T02:19:44Z","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":"The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the determinantal complexity of the d by d permanent polynomial is d^2/2, due to Mignon and Ressayre in 2004. Inspired by their proof method, we introduce a natural rank concept of polynomials, called the bi-polynomial rank. The bi-polynomial rank is related to width of an arithmetic branching program. The bi-polynomial rank of a homogeneous polynomial p of even degree","authors_text":"Akihiro Yabe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-01T09:03:00Z","title":"Bi-polynomial rank and determinantal complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00151","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:2ca506dbeee9ee6906e5b2206124dc45555f94fba930f4891422a9ff4c809261","target":"record","created_at":"2026-05-18T02:19:44Z","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":"b3d9b9b24faec56f83cf1431d799fc3221e771ced9fdfc8eefb0de0783f0cc27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-01T09:03:00Z","title_canon_sha256":"6ec1ee7231f77daab7d152a93968188f94ca462a756949dbae033b04eeb9668b"},"schema_version":"1.0","source":{"id":"1504.00151","kind":"arxiv","version":1}},"canonical_sha256":"581234b531490db8684ed2c87f68654569bc766113ac95c0f1fd2a8d0d5a7737","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"581234b531490db8684ed2c87f68654569bc766113ac95c0f1fd2a8d0d5a7737","first_computed_at":"2026-05-18T02:19:44.432567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:44.432567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h8KG7S7IISGotl9vv3USkdxEUMgumu0rvc6sADTO7fDECi/ibHvOEaYoBuevaeTqUlRCJUHhkdHqG2xtsqkHCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:44.433212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ca506dbeee9ee6906e5b2206124dc45555f94fba930f4891422a9ff4c809261","sha256:88eb07e2571c4c421bc878520fc524c0d9f345670c2da4a5c3ff5861f2db03a6"],"state_sha256":"45bcf1d19b4c5e4d8dc2884ebbf0f828fc48871f9fff7a159d70c80e73f76564"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RzlJhq3/EVlBx/+4WnOA2qzZK+yq0vpG0rNPYJG1fs67hKsFnMLLRfDdLQx9U642lyQgGd9r8Q289RpsIisfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T03:43:25.275480Z","bundle_sha256":"e67d24d8c32d9cb97d365fabdf98c27539e348b6114d3f72e1b81dd5fd9dddf3"}}