{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GPJABNQZKJUXPDK3WE2XJDGPD2","short_pith_number":"pith:GPJABNQZ","canonical_record":{"source":{"id":"1505.04211","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-05-15T22:21:39Z","cross_cats_sorted":[],"title_canon_sha256":"0a2e3a426dd15fa3105782a2f5c82e3d19229cad3e2557ead42982f731faa9bb","abstract_canon_sha256":"8246deabee7398769d2179c7c3e1c182ad6ca787c9b505cda9be3f67d444172b"},"schema_version":"1.0"},"canonical_sha256":"33d200b6195269778d5bb135748ccf1eb7258d12c0777e164aa47c26e570500f","source":{"kind":"arxiv","id":"1505.04211","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04211","created_at":"2026-05-18T01:12:30Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04211v2","created_at":"2026-05-18T01:12:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04211","created_at":"2026-05-18T01:12:30Z"},{"alias_kind":"pith_short_12","alias_value":"GPJABNQZKJUX","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GPJABNQZKJUXPDK3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GPJABNQZ","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GPJABNQZKJUXPDK3WE2XJDGPD2","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04211","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-05-15T22:21:39Z","cross_cats_sorted":[],"title_canon_sha256":"0a2e3a426dd15fa3105782a2f5c82e3d19229cad3e2557ead42982f731faa9bb","abstract_canon_sha256":"8246deabee7398769d2179c7c3e1c182ad6ca787c9b505cda9be3f67d444172b"},"schema_version":"1.0"},"canonical_sha256":"33d200b6195269778d5bb135748ccf1eb7258d12c0777e164aa47c26e570500f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:30.840461Z","signature_b64":"3J2fqiuwDp8ok+cxoKYx/T/eO861zEr6lrF4iPGzKZwnJmF8iJ0T21u4Du+bOYIhjiHsOdWYqI6EYQjFcqGVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33d200b6195269778d5bb135748ccf1eb7258d12c0777e164aa47c26e570500f","last_reissued_at":"2026-05-18T01:12:30.840125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:30.840125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04211","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZVcsLnr5gk60QzE7S5czXWtzzn6fnqPOcKF4i/8lnsBWzmPJ++udmkJalFWmolfqgZzOoFwZ6AruDZg52IBFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:45:54.381351Z"},"content_sha256":"437b06ba1af8c148999003f32ac16fb92b3a9994dc57e8472c2f9b0feabceb2f","schema_version":"1.0","event_id":"sha256:437b06ba1af8c148999003f32ac16fb92b3a9994dc57e8472c2f9b0feabceb2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GPJABNQZKJUXPDK3WE2XJDGPD2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discontinuous Piecewise Polynomial Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"John Loverich","submitted_at":"2015-05-15T22:21:39Z","abstract_excerpt":"An artificial neural network is presented based on the idea of connections between units that are only active for a specific range of input values and zero outside that range (and so are not evaluated outside the active range). The connection function is represented by a polynomial with compact support. The finite range of activation allows for great activation sparsity in the network and means that theoretically you are able to add computational power to the network without increasing the computational time required to evaluate the network for a given input. The polynomial order ranges from f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04211","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L0FiixBWbwD9k6iN/hcy73Njr/kqZG5SvWsU5IOzbI6KCeHDFW6KrtvvyNP2l2ZEoQGl2RFMQJZCRb3+yGYSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:45:54.381707Z"},"content_sha256":"7377b395652f4dc4aed2d700c91daef6734949e8ec71a4e5b55b93b6dac558a6","schema_version":"1.0","event_id":"sha256:7377b395652f4dc4aed2d700c91daef6734949e8ec71a4e5b55b93b6dac558a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPJABNQZKJUXPDK3WE2XJDGPD2/bundle.json","state_url":"https://pith.science/pith/GPJABNQZKJUXPDK3WE2XJDGPD2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPJABNQZKJUXPDK3WE2XJDGPD2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T12:45:54Z","links":{"resolver":"https://pith.science/pith/GPJABNQZKJUXPDK3WE2XJDGPD2","bundle":"https://pith.science/pith/GPJABNQZKJUXPDK3WE2XJDGPD2/bundle.json","state":"https://pith.science/pith/GPJABNQZKJUXPDK3WE2XJDGPD2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPJABNQZKJUXPDK3WE2XJDGPD2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GPJABNQZKJUXPDK3WE2XJDGPD2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8246deabee7398769d2179c7c3e1c182ad6ca787c9b505cda9be3f67d444172b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-05-15T22:21:39Z","title_canon_sha256":"0a2e3a426dd15fa3105782a2f5c82e3d19229cad3e2557ead42982f731faa9bb"},"schema_version":"1.0","source":{"id":"1505.04211","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04211","created_at":"2026-05-18T01:12:30Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04211v2","created_at":"2026-05-18T01:12:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04211","created_at":"2026-05-18T01:12:30Z"},{"alias_kind":"pith_short_12","alias_value":"GPJABNQZKJUX","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GPJABNQZKJUXPDK3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GPJABNQZ","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:7377b395652f4dc4aed2d700c91daef6734949e8ec71a4e5b55b93b6dac558a6","target":"graph","created_at":"2026-05-18T01:12:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"An artificial neural network is presented based on the idea of connections between units that are only active for a specific range of input values and zero outside that range (and so are not evaluated outside the active range). The connection function is represented by a polynomial with compact support. The finite range of activation allows for great activation sparsity in the network and means that theoretically you are able to add computational power to the network without increasing the computational time required to evaluate the network for a given input. The polynomial order ranges from f","authors_text":"John Loverich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-05-15T22:21:39Z","title":"Discontinuous Piecewise Polynomial Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04211","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:437b06ba1af8c148999003f32ac16fb92b3a9994dc57e8472c2f9b0feabceb2f","target":"record","created_at":"2026-05-18T01:12:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8246deabee7398769d2179c7c3e1c182ad6ca787c9b505cda9be3f67d444172b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-05-15T22:21:39Z","title_canon_sha256":"0a2e3a426dd15fa3105782a2f5c82e3d19229cad3e2557ead42982f731faa9bb"},"schema_version":"1.0","source":{"id":"1505.04211","kind":"arxiv","version":2}},"canonical_sha256":"33d200b6195269778d5bb135748ccf1eb7258d12c0777e164aa47c26e570500f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33d200b6195269778d5bb135748ccf1eb7258d12c0777e164aa47c26e570500f","first_computed_at":"2026-05-18T01:12:30.840125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:30.840125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3J2fqiuwDp8ok+cxoKYx/T/eO861zEr6lrF4iPGzKZwnJmF8iJ0T21u4Du+bOYIhjiHsOdWYqI6EYQjFcqGVBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:30.840461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04211","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:437b06ba1af8c148999003f32ac16fb92b3a9994dc57e8472c2f9b0feabceb2f","sha256:7377b395652f4dc4aed2d700c91daef6734949e8ec71a4e5b55b93b6dac558a6"],"state_sha256":"eaee4d0c6ddeb7030cc2da21158765d6456a94474d493b723dd0a804c39fa0d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B7IhEblTLFTNNd8Ati7DsTcFT7tn2bO4/x4qTcogJXKVW4WLAN7Bi309/Bj0XJYdcT4q/JHbQoeoafO3bXfxDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:45:54.383635Z","bundle_sha256":"aa6773363f7d7775d83172cc368809d91843f0c7dff30bd401d65919ac66d154"}}