{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QK3355IKBV2W5TZZFKK6HIB6EU","short_pith_number":"pith:QK3355IK","canonical_record":{"source":{"id":"1805.07507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-19T03:40:52Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"a0688003218d0326c9826cc46053047810a24738463dbb03f2a5d606717ac434","abstract_canon_sha256":"f6514774b491b86ef5d4551d0c059155419cc47df4822c0ef3c22b04d3992f4a"},"schema_version":"1.0"},"canonical_sha256":"82b7bef50a0d756ecf392a95e3a03e250155d75cd672721e7398cb032f0187a3","source":{"kind":"arxiv","id":"1805.07507","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07507","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07507v1","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07507","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"QK3355IKBV2W","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QK3355IKBV2W5TZZ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QK3355IK","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QK3355IKBV2W5TZZFKK6HIB6EU","target":"record","payload":{"canonical_record":{"source":{"id":"1805.07507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-19T03:40:52Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"a0688003218d0326c9826cc46053047810a24738463dbb03f2a5d606717ac434","abstract_canon_sha256":"f6514774b491b86ef5d4551d0c059155419cc47df4822c0ef3c22b04d3992f4a"},"schema_version":"1.0"},"canonical_sha256":"82b7bef50a0d756ecf392a95e3a03e250155d75cd672721e7398cb032f0187a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:33.411577Z","signature_b64":"6FPG1T9WRGHVivN06pVP6PyPCuaJ7M+74EDc5zqmPPf4YN3v0ee5U7vxPTioJm0vNIP0r9MNLz9zW9//eN4LAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82b7bef50a0d756ecf392a95e3a03e250155d75cd672721e7398cb032f0187a3","last_reissued_at":"2026-05-18T00:15:33.410967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:33.410967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.07507","source_version":1,"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-18T00:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C3vWFZlxQuo480SdP976rxNxXGYC92YZAjChK1YhSKZj1qGic41TeT7ILpyXjJna7atRk7HSQMF39YgxcI8vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:37:42.689670Z"},"content_sha256":"8dbaf3738a9b5971b93709ea55c262b7e277e741bd310f0726c81edb2ddd1aa7","schema_version":"1.0","event_id":"sha256:8dbaf3738a9b5971b93709ea55c262b7e277e741bd310f0726c81edb2ddd1aa7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QK3355IKBV2W5TZZFKK6HIB6EU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconciled Polynomial Machine: A Unified Representation of Shallow and Deep Learning Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fisher B. Gouza, Jiawei Zhang, Limeng Cui","submitted_at":"2018-05-19T03:40:52Z","abstract_excerpt":"In this paper, we aim at introducing a new machine learning model, namely reconciled polynomial machine, which can provide a unified representation of existing shallow and deep machine learning models. Reconciled polynomial machine predicts the output by computing the inner product of the feature kernel function and variable reconciling function. Analysis of several concrete models, including Linear Models, FM, MVM, Perceptron, MLP and Deep Neural Networks, will be provided in this paper, which can all be reduced to the reconciled polynomial machine representations. Detailed analysis of the le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07507","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"},"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-18T00:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fcH9BguNOLU72x+XM2a0Mxor8hMUnIbcx2/3oBJRXzCu7BccAjk0VqCCUXwgU7OlXeTQVZ+mNZcGl/emMJ4kCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:37:42.690015Z"},"content_sha256":"4a2da1f04a0ec3c0429239ff7f3a57f417935627e521622762334fc47419f703","schema_version":"1.0","event_id":"sha256:4a2da1f04a0ec3c0429239ff7f3a57f417935627e521622762334fc47419f703"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QK3355IKBV2W5TZZFKK6HIB6EU/bundle.json","state_url":"https://pith.science/pith/QK3355IKBV2W5TZZFKK6HIB6EU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QK3355IKBV2W5TZZFKK6HIB6EU/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-28T03:37:42Z","links":{"resolver":"https://pith.science/pith/QK3355IKBV2W5TZZFKK6HIB6EU","bundle":"https://pith.science/pith/QK3355IKBV2W5TZZFKK6HIB6EU/bundle.json","state":"https://pith.science/pith/QK3355IKBV2W5TZZFKK6HIB6EU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QK3355IKBV2W5TZZFKK6HIB6EU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QK3355IKBV2W5TZZFKK6HIB6EU","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":"f6514774b491b86ef5d4551d0c059155419cc47df4822c0ef3c22b04d3992f4a","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-19T03:40:52Z","title_canon_sha256":"a0688003218d0326c9826cc46053047810a24738463dbb03f2a5d606717ac434"},"schema_version":"1.0","source":{"id":"1805.07507","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07507","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07507v1","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07507","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"QK3355IKBV2W","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QK3355IKBV2W5TZZ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QK3355IK","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:4a2da1f04a0ec3c0429239ff7f3a57f417935627e521622762334fc47419f703","target":"graph","created_at":"2026-05-18T00:15:33Z","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":"In this paper, we aim at introducing a new machine learning model, namely reconciled polynomial machine, which can provide a unified representation of existing shallow and deep machine learning models. Reconciled polynomial machine predicts the output by computing the inner product of the feature kernel function and variable reconciling function. Analysis of several concrete models, including Linear Models, FM, MVM, Perceptron, MLP and Deep Neural Networks, will be provided in this paper, which can all be reduced to the reconciled polynomial machine representations. Detailed analysis of the le","authors_text":"Fisher B. Gouza, Jiawei Zhang, Limeng Cui","cross_cats":["cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-19T03:40:52Z","title":"Reconciled Polynomial Machine: A Unified Representation of Shallow and Deep Learning Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07507","kind":"arxiv","version":1},"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:8dbaf3738a9b5971b93709ea55c262b7e277e741bd310f0726c81edb2ddd1aa7","target":"record","created_at":"2026-05-18T00:15:33Z","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":"f6514774b491b86ef5d4551d0c059155419cc47df4822c0ef3c22b04d3992f4a","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-19T03:40:52Z","title_canon_sha256":"a0688003218d0326c9826cc46053047810a24738463dbb03f2a5d606717ac434"},"schema_version":"1.0","source":{"id":"1805.07507","kind":"arxiv","version":1}},"canonical_sha256":"82b7bef50a0d756ecf392a95e3a03e250155d75cd672721e7398cb032f0187a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82b7bef50a0d756ecf392a95e3a03e250155d75cd672721e7398cb032f0187a3","first_computed_at":"2026-05-18T00:15:33.410967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:33.410967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6FPG1T9WRGHVivN06pVP6PyPCuaJ7M+74EDc5zqmPPf4YN3v0ee5U7vxPTioJm0vNIP0r9MNLz9zW9//eN4LAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:33.411577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07507","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8dbaf3738a9b5971b93709ea55c262b7e277e741bd310f0726c81edb2ddd1aa7","sha256:4a2da1f04a0ec3c0429239ff7f3a57f417935627e521622762334fc47419f703"],"state_sha256":"ad21bca6c1ba6969d729a7950d5da0d48320c075658431b2523ad8c50b8af9ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psdmz22lj7wTdXnODIB3CYxN1klLmheTNETU4l7Uc/ShZhrpMk5PJ1b6S44Q8Cc6/Wh91mxssi6vIm+ELOXJBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:37:42.691988Z","bundle_sha256":"966cbfc268ce09620c3a640a6cc84b30e8f6c4f0b5982d45c88e112204d2877c"}}