{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:B6LV7QUHELX5FB264DMEMXU7J7","short_pith_number":"pith:B6LV7QUH","canonical_record":{"source":{"id":"1801.09275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-28T19:56:40Z","cross_cats_sorted":[],"title_canon_sha256":"45bcde8d44e7a1c4ffe208f364fb5ac69fb7d662204efaa52fd661dd05c6d8db","abstract_canon_sha256":"c534051fe99b7e75878cc91e7c0cc52f12e2bc4f5f75f1bf6b5bd3f376067cfe"},"schema_version":"1.0"},"canonical_sha256":"0f975fc28722efd2875ee0d8465e9f4fc4168dd36625ce85a9890df48b36c070","source":{"kind":"arxiv","id":"1801.09275","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09275","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09275v1","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09275","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"pith_short_12","alias_value":"B6LV7QUHELX5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B6LV7QUHELX5FB26","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B6LV7QUH","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:B6LV7QUHELX5FB264DMEMXU7J7","target":"record","payload":{"canonical_record":{"source":{"id":"1801.09275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-28T19:56:40Z","cross_cats_sorted":[],"title_canon_sha256":"45bcde8d44e7a1c4ffe208f364fb5ac69fb7d662204efaa52fd661dd05c6d8db","abstract_canon_sha256":"c534051fe99b7e75878cc91e7c0cc52f12e2bc4f5f75f1bf6b5bd3f376067cfe"},"schema_version":"1.0"},"canonical_sha256":"0f975fc28722efd2875ee0d8465e9f4fc4168dd36625ce85a9890df48b36c070","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:57.975801Z","signature_b64":"vtH4JOYgXMAQr5NLMkpkBTf5zsYTdBRBD3OSzVq6orucKIPl3AIwahzXMWl0bIkoWKMcthi7LTL/dJeLXHl4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f975fc28722efd2875ee0d8465e9f4fc4168dd36625ce85a9890df48b36c070","last_reissued_at":"2026-05-18T00:24:57.975199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:57.975199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.09275","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:24:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d/k2D8WbnvV5QTbt8LDZ1cK9CbXq3RSX0P7egin1YgIH/li+ba6viSfct32EkgCX9dhzR2UTKY8MSid4XeHfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:43:18.080019Z"},"content_sha256":"4f3da086ed6eca007f627576b7f47c9e20380c6db78d4bfaec74960b203417ab","schema_version":"1.0","event_id":"sha256:4f3da086ed6eca007f627576b7f47c9e20380c6db78d4bfaec74960b203417ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:B6LV7QUHELX5FB264DMEMXU7J7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algebraic dependencies and PSPACE algorithms in approximative complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Amit Sinhababu, Nitin Saxena, Zeyu Guo","submitted_at":"2018-01-28T19:56:40Z","abstract_excerpt":"Testing whether a set $\\mathbf{f}$ of polynomials has an algebraic dependence is a basic problem with several applications. The polynomials are given as algebraic circuits. Algebraic independence testing question is wide open over finite fields (Dvir, Gabizon, Wigderson, FOCS'07). The best complexity known is NP$^{\\#\\rm P}$ (Mittmann, Saxena, Scheiblechner, Trans.AMS'14). In this work we put the problem in AM $\\cap$ coAM. In particular, dependence testing is unlikely to be NP-hard and joins the league of problems of \"intermediate\" complexity, eg. graph isomorphism & integer factoring. Our proo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09275","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:24:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ca49E3TQ5cuSFwuukS3IKUdmvjbjQIcLeB4i1hhDzLS328Xep7kxxNgXznKAvOxArkR9HWnDubwGPnCNkp4ZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:43:18.080380Z"},"content_sha256":"036c886de37244c2a3c400e03ac4fe48e878d61679ce74143b9205812882e168","schema_version":"1.0","event_id":"sha256:036c886de37244c2a3c400e03ac4fe48e878d61679ce74143b9205812882e168"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B6LV7QUHELX5FB264DMEMXU7J7/bundle.json","state_url":"https://pith.science/pith/B6LV7QUHELX5FB264DMEMXU7J7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B6LV7QUHELX5FB264DMEMXU7J7/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-06-02T07:43:18Z","links":{"resolver":"https://pith.science/pith/B6LV7QUHELX5FB264DMEMXU7J7","bundle":"https://pith.science/pith/B6LV7QUHELX5FB264DMEMXU7J7/bundle.json","state":"https://pith.science/pith/B6LV7QUHELX5FB264DMEMXU7J7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B6LV7QUHELX5FB264DMEMXU7J7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B6LV7QUHELX5FB264DMEMXU7J7","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":"c534051fe99b7e75878cc91e7c0cc52f12e2bc4f5f75f1bf6b5bd3f376067cfe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-28T19:56:40Z","title_canon_sha256":"45bcde8d44e7a1c4ffe208f364fb5ac69fb7d662204efaa52fd661dd05c6d8db"},"schema_version":"1.0","source":{"id":"1801.09275","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09275","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09275v1","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09275","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"pith_short_12","alias_value":"B6LV7QUHELX5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B6LV7QUHELX5FB26","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B6LV7QUH","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:036c886de37244c2a3c400e03ac4fe48e878d61679ce74143b9205812882e168","target":"graph","created_at":"2026-05-18T00:24:57Z","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":"Testing whether a set $\\mathbf{f}$ of polynomials has an algebraic dependence is a basic problem with several applications. The polynomials are given as algebraic circuits. Algebraic independence testing question is wide open over finite fields (Dvir, Gabizon, Wigderson, FOCS'07). The best complexity known is NP$^{\\#\\rm P}$ (Mittmann, Saxena, Scheiblechner, Trans.AMS'14). In this work we put the problem in AM $\\cap$ coAM. In particular, dependence testing is unlikely to be NP-hard and joins the league of problems of \"intermediate\" complexity, eg. graph isomorphism & integer factoring. Our proo","authors_text":"Amit Sinhababu, Nitin Saxena, Zeyu Guo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-28T19:56:40Z","title":"Algebraic dependencies and PSPACE algorithms in approximative complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09275","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:4f3da086ed6eca007f627576b7f47c9e20380c6db78d4bfaec74960b203417ab","target":"record","created_at":"2026-05-18T00:24:57Z","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":"c534051fe99b7e75878cc91e7c0cc52f12e2bc4f5f75f1bf6b5bd3f376067cfe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-28T19:56:40Z","title_canon_sha256":"45bcde8d44e7a1c4ffe208f364fb5ac69fb7d662204efaa52fd661dd05c6d8db"},"schema_version":"1.0","source":{"id":"1801.09275","kind":"arxiv","version":1}},"canonical_sha256":"0f975fc28722efd2875ee0d8465e9f4fc4168dd36625ce85a9890df48b36c070","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f975fc28722efd2875ee0d8465e9f4fc4168dd36625ce85a9890df48b36c070","first_computed_at":"2026-05-18T00:24:57.975199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:57.975199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vtH4JOYgXMAQr5NLMkpkBTf5zsYTdBRBD3OSzVq6orucKIPl3AIwahzXMWl0bIkoWKMcthi7LTL/dJeLXHl4Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:57.975801Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09275","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f3da086ed6eca007f627576b7f47c9e20380c6db78d4bfaec74960b203417ab","sha256:036c886de37244c2a3c400e03ac4fe48e878d61679ce74143b9205812882e168"],"state_sha256":"d6cc2b536181f29ad821ddccc3f9541d70ad4d2728a95c80199b65fa3330d9f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WCurD9pBroIA7zaWdBG687CwXsfyuoOxTtc2D5RAqaDO4V3Mq1df1IBtrvup1FcPM2jmk0mg3AXUxOJ1TaGNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:43:18.082350Z","bundle_sha256":"89d1f359b4da1125b3867a7457c14def789170230a9f4076859cebefa124c0c2"}}