{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LQSTKPBBWEFVMJ4JOGEAU6M5NQ","short_pith_number":"pith:LQSTKPBB","canonical_record":{"source":{"id":"2608.08578","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-09T08:43:25Z","cross_cats_sorted":[],"title_canon_sha256":"dc52b2b1959565aac82017d9da079b77fb25900cdca95a689812d1e587872575","abstract_canon_sha256":"93ab44c860a25a4250d88e028964a4432ad3bc06f39554e42253eba8d3bf2d42"},"schema_version":"1.0"},"canonical_sha256":"5c25353c21b10b56278971880a799d6c128f0441847a9674ecb2a0dbc37f5cca","source":{"kind":"arxiv","id":"2608.08578","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.08578","created_at":"2026-08-11T01:23:02Z"},{"alias_kind":"arxiv_version","alias_value":"2608.08578v1","created_at":"2026-08-11T01:23:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08578","created_at":"2026-08-11T01:23:02Z"},{"alias_kind":"pith_short_12","alias_value":"LQSTKPBBWEFV","created_at":"2026-08-11T01:23:02Z"},{"alias_kind":"pith_short_16","alias_value":"LQSTKPBBWEFVMJ4J","created_at":"2026-08-11T01:23:02Z"},{"alias_kind":"pith_short_8","alias_value":"LQSTKPBB","created_at":"2026-08-11T01:23:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LQSTKPBBWEFVMJ4JOGEAU6M5NQ","target":"record","payload":{"canonical_record":{"source":{"id":"2608.08578","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-09T08:43:25Z","cross_cats_sorted":[],"title_canon_sha256":"dc52b2b1959565aac82017d9da079b77fb25900cdca95a689812d1e587872575","abstract_canon_sha256":"93ab44c860a25a4250d88e028964a4432ad3bc06f39554e42253eba8d3bf2d42"},"schema_version":"1.0"},"canonical_sha256":"5c25353c21b10b56278971880a799d6c128f0441847a9674ecb2a0dbc37f5cca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:23:02.807221Z","signature_b64":"5CzWoQ3MZBnbF3YWT0PKBefVeoBnre39TwI3Z5gn8s1j/m7hh2pbKhJN/v3Vd59op0232fHWAaC/90Kbe4g8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c25353c21b10b56278971880a799d6c128f0441847a9674ecb2a0dbc37f5cca","last_reissued_at":"2026-08-11T01:23:02.803032Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:23:02.803032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.08578","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-08-11T01:23:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8De38Afc1vJC3qls2f9zlqEKW5fOdhYSDzMiRCbBHhTES1c1TztvkiF9RLTCDowzFex7eK4d7J81s3cyD2ubAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T04:41:52.955642Z"},"content_sha256":"36bf08f14d6fda11264f4afb3c0ad99edebd73b73a32250c282f0c9269b0073e","schema_version":"1.0","event_id":"sha256:36bf08f14d6fda11264f4afb3c0ad99edebd73b73a32250c282f0c9269b0073e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LQSTKPBBWEFVMJ4JOGEAU6M5NQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Haoxing Lin","submitted_at":"2026-08-09T08:43:25Z","abstract_excerpt":"We prove lower bounds for $k$-OV, $k$-XOR, and $k$-SUM in nonuniform AC$^0$, tracking how the circuit-size exponent scales with $k$ and using no running-time hypothesis. Our framework gives depth-zero projections from colored subgraph isomorphism to the three targets at dimension, row count, or bit width $O(k\\log n)$, without increasing depth or size, and preserving gate orientation. For every fixed depth and every sufficiently large fixed $k$, we obtain unconditional bounds $n^{\\Omega(k)}$ for $k$-OV and $(n/k)^{\\Omega(k)}$ for $k$-XOR and $k$-SUM, with an absolute exponent-rate constant inde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08578","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.08578/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-08-11T01:23:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qVSK8LwY9qxETRoRIUVptYUQilJqdsL88BQryQSphWEZnE4ds19fOUQMTJZBlBv91y8p7d6VO3bx1mdHj+D7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T04:41:52.956523Z"},"content_sha256":"04262aa510fa8be15e2961e1d49ab13b097f0898b782d0ae22568c0d581b4535","schema_version":"1.0","event_id":"sha256:04262aa510fa8be15e2961e1d49ab13b097f0898b782d0ae22568c0d581b4535"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQSTKPBBWEFVMJ4JOGEAU6M5NQ/bundle.json","state_url":"https://pith.science/pith/LQSTKPBBWEFVMJ4JOGEAU6M5NQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQSTKPBBWEFVMJ4JOGEAU6M5NQ/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-08-19T04:41:52Z","links":{"resolver":"https://pith.science/pith/LQSTKPBBWEFVMJ4JOGEAU6M5NQ","bundle":"https://pith.science/pith/LQSTKPBBWEFVMJ4JOGEAU6M5NQ/bundle.json","state":"https://pith.science/pith/LQSTKPBBWEFVMJ4JOGEAU6M5NQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQSTKPBBWEFVMJ4JOGEAU6M5NQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LQSTKPBBWEFVMJ4JOGEAU6M5NQ","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":"93ab44c860a25a4250d88e028964a4432ad3bc06f39554e42253eba8d3bf2d42","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-09T08:43:25Z","title_canon_sha256":"dc52b2b1959565aac82017d9da079b77fb25900cdca95a689812d1e587872575"},"schema_version":"1.0","source":{"id":"2608.08578","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.08578","created_at":"2026-08-11T01:23:02Z"},{"alias_kind":"arxiv_version","alias_value":"2608.08578v1","created_at":"2026-08-11T01:23:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08578","created_at":"2026-08-11T01:23:02Z"},{"alias_kind":"pith_short_12","alias_value":"LQSTKPBBWEFV","created_at":"2026-08-11T01:23:02Z"},{"alias_kind":"pith_short_16","alias_value":"LQSTKPBBWEFVMJ4J","created_at":"2026-08-11T01:23:02Z"},{"alias_kind":"pith_short_8","alias_value":"LQSTKPBB","created_at":"2026-08-11T01:23:02Z"}],"graph_snapshots":[{"event_id":"sha256:04262aa510fa8be15e2961e1d49ab13b097f0898b782d0ae22568c0d581b4535","target":"graph","created_at":"2026-08-11T01:23:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.08578/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove lower bounds for $k$-OV, $k$-XOR, and $k$-SUM in nonuniform AC$^0$, tracking how the circuit-size exponent scales with $k$ and using no running-time hypothesis. Our framework gives depth-zero projections from colored subgraph isomorphism to the three targets at dimension, row count, or bit width $O(k\\log n)$, without increasing depth or size, and preserving gate orientation. For every fixed depth and every sufficiently large fixed $k$, we obtain unconditional bounds $n^{\\Omega(k)}$ for $k$-OV and $(n/k)^{\\Omega(k)}$ for $k$-XOR and $k$-SUM, with an absolute exponent-rate constant inde","authors_text":"Haoxing Lin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-09T08:43:25Z","title":"Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08578","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:36bf08f14d6fda11264f4afb3c0ad99edebd73b73a32250c282f0c9269b0073e","target":"record","created_at":"2026-08-11T01:23:02Z","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":"93ab44c860a25a4250d88e028964a4432ad3bc06f39554e42253eba8d3bf2d42","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-09T08:43:25Z","title_canon_sha256":"dc52b2b1959565aac82017d9da079b77fb25900cdca95a689812d1e587872575"},"schema_version":"1.0","source":{"id":"2608.08578","kind":"arxiv","version":1}},"canonical_sha256":"5c25353c21b10b56278971880a799d6c128f0441847a9674ecb2a0dbc37f5cca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c25353c21b10b56278971880a799d6c128f0441847a9674ecb2a0dbc37f5cca","first_computed_at":"2026-08-11T01:23:02.803032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-11T01:23:02.803032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5CzWoQ3MZBnbF3YWT0PKBefVeoBnre39TwI3Z5gn8s1j/m7hh2pbKhJN/v3Vd59op0232fHWAaC/90Kbe4g8AA==","signature_status":"signed_v1","signed_at":"2026-08-11T01:23:02.807221Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.08578","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36bf08f14d6fda11264f4afb3c0ad99edebd73b73a32250c282f0c9269b0073e","sha256:04262aa510fa8be15e2961e1d49ab13b097f0898b782d0ae22568c0d581b4535"],"state_sha256":"bdad94a923fd463e2fca8d6e975b76e6452f77ca0d01988d8c1e7d9e252dd356"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bNxbw7i9dkKDYxH9aQstAEAiRKfn5nc8CooBBqnnrdi07sITVaxV2lkVfXZVRXOGoHJIWyOhnUN5DOPF+IadBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T04:41:52.962891Z","bundle_sha256":"0dca856ba0360aa3f2ab549f98c93bd99052eecc58cabaac44ccad3e6b32ae34"}}