{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IBJ4CFOXHX23AQXXEAH7GJYKJT","short_pith_number":"pith:IBJ4CFOX","canonical_record":{"source":{"id":"1901.05911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-17T17:23:02Z","cross_cats_sorted":[],"title_canon_sha256":"cc5f38c4f44a4a7b79cd576841e43ca7ee585823f8507ade531143aaff6fe152","abstract_canon_sha256":"7223941cbf1f8323b96759b28b3a0fc14a9902c1cd35b731a5ae5e5999a9ab8a"},"schema_version":"1.0"},"canonical_sha256":"4053c115d73df5b042f7200ff3270a4ce935e68378288deacb897977e999d0a8","source":{"kind":"arxiv","id":"1901.05911","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05911","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05911v1","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05911","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"IBJ4CFOXHX23","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IBJ4CFOXHX23AQXX","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IBJ4CFOX","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IBJ4CFOXHX23AQXXEAH7GJYKJT","target":"record","payload":{"canonical_record":{"source":{"id":"1901.05911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-17T17:23:02Z","cross_cats_sorted":[],"title_canon_sha256":"cc5f38c4f44a4a7b79cd576841e43ca7ee585823f8507ade531143aaff6fe152","abstract_canon_sha256":"7223941cbf1f8323b96759b28b3a0fc14a9902c1cd35b731a5ae5e5999a9ab8a"},"schema_version":"1.0"},"canonical_sha256":"4053c115d73df5b042f7200ff3270a4ce935e68378288deacb897977e999d0a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:05.832451Z","signature_b64":"EpOSkOLQXmPY/Ou140eHgJlrO/+LQj9dF5uTDL6TKj3SfXujXuPb9y8kNVISex8pDdD0CIEbmlH8WTOzFRa8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4053c115d73df5b042f7200ff3270a4ce935e68378288deacb897977e999d0a8","last_reissued_at":"2026-05-17T23:56:05.831882Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:05.831882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.05911","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-17T23:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MUJ7u+b3TlHi1ne9GxAxivj2+bYO/kMoQuiuwBUAPSYIKFY0L/sr8ubXkqOfaTg0Z0TlCvWX7E7iOjnGuc6/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:50:36.671074Z"},"content_sha256":"feaabea34fcfa336a557fb4ed3e460d3cba4d5a4c7ed1503ec8a980ec898ee3e","schema_version":"1.0","event_id":"sha256:feaabea34fcfa336a557fb4ed3e460d3cba4d5a4c7ed1503ec8a980ec898ee3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IBJ4CFOXHX23AQXXEAH7GJYKJT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Linear Decision Lists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arkadev Chattopadhyay, Meena Mahajan, Nikhil Mande, Nitin Saurabh","submitted_at":"2019-01-17T17:23:02Z","abstract_excerpt":"We demonstrate a lower bound technique for linear decision lists, which are decision lists where the queries are arbitrary linear threshold functions. We use this technique to prove an explicit lower bound by showing that any linear decision list computing the function $MAJ \\circ XOR$ requires size $2^{0.18 n}$. This completely answers an open question of Tur{\\'a}n and Vatan [FoCM'97]. We also show that the spectral classes $PL_1, PL_\\infty$, and the polynomial threshold function classes $\\widehat{PT}_1, PT_1$, are incomparable to linear decision lists."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05911","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-17T23:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J4fi+ClfyVr8kZO8x1lubf9l1HTubhy46FSLbJohVVVmn271RJNm7gg4GS8sB3jRZszaF516n1CtkP0kmXn9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:50:36.671435Z"},"content_sha256":"296ff753ce84ec6dd6a8324badb459814b959fca88e68ff72d5025e893705208","schema_version":"1.0","event_id":"sha256:296ff753ce84ec6dd6a8324badb459814b959fca88e68ff72d5025e893705208"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBJ4CFOXHX23AQXXEAH7GJYKJT/bundle.json","state_url":"https://pith.science/pith/IBJ4CFOXHX23AQXXEAH7GJYKJT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBJ4CFOXHX23AQXXEAH7GJYKJT/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-22T23:50:36Z","links":{"resolver":"https://pith.science/pith/IBJ4CFOXHX23AQXXEAH7GJYKJT","bundle":"https://pith.science/pith/IBJ4CFOXHX23AQXXEAH7GJYKJT/bundle.json","state":"https://pith.science/pith/IBJ4CFOXHX23AQXXEAH7GJYKJT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBJ4CFOXHX23AQXXEAH7GJYKJT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IBJ4CFOXHX23AQXXEAH7GJYKJT","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":"7223941cbf1f8323b96759b28b3a0fc14a9902c1cd35b731a5ae5e5999a9ab8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-17T17:23:02Z","title_canon_sha256":"cc5f38c4f44a4a7b79cd576841e43ca7ee585823f8507ade531143aaff6fe152"},"schema_version":"1.0","source":{"id":"1901.05911","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05911","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05911v1","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05911","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"IBJ4CFOXHX23","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IBJ4CFOXHX23AQXX","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IBJ4CFOX","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:296ff753ce84ec6dd6a8324badb459814b959fca88e68ff72d5025e893705208","target":"graph","created_at":"2026-05-17T23:56:05Z","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 demonstrate a lower bound technique for linear decision lists, which are decision lists where the queries are arbitrary linear threshold functions. We use this technique to prove an explicit lower bound by showing that any linear decision list computing the function $MAJ \\circ XOR$ requires size $2^{0.18 n}$. This completely answers an open question of Tur{\\'a}n and Vatan [FoCM'97]. We also show that the spectral classes $PL_1, PL_\\infty$, and the polynomial threshold function classes $\\widehat{PT}_1, PT_1$, are incomparable to linear decision lists.","authors_text":"Arkadev Chattopadhyay, Meena Mahajan, Nikhil Mande, Nitin Saurabh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-17T17:23:02Z","title":"Lower Bounds for Linear Decision Lists"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05911","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:feaabea34fcfa336a557fb4ed3e460d3cba4d5a4c7ed1503ec8a980ec898ee3e","target":"record","created_at":"2026-05-17T23:56:05Z","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":"7223941cbf1f8323b96759b28b3a0fc14a9902c1cd35b731a5ae5e5999a9ab8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-17T17:23:02Z","title_canon_sha256":"cc5f38c4f44a4a7b79cd576841e43ca7ee585823f8507ade531143aaff6fe152"},"schema_version":"1.0","source":{"id":"1901.05911","kind":"arxiv","version":1}},"canonical_sha256":"4053c115d73df5b042f7200ff3270a4ce935e68378288deacb897977e999d0a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4053c115d73df5b042f7200ff3270a4ce935e68378288deacb897977e999d0a8","first_computed_at":"2026-05-17T23:56:05.831882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:05.831882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EpOSkOLQXmPY/Ou140eHgJlrO/+LQj9dF5uTDL6TKj3SfXujXuPb9y8kNVISex8pDdD0CIEbmlH8WTOzFRa8Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:05.832451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05911","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:feaabea34fcfa336a557fb4ed3e460d3cba4d5a4c7ed1503ec8a980ec898ee3e","sha256:296ff753ce84ec6dd6a8324badb459814b959fca88e68ff72d5025e893705208"],"state_sha256":"d39eb4b44a7fd460fe622c8c0f407804d559985ffea375b975f0ec5a2893fa2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TGQbLq9HJ9RljwaJBuwIsvk6kA2fmDacxbk1WZoeZd8C38TGffcOZoia3N7Hy/3hy/4wBzRDWH4IbXvAMoG7Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:50:36.673470Z","bundle_sha256":"2fc81b701770d6a09b1a9e1bd72e1322f1e10dfb5a124a053691c5b29b6a3108"}}