{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:X4YYTSQR7QNEH3VBSZERONJRRQ","short_pith_number":"pith:X4YYTSQR","schema_version":"1.0","canonical_sha256":"bf3189ca11fc1a43eea196491735318c1624df09c7578ac0233670afd8cd0f16","source":{"kind":"arxiv","id":"1805.10159","version":1},"attestation_state":"computed","paper":{"title":"Linear read-once and related Boolean functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Elena Zamaraeva, Igor Razgon, Nikolai Yu. Zolotykh, Vadim Lozin, Viktor Zamaraev","submitted_at":"2018-05-24T08:13:16Z","abstract_excerpt":"It is known that a positive Boolean function f depending on n variables has at least n + 1 extremal points, i.e. minimal ones and maximal zeros. We show that f has exactly n + 1 extremal points if and only if it is linear read-once. The class of linear read-once functions is known to be the intersection of the classes of read-once and threshold functions. Generalizing this result we show that the class of linear read-once functions is the intersection of read-once and Chow functions. We also find the set of minimal read-once functions which are not linear read-once and the set of minimal thres"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1805.10159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-24T08:13:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fc75a28da39ae7121988ca206ba301dcb53a20cf4e4a21e1e8b2d83ffc87d632","abstract_canon_sha256":"cac975d7f2f19f3702924733a9abc6aca12837b77bb300bae0242312923cb675"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:58.133183Z","signature_b64":"NYh4ADUJD+BiAP3X3/r5oXmanuumPX4uwUZUNnsvMKJ4jWaNJLb+5eg+37wg9Vh+U/E1wQgAzw7twzzYnaLxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf3189ca11fc1a43eea196491735318c1624df09c7578ac0233670afd8cd0f16","last_reissued_at":"2026-05-18T00:14:58.132534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:58.132534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear read-once and related Boolean functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Elena Zamaraeva, Igor Razgon, Nikolai Yu. Zolotykh, Vadim Lozin, Viktor Zamaraev","submitted_at":"2018-05-24T08:13:16Z","abstract_excerpt":"It is known that a positive Boolean function f depending on n variables has at least n + 1 extremal points, i.e. minimal ones and maximal zeros. We show that f has exactly n + 1 extremal points if and only if it is linear read-once. The class of linear read-once functions is known to be the intersection of the classes of read-once and threshold functions. Generalizing this result we show that the class of linear read-once functions is the intersection of read-once and Chow functions. We also find the set of minimal read-once functions which are not linear read-once and the set of minimal thres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10159","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.10159","created_at":"2026-05-18T00:14:58.132652+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10159v1","created_at":"2026-05-18T00:14:58.132652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10159","created_at":"2026-05-18T00:14:58.132652+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4YYTSQR7QNE","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4YYTSQR7QNEH3VB","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4YYTSQR","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X4YYTSQR7QNEH3VBSZERONJRRQ","json":"https://pith.science/pith/X4YYTSQR7QNEH3VBSZERONJRRQ.json","graph_json":"https://pith.science/api/pith-number/X4YYTSQR7QNEH3VBSZERONJRRQ/graph.json","events_json":"https://pith.science/api/pith-number/X4YYTSQR7QNEH3VBSZERONJRRQ/events.json","paper":"https://pith.science/paper/X4YYTSQR"},"agent_actions":{"view_html":"https://pith.science/pith/X4YYTSQR7QNEH3VBSZERONJRRQ","download_json":"https://pith.science/pith/X4YYTSQR7QNEH3VBSZERONJRRQ.json","view_paper":"https://pith.science/paper/X4YYTSQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10159&json=true","fetch_graph":"https://pith.science/api/pith-number/X4YYTSQR7QNEH3VBSZERONJRRQ/graph.json","fetch_events":"https://pith.science/api/pith-number/X4YYTSQR7QNEH3VBSZERONJRRQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4YYTSQR7QNEH3VBSZERONJRRQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4YYTSQR7QNEH3VBSZERONJRRQ/action/storage_attestation","attest_author":"https://pith.science/pith/X4YYTSQR7QNEH3VBSZERONJRRQ/action/author_attestation","sign_citation":"https://pith.science/pith/X4YYTSQR7QNEH3VBSZERONJRRQ/action/citation_signature","submit_replication":"https://pith.science/pith/X4YYTSQR7QNEH3VBSZERONJRRQ/action/replication_record"}},"created_at":"2026-05-18T00:14:58.132652+00:00","updated_at":"2026-05-18T00:14:58.132652+00:00"}