{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UMOZFPERB2YXTUD54QC4EO3DKQ","short_pith_number":"pith:UMOZFPER","schema_version":"1.0","canonical_sha256":"a31d92bc910eb179d07de405c23b635438e60b0551b79654768ee2b2e472cfb9","source":{"kind":"arxiv","id":"1808.07199","version":2},"attestation_state":"computed","paper":{"title":"New Bounds for Energy Complexity of Boolean Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jayalal Sarma, Krishnamoorthy Dinesh, Samir Otiv","submitted_at":"2018-08-22T03:11:38Z","abstract_excerpt":"$\\newcommand{\\EC}{\\mathsf{EC}}\\newcommand{\\KW}{\\mathsf{KW}}\\newcommand{\\DT}{\\mathsf{DT}}\\newcommand{\\psens}{\\mathsf{psens}} \\newcommand{\\calB}{{\\cal B}} $ For a Boolean function $f:\\{0,1\\}^n \\to \\{0,1\\}$ computed by a circuit $C$ over a finite basis $\\mathcal{B}$, the energy complexity of $C$ (denoted by $\\EC_{\\calB}(C)$) is the maximum over all inputs $\\{0,1\\}^n$ the numbers of gates of the circuit $C$ (excluding the inputs) that output a one. Energy Complexity of a Boolean function over a finite basis $\\calB$ denoted by $\\EC_\\calB(f):= \\min_C \\EC_{\\calB}(C)$ where $C$ is a circuit over $\\cal"},"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":"1808.07199","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-08-22T03:11:38Z","cross_cats_sorted":[],"title_canon_sha256":"e77d371bb11fc8232e5e0b030395639b45ef8c8e39c3fdba48f6adc35da2a373","abstract_canon_sha256":"47977b10315430db628f627fd2b8b6c29799e7f3c12781a50b2e6fd41bf0bd57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:35:42.792822Z","signature_b64":"RgAj23OmBmfi5d/42I8LLReWnOrYH6NFvADoqwo35VrV+hXtnzaZWT81i/w6oIarFL+BwhGTUONlbeEcAnYwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a31d92bc910eb179d07de405c23b635438e60b0551b79654768ee2b2e472cfb9","last_reissued_at":"2026-07-05T01:35:42.792432Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:35:42.792432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Bounds for Energy Complexity of Boolean Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jayalal Sarma, Krishnamoorthy Dinesh, Samir Otiv","submitted_at":"2018-08-22T03:11:38Z","abstract_excerpt":"$\\newcommand{\\EC}{\\mathsf{EC}}\\newcommand{\\KW}{\\mathsf{KW}}\\newcommand{\\DT}{\\mathsf{DT}}\\newcommand{\\psens}{\\mathsf{psens}} \\newcommand{\\calB}{{\\cal B}} $ For a Boolean function $f:\\{0,1\\}^n \\to \\{0,1\\}$ computed by a circuit $C$ over a finite basis $\\mathcal{B}$, the energy complexity of $C$ (denoted by $\\EC_{\\calB}(C)$) is the maximum over all inputs $\\{0,1\\}^n$ the numbers of gates of the circuit $C$ (excluding the inputs) that output a one. Energy Complexity of a Boolean function over a finite basis $\\calB$ denoted by $\\EC_\\calB(f):= \\min_C \\EC_{\\calB}(C)$ where $C$ is a circuit over $\\cal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07199","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1808.07199/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.07199","created_at":"2026-07-05T01:35:42.792491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07199v2","created_at":"2026-07-05T01:35:42.792491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07199","created_at":"2026-07-05T01:35:42.792491+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMOZFPERB2YX","created_at":"2026-07-05T01:35:42.792491+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMOZFPERB2YXTUD5","created_at":"2026-07-05T01:35:42.792491+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMOZFPER","created_at":"2026-07-05T01:35:42.792491+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/UMOZFPERB2YXTUD54QC4EO3DKQ","json":"https://pith.science/pith/UMOZFPERB2YXTUD54QC4EO3DKQ.json","graph_json":"https://pith.science/api/pith-number/UMOZFPERB2YXTUD54QC4EO3DKQ/graph.json","events_json":"https://pith.science/api/pith-number/UMOZFPERB2YXTUD54QC4EO3DKQ/events.json","paper":"https://pith.science/paper/UMOZFPER"},"agent_actions":{"view_html":"https://pith.science/pith/UMOZFPERB2YXTUD54QC4EO3DKQ","download_json":"https://pith.science/pith/UMOZFPERB2YXTUD54QC4EO3DKQ.json","view_paper":"https://pith.science/paper/UMOZFPER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07199&json=true","fetch_graph":"https://pith.science/api/pith-number/UMOZFPERB2YXTUD54QC4EO3DKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/UMOZFPERB2YXTUD54QC4EO3DKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMOZFPERB2YXTUD54QC4EO3DKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMOZFPERB2YXTUD54QC4EO3DKQ/action/storage_attestation","attest_author":"https://pith.science/pith/UMOZFPERB2YXTUD54QC4EO3DKQ/action/author_attestation","sign_citation":"https://pith.science/pith/UMOZFPERB2YXTUD54QC4EO3DKQ/action/citation_signature","submit_replication":"https://pith.science/pith/UMOZFPERB2YXTUD54QC4EO3DKQ/action/replication_record"}},"created_at":"2026-07-05T01:35:42.792491+00:00","updated_at":"2026-07-05T01:35:42.792491+00:00"}