{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NNAW6SZSVMPECZK3FOJDSSTFG4","short_pith_number":"pith:NNAW6SZS","schema_version":"1.0","canonical_sha256":"6b416f4b32ab1e41655b2b92394a653712dcccf07e09e3fda27c6513d388c308","source":{"kind":"arxiv","id":"1511.00262","version":1},"attestation_state":"computed","paper":{"title":"The geometry of Tempotronlike problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.NC","authors_text":"Konrad Paul Kording","submitted_at":"2015-11-01T15:49:46Z","abstract_excerpt":"In the discrete Tempotron learning problem a neuron receives time varying inputs and for a set of such input sequences ($\\mathcal S_-$ set) the neuron must be sub-threshold for all times while for some other sequences ($\\mathcal S_+$ set) the neuron must be super threshold for at least one time. Here we present a graphical treatment of a slight reformulation of the tempotron problem. We show that the problem's general form is equivalent to the question if a polytope, specified by a set of inequalities, is contained in the union of a set of equally defined polytopes. Using recent results from c"},"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":"1511.00262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2015-11-01T15:49:46Z","cross_cats_sorted":[],"title_canon_sha256":"8a19f03d3dd619fedd69fb6ce16ad007ca6847e5eec42ab0a093e606bb404ce7","abstract_canon_sha256":"1bd5a9b78147d1624104d75b28e1a8bf1f09cfe5191745e07f3caa7e127e23c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:12.804552Z","signature_b64":"lGHCZZRZQQfbEI7Iy3HUQULarB/SmR5nYSxNveNs/w4qfLeF9T3j5RQG8/hSuu7AkbHG/ThMBc6k/l+vR56jCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b416f4b32ab1e41655b2b92394a653712dcccf07e09e3fda27c6513d388c308","last_reissued_at":"2026-05-18T01:28:12.803858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:12.803858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The geometry of Tempotronlike problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.NC","authors_text":"Konrad Paul Kording","submitted_at":"2015-11-01T15:49:46Z","abstract_excerpt":"In the discrete Tempotron learning problem a neuron receives time varying inputs and for a set of such input sequences ($\\mathcal S_-$ set) the neuron must be sub-threshold for all times while for some other sequences ($\\mathcal S_+$ set) the neuron must be super threshold for at least one time. Here we present a graphical treatment of a slight reformulation of the tempotron problem. We show that the problem's general form is equivalent to the question if a polytope, specified by a set of inequalities, is contained in the union of a set of equally defined polytopes. Using recent results from c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00262","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":"1511.00262","created_at":"2026-05-18T01:28:12.803981+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.00262v1","created_at":"2026-05-18T01:28:12.803981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00262","created_at":"2026-05-18T01:28:12.803981+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNAW6SZSVMPE","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNAW6SZSVMPECZK3","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNAW6SZS","created_at":"2026-05-18T12:29:32.376354+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/NNAW6SZSVMPECZK3FOJDSSTFG4","json":"https://pith.science/pith/NNAW6SZSVMPECZK3FOJDSSTFG4.json","graph_json":"https://pith.science/api/pith-number/NNAW6SZSVMPECZK3FOJDSSTFG4/graph.json","events_json":"https://pith.science/api/pith-number/NNAW6SZSVMPECZK3FOJDSSTFG4/events.json","paper":"https://pith.science/paper/NNAW6SZS"},"agent_actions":{"view_html":"https://pith.science/pith/NNAW6SZSVMPECZK3FOJDSSTFG4","download_json":"https://pith.science/pith/NNAW6SZSVMPECZK3FOJDSSTFG4.json","view_paper":"https://pith.science/paper/NNAW6SZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.00262&json=true","fetch_graph":"https://pith.science/api/pith-number/NNAW6SZSVMPECZK3FOJDSSTFG4/graph.json","fetch_events":"https://pith.science/api/pith-number/NNAW6SZSVMPECZK3FOJDSSTFG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNAW6SZSVMPECZK3FOJDSSTFG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNAW6SZSVMPECZK3FOJDSSTFG4/action/storage_attestation","attest_author":"https://pith.science/pith/NNAW6SZSVMPECZK3FOJDSSTFG4/action/author_attestation","sign_citation":"https://pith.science/pith/NNAW6SZSVMPECZK3FOJDSSTFG4/action/citation_signature","submit_replication":"https://pith.science/pith/NNAW6SZSVMPECZK3FOJDSSTFG4/action/replication_record"}},"created_at":"2026-05-18T01:28:12.803981+00:00","updated_at":"2026-05-18T01:28:12.803981+00:00"}