{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5HEB6BYJ3OT4W2PW6VCD5ZJ7KB","short_pith_number":"pith:5HEB6BYJ","canonical_record":{"source":{"id":"1701.04428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-16T19:20:42Z","cross_cats_sorted":[],"title_canon_sha256":"05025e64a4fa834aeea8dc5c8928e47e9a4d46d4ea23568f5db5ecdf86757710","abstract_canon_sha256":"64e1e956f943bab7b67b4b0bc9028c9f0d7ecadb12527fd4409263fc6518e410"},"schema_version":"1.0"},"canonical_sha256":"e9c81f0709dba7cb69f6f5443ee53f50573550f074bb55aa6f500ec86c57a2c7","source":{"kind":"arxiv","id":"1701.04428","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04428","created_at":"2026-05-18T00:52:43Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04428v1","created_at":"2026-05-18T00:52:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04428","created_at":"2026-05-18T00:52:43Z"},{"alias_kind":"pith_short_12","alias_value":"5HEB6BYJ3OT4","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5HEB6BYJ3OT4W2PW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5HEB6BYJ","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5HEB6BYJ3OT4W2PW6VCD5ZJ7KB","target":"record","payload":{"canonical_record":{"source":{"id":"1701.04428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-16T19:20:42Z","cross_cats_sorted":[],"title_canon_sha256":"05025e64a4fa834aeea8dc5c8928e47e9a4d46d4ea23568f5db5ecdf86757710","abstract_canon_sha256":"64e1e956f943bab7b67b4b0bc9028c9f0d7ecadb12527fd4409263fc6518e410"},"schema_version":"1.0"},"canonical_sha256":"e9c81f0709dba7cb69f6f5443ee53f50573550f074bb55aa6f500ec86c57a2c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:43.722542Z","signature_b64":"wpiTkuZsihC1h1wgb0w2k5urr/z2e6jEP0yItPH/BXBIwa2nvpA3RoDR+dCBKDi9Qf+j187Ya+5R3XmnrWTiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9c81f0709dba7cb69f6f5443ee53f50573550f074bb55aa6f500ec86c57a2c7","last_reissued_at":"2026-05-18T00:52:43.722052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:43.722052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.04428","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:52:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"83HhtrSl1eTKBVrkr/wgCqkWHf76TiYaQaMdYsnw9pRQpFJWS67iZAPRuzVdYNWUL7ssp0Bs2E98ztg+HMAPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:24:26.272436Z"},"content_sha256":"81774a48b935a5bd61ac9db7c4791980dfba3e74abea9890756cf82571497e41","schema_version":"1.0","event_id":"sha256:81774a48b935a5bd61ac9db7c4791980dfba3e74abea9890756cf82571497e41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5HEB6BYJ3OT4W2PW6VCD5ZJ7KB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some Results on Circuit Lower Bounds and Derandomization of Arthur-Merlin Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"D. M. Stull","submitted_at":"2017-01-16T19:20:42Z","abstract_excerpt":"We prove a downward separation for $\\mathsf{\\Sigma}_2$-time classes. Specifically, we prove that if $\\Sigma_2$E does not have polynomial size non-deterministic circuits, then $\\Sigma_2$SubEXP does not have \\textit{fixed} polynomial size non-deterministic circuits. To achieve this result, we use Santhanam's technique on augmented Arthur-Merlin protocols defined by Aydinlio\\u{g}lu and van Melkebeek. We show that augmented Arthur-Merlin protocols with one bit of advice do not have fixed polynomial size non-deterministic circuits. We also prove a weak unconditional derandomization of a certain typ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04428","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:52:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lAZolm0W+KixnkJYNSgzBS0zMG9LYhdiBTdL6OuYK5HeZH8tTWBw0xO6qjt12UTxWUWgKj5sf21Dh5XMVZOqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:24:26.272776Z"},"content_sha256":"103763baa1b36288389e95f61604a1605edc7b88cae1343fd02b47c3b6f675af","schema_version":"1.0","event_id":"sha256:103763baa1b36288389e95f61604a1605edc7b88cae1343fd02b47c3b6f675af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HEB6BYJ3OT4W2PW6VCD5ZJ7KB/bundle.json","state_url":"https://pith.science/pith/5HEB6BYJ3OT4W2PW6VCD5ZJ7KB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HEB6BYJ3OT4W2PW6VCD5ZJ7KB/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-25T20:24:26Z","links":{"resolver":"https://pith.science/pith/5HEB6BYJ3OT4W2PW6VCD5ZJ7KB","bundle":"https://pith.science/pith/5HEB6BYJ3OT4W2PW6VCD5ZJ7KB/bundle.json","state":"https://pith.science/pith/5HEB6BYJ3OT4W2PW6VCD5ZJ7KB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HEB6BYJ3OT4W2PW6VCD5ZJ7KB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5HEB6BYJ3OT4W2PW6VCD5ZJ7KB","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":"64e1e956f943bab7b67b4b0bc9028c9f0d7ecadb12527fd4409263fc6518e410","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-16T19:20:42Z","title_canon_sha256":"05025e64a4fa834aeea8dc5c8928e47e9a4d46d4ea23568f5db5ecdf86757710"},"schema_version":"1.0","source":{"id":"1701.04428","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04428","created_at":"2026-05-18T00:52:43Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04428v1","created_at":"2026-05-18T00:52:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04428","created_at":"2026-05-18T00:52:43Z"},{"alias_kind":"pith_short_12","alias_value":"5HEB6BYJ3OT4","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5HEB6BYJ3OT4W2PW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5HEB6BYJ","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:103763baa1b36288389e95f61604a1605edc7b88cae1343fd02b47c3b6f675af","target":"graph","created_at":"2026-05-18T00:52:43Z","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":"We prove a downward separation for $\\mathsf{\\Sigma}_2$-time classes. Specifically, we prove that if $\\Sigma_2$E does not have polynomial size non-deterministic circuits, then $\\Sigma_2$SubEXP does not have \\textit{fixed} polynomial size non-deterministic circuits. To achieve this result, we use Santhanam's technique on augmented Arthur-Merlin protocols defined by Aydinlio\\u{g}lu and van Melkebeek. We show that augmented Arthur-Merlin protocols with one bit of advice do not have fixed polynomial size non-deterministic circuits. We also prove a weak unconditional derandomization of a certain typ","authors_text":"D. M. Stull","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-16T19:20:42Z","title":"Some Results on Circuit Lower Bounds and Derandomization of Arthur-Merlin Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04428","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:81774a48b935a5bd61ac9db7c4791980dfba3e74abea9890756cf82571497e41","target":"record","created_at":"2026-05-18T00:52:43Z","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":"64e1e956f943bab7b67b4b0bc9028c9f0d7ecadb12527fd4409263fc6518e410","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-16T19:20:42Z","title_canon_sha256":"05025e64a4fa834aeea8dc5c8928e47e9a4d46d4ea23568f5db5ecdf86757710"},"schema_version":"1.0","source":{"id":"1701.04428","kind":"arxiv","version":1}},"canonical_sha256":"e9c81f0709dba7cb69f6f5443ee53f50573550f074bb55aa6f500ec86c57a2c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9c81f0709dba7cb69f6f5443ee53f50573550f074bb55aa6f500ec86c57a2c7","first_computed_at":"2026-05-18T00:52:43.722052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:43.722052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wpiTkuZsihC1h1wgb0w2k5urr/z2e6jEP0yItPH/BXBIwa2nvpA3RoDR+dCBKDi9Qf+j187Ya+5R3XmnrWTiBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:43.722542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04428","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81774a48b935a5bd61ac9db7c4791980dfba3e74abea9890756cf82571497e41","sha256:103763baa1b36288389e95f61604a1605edc7b88cae1343fd02b47c3b6f675af"],"state_sha256":"10dd3dbb4be97600d29ce0152879a988d1386b1d8f23fe36fcb5e5e80ac621ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ev38rR2C2HdlaP9ayjtsnV0QL8OsgTNwZeOGCUA3Ex3TY244QwxlKSdfL+beGaK2p2R88wIS12LiXoBHwdceDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:24:26.274728Z","bundle_sha256":"11d0d082499a2b7b2a597606bb729336eaac259321efdb1a7720ad0539b8a66e"}}