{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:STPZHTB7KAFJHUQHTBZVWNKHOE","short_pith_number":"pith:STPZHTB7","schema_version":"1.0","canonical_sha256":"94df93cc3f500a93d20798735b3547713943e1c1a7659bd95e0140491185c8e2","source":{"kind":"arxiv","id":"hep-ex/9703001","version":2},"attestation_state":"computed","paper":{"title":"Signal Confidence Limits from a Neural Network Data Analysis","license":"","headline":"","cross_cats":["hep-ph"],"primary_cat":"hep-ex","authors_text":"B. Berg, J. Riedler (FSU, Tallahassee)","submitted_at":"1997-03-01T22:12:57Z","abstract_excerpt":"This paper deals with a situation of some importance for the analysis of experimental data via Neural Network (NN) or similar devices: Let $N$ data be given, such that $N=N_s+N_b$, where $N_s$ is the number of signals, $N_b$ the number of background events, both unknown. Assume that a NN has been trained, such that it will tag signals with efficiency $F_s$, $(0<F_s<1)$ and background data with $F_b$, $(0<F_b<1)$. Applying the NN yields $N^Y$ tagged events. We demonstrate that the knowledge of $N^Y$ is sufficient to calculate confidence bounds for the signal likelihood, which have the same stat"},"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":"hep-ex/9703001","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"hep-ex","submitted_at":"1997-03-01T22:12:57Z","cross_cats_sorted":["hep-ph"],"title_canon_sha256":"c365d6e447917f99b32e3eb905cb2a98507df6e3737c3dfbd68a110f5ba40fa9","abstract_canon_sha256":"39545e8882a0ac57ca2eb2781adcef315f7234246b91c293489bc1d72e9995c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:43.378343Z","signature_b64":"wOuGiDSbpkUlUigDspGaXz3Aq60jgd2Zcra798ovDJCJThaYe0ZDSUU/soTRZR2DDScWtmuC60lwf7SgUF0JDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94df93cc3f500a93d20798735b3547713943e1c1a7659bd95e0140491185c8e2","last_reissued_at":"2026-05-18T01:06:43.377862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:43.377862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Signal Confidence Limits from a Neural Network Data Analysis","license":"","headline":"","cross_cats":["hep-ph"],"primary_cat":"hep-ex","authors_text":"B. Berg, J. Riedler (FSU, Tallahassee)","submitted_at":"1997-03-01T22:12:57Z","abstract_excerpt":"This paper deals with a situation of some importance for the analysis of experimental data via Neural Network (NN) or similar devices: Let $N$ data be given, such that $N=N_s+N_b$, where $N_s$ is the number of signals, $N_b$ the number of background events, both unknown. Assume that a NN has been trained, such that it will tag signals with efficiency $F_s$, $(0<F_s<1)$ and background data with $F_b$, $(0<F_b<1)$. Applying the NN yields $N^Y$ tagged events. We demonstrate that the knowledge of $N^Y$ is sufficient to calculate confidence bounds for the signal likelihood, which have the same stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"hep-ex/9703001","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":""},"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":"hep-ex/9703001","created_at":"2026-05-18T01:06:43.377933+00:00"},{"alias_kind":"arxiv_version","alias_value":"hep-ex/9703001v2","created_at":"2026-05-18T01:06:43.377933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.hep-ex/9703001","created_at":"2026-05-18T01:06:43.377933+00:00"},{"alias_kind":"pith_short_12","alias_value":"STPZHTB7KAFJ","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_16","alias_value":"STPZHTB7KAFJHUQH","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_8","alias_value":"STPZHTB7","created_at":"2026-05-18T12:25:48.327863+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/STPZHTB7KAFJHUQHTBZVWNKHOE","json":"https://pith.science/pith/STPZHTB7KAFJHUQHTBZVWNKHOE.json","graph_json":"https://pith.science/api/pith-number/STPZHTB7KAFJHUQHTBZVWNKHOE/graph.json","events_json":"https://pith.science/api/pith-number/STPZHTB7KAFJHUQHTBZVWNKHOE/events.json","paper":"https://pith.science/paper/STPZHTB7"},"agent_actions":{"view_html":"https://pith.science/pith/STPZHTB7KAFJHUQHTBZVWNKHOE","download_json":"https://pith.science/pith/STPZHTB7KAFJHUQHTBZVWNKHOE.json","view_paper":"https://pith.science/paper/STPZHTB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=hep-ex/9703001&json=true","fetch_graph":"https://pith.science/api/pith-number/STPZHTB7KAFJHUQHTBZVWNKHOE/graph.json","fetch_events":"https://pith.science/api/pith-number/STPZHTB7KAFJHUQHTBZVWNKHOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STPZHTB7KAFJHUQHTBZVWNKHOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STPZHTB7KAFJHUQHTBZVWNKHOE/action/storage_attestation","attest_author":"https://pith.science/pith/STPZHTB7KAFJHUQHTBZVWNKHOE/action/author_attestation","sign_citation":"https://pith.science/pith/STPZHTB7KAFJHUQHTBZVWNKHOE/action/citation_signature","submit_replication":"https://pith.science/pith/STPZHTB7KAFJHUQHTBZVWNKHOE/action/replication_record"}},"created_at":"2026-05-18T01:06:43.377933+00:00","updated_at":"2026-05-18T01:06:43.377933+00:00"}