{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:FFBG34DPGLA7EYTATSN224MP5H","short_pith_number":"pith:FFBG34DP","schema_version":"1.0","canonical_sha256":"29426df06f32c1f262609c9bad718fe9d39f1cd7fc45dd86db20e932de9d0b46","source":{"kind":"arxiv","id":"1001.2416","version":6},"attestation_state":"computed","paper":{"title":"Computing the output distribution and selection probabilities of a stack filter from the DNF of its positive Boolean function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LO","authors_text":"Marcel Wild","submitted_at":"2010-01-14T11:00:33Z","abstract_excerpt":"Many nonlinear filters used in practise are stack filters. An algorithm is presented which calculates the output distribution of an arbitrary stack filter S from the disjunctive normal form (DNF) of its underlying positive Boolean function. The so called selection probabilities can be computed along the way."},"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":"1001.2416","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-01-14T11:00:33Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7681f6fcf4d6bf5fda63385b297224acf29935ae4cdbe29e3d2b60d165156784","abstract_canon_sha256":"3f5292fdf3d7cc17f10a64b0ed15342fc33ea26fe3a13206c80cbab2269d92f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:52.987542Z","signature_b64":"zeOWMPLCJF+g+se85twQUPDmFTH4w4Ghqfh0m3X1yYz8wgJZuKAVviVm52l2njQUTWUFNasCV8Kdmv7OQMmLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29426df06f32c1f262609c9bad718fe9d39f1cd7fc45dd86db20e932de9d0b46","last_reissued_at":"2026-05-18T00:49:52.987036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:52.987036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the output distribution and selection probabilities of a stack filter from the DNF of its positive Boolean function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LO","authors_text":"Marcel Wild","submitted_at":"2010-01-14T11:00:33Z","abstract_excerpt":"Many nonlinear filters used in practise are stack filters. An algorithm is presented which calculates the output distribution of an arbitrary stack filter S from the disjunctive normal form (DNF) of its underlying positive Boolean function. The so called selection probabilities can be computed along the way."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.2416","kind":"arxiv","version":6},"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":"1001.2416","created_at":"2026-05-18T00:49:52.987114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.2416v6","created_at":"2026-05-18T00:49:52.987114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.2416","created_at":"2026-05-18T00:49:52.987114+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFBG34DPGLA7","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFBG34DPGLA7EYTA","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFBG34DP","created_at":"2026-05-18T12:26:07.630475+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/FFBG34DPGLA7EYTATSN224MP5H","json":"https://pith.science/pith/FFBG34DPGLA7EYTATSN224MP5H.json","graph_json":"https://pith.science/api/pith-number/FFBG34DPGLA7EYTATSN224MP5H/graph.json","events_json":"https://pith.science/api/pith-number/FFBG34DPGLA7EYTATSN224MP5H/events.json","paper":"https://pith.science/paper/FFBG34DP"},"agent_actions":{"view_html":"https://pith.science/pith/FFBG34DPGLA7EYTATSN224MP5H","download_json":"https://pith.science/pith/FFBG34DPGLA7EYTATSN224MP5H.json","view_paper":"https://pith.science/paper/FFBG34DP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.2416&json=true","fetch_graph":"https://pith.science/api/pith-number/FFBG34DPGLA7EYTATSN224MP5H/graph.json","fetch_events":"https://pith.science/api/pith-number/FFBG34DPGLA7EYTATSN224MP5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFBG34DPGLA7EYTATSN224MP5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFBG34DPGLA7EYTATSN224MP5H/action/storage_attestation","attest_author":"https://pith.science/pith/FFBG34DPGLA7EYTATSN224MP5H/action/author_attestation","sign_citation":"https://pith.science/pith/FFBG34DPGLA7EYTATSN224MP5H/action/citation_signature","submit_replication":"https://pith.science/pith/FFBG34DPGLA7EYTATSN224MP5H/action/replication_record"}},"created_at":"2026-05-18T00:49:52.987114+00:00","updated_at":"2026-05-18T00:49:52.987114+00:00"}