{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KL572I2IGOW35OXM2R4B3JTP36","short_pith_number":"pith:KL572I2I","canonical_record":{"source":{"id":"1809.04092","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-11T18:04:36Z","cross_cats_sorted":[],"title_canon_sha256":"8317ad3e9c4ad062b00526a19b9349077e53ee38af5bdcc86b45d1cac6dc8491","abstract_canon_sha256":"514172984be1064c2e6c08505bf6ae287fe26876362a3446e6fab762523c6f15"},"schema_version":"1.0"},"canonical_sha256":"52fbfd234833adbebaecd4781da66fdf8c86325a42ce78d59045fe6587f7220d","source":{"kind":"arxiv","id":"1809.04092","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04092","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04092v2","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04092","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"pith_short_12","alias_value":"KL572I2IGOW3","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KL572I2IGOW35OXM","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KL572I2I","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KL572I2IGOW35OXM2R4B3JTP36","target":"record","payload":{"canonical_record":{"source":{"id":"1809.04092","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-11T18:04:36Z","cross_cats_sorted":[],"title_canon_sha256":"8317ad3e9c4ad062b00526a19b9349077e53ee38af5bdcc86b45d1cac6dc8491","abstract_canon_sha256":"514172984be1064c2e6c08505bf6ae287fe26876362a3446e6fab762523c6f15"},"schema_version":"1.0"},"canonical_sha256":"52fbfd234833adbebaecd4781da66fdf8c86325a42ce78d59045fe6587f7220d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:09.346408Z","signature_b64":"gNS9RSkoQy4yqorgkh1GRKrnUNJOk9PG/+/XJlsmGXzO55idg77xmr8svsdnU3Qxbur4MbLxL0RXLDYU1feNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52fbfd234833adbebaecd4781da66fdf8c86325a42ce78d59045fe6587f7220d","last_reissued_at":"2026-05-17T23:53:09.345815Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:09.345815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.04092","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-05-17T23:53:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Nh6UiieAQH5IuwelX/ChYeV/DqXK8MClpTtT87aD51TBYZwEdZm1OTpt9je+npe8Uxt2A8awiWbJgZhZyUcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:33:05.449056Z"},"content_sha256":"1b91fd297630b40795015001b2c0bc64da380d440219394bbaf672d311f26fdd","schema_version":"1.0","event_id":"sha256:1b91fd297630b40795015001b2c0bc64da380d440219394bbaf672d311f26fdd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KL572I2IGOW35OXM2R4B3JTP36","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fixed-Depth Size-Hierarchy Theorem for AC$^0[\\oplus]$ via the Coin Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Karteek Sreenivasaiah, Nutan Limaye, Srikanth Srinivasan, S. Venkitesh, Utkarsh Tripathi","submitted_at":"2018-09-11T18:04:36Z","abstract_excerpt":"We prove the first Fixed-depth Size-hierarchy Theorem for uniform AC$^0[\\oplus]$ circuits; in particular, for fixed $d$, the class $\\mathcal{C}_{d,k}$ of uniform AC$^0[\\oplus]$ formulas of depth $d$ and size $n^k$ form an infinite hierarchy. For this, we find the first class of explicit functions giving (up to polynomial factor) matching upper and lower bounds for AC$^0[\\oplus]$ formulas, derived from the $\\delta$-Coin Problem, the computational problem of distinguishing between coins that are heads with probability $(1+\\delta)/2$ or $(1-\\delta)/2,$ where $\\delta$ is a parameter going to $0$. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04092","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":""},"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-17T23:53:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"41+DKlfbu30Dyu3RLXEvTzVg+OamkYisrH4wP8NW/sc60SKlsJ+cTKmOa8Db/pYOvvae1zsbgJsp1fgHFKRUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:33:05.449397Z"},"content_sha256":"55ccb6acb9106b2e4c20d0238b7c1ba1888f898c4a68173c40fb86d69ab54318","schema_version":"1.0","event_id":"sha256:55ccb6acb9106b2e4c20d0238b7c1ba1888f898c4a68173c40fb86d69ab54318"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KL572I2IGOW35OXM2R4B3JTP36/bundle.json","state_url":"https://pith.science/pith/KL572I2IGOW35OXM2R4B3JTP36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KL572I2IGOW35OXM2R4B3JTP36/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-27T16:33:05Z","links":{"resolver":"https://pith.science/pith/KL572I2IGOW35OXM2R4B3JTP36","bundle":"https://pith.science/pith/KL572I2IGOW35OXM2R4B3JTP36/bundle.json","state":"https://pith.science/pith/KL572I2IGOW35OXM2R4B3JTP36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KL572I2IGOW35OXM2R4B3JTP36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KL572I2IGOW35OXM2R4B3JTP36","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":"514172984be1064c2e6c08505bf6ae287fe26876362a3446e6fab762523c6f15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-11T18:04:36Z","title_canon_sha256":"8317ad3e9c4ad062b00526a19b9349077e53ee38af5bdcc86b45d1cac6dc8491"},"schema_version":"1.0","source":{"id":"1809.04092","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04092","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04092v2","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04092","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"pith_short_12","alias_value":"KL572I2IGOW3","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KL572I2IGOW35OXM","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KL572I2I","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:55ccb6acb9106b2e4c20d0238b7c1ba1888f898c4a68173c40fb86d69ab54318","target":"graph","created_at":"2026-05-17T23:53:09Z","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 the first Fixed-depth Size-hierarchy Theorem for uniform AC$^0[\\oplus]$ circuits; in particular, for fixed $d$, the class $\\mathcal{C}_{d,k}$ of uniform AC$^0[\\oplus]$ formulas of depth $d$ and size $n^k$ form an infinite hierarchy. For this, we find the first class of explicit functions giving (up to polynomial factor) matching upper and lower bounds for AC$^0[\\oplus]$ formulas, derived from the $\\delta$-Coin Problem, the computational problem of distinguishing between coins that are heads with probability $(1+\\delta)/2$ or $(1-\\delta)/2,$ where $\\delta$ is a parameter going to $0$. ","authors_text":"Karteek Sreenivasaiah, Nutan Limaye, Srikanth Srinivasan, S. Venkitesh, Utkarsh Tripathi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-11T18:04:36Z","title":"A Fixed-Depth Size-Hierarchy Theorem for AC$^0[\\oplus]$ via the Coin Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04092","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:1b91fd297630b40795015001b2c0bc64da380d440219394bbaf672d311f26fdd","target":"record","created_at":"2026-05-17T23:53:09Z","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":"514172984be1064c2e6c08505bf6ae287fe26876362a3446e6fab762523c6f15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-11T18:04:36Z","title_canon_sha256":"8317ad3e9c4ad062b00526a19b9349077e53ee38af5bdcc86b45d1cac6dc8491"},"schema_version":"1.0","source":{"id":"1809.04092","kind":"arxiv","version":2}},"canonical_sha256":"52fbfd234833adbebaecd4781da66fdf8c86325a42ce78d59045fe6587f7220d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52fbfd234833adbebaecd4781da66fdf8c86325a42ce78d59045fe6587f7220d","first_computed_at":"2026-05-17T23:53:09.345815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:09.345815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gNS9RSkoQy4yqorgkh1GRKrnUNJOk9PG/+/XJlsmGXzO55idg77xmr8svsdnU3Qxbur4MbLxL0RXLDYU1feNCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:09.346408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04092","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b91fd297630b40795015001b2c0bc64da380d440219394bbaf672d311f26fdd","sha256:55ccb6acb9106b2e4c20d0238b7c1ba1888f898c4a68173c40fb86d69ab54318"],"state_sha256":"e750070cecc879fbaee01ba4e1a25ae7258632fd25acb0bc0846d8a44d7288fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bH7Ow4YZ31YB+MDj9Z4PZOOXaP/ac0scvao/HpvS47Bxk8P6j2eP4FWZL+KpwFtLqV5wztpI+P7GyCO87YFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:33:05.451114Z","bundle_sha256":"7a484a021dffa79a4dbc234683c46435d40cdfa900a1dfbd8bbec982e76a74b5"}}