{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WF4RXF4T3VWJVQONTIJACQSQKG","short_pith_number":"pith:WF4RXF4T","canonical_record":{"source":{"id":"1901.07828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-23T11:36:33Z","cross_cats_sorted":[],"title_canon_sha256":"b844ebf9c1a56d086f483d548050be89af2f6ffbe64ed73c4778f44b2589fd3a","abstract_canon_sha256":"5e37c2aee64c32c185c991f2b8c303c94bdde2229a0ab6b1e6d29c6825a1a43f"},"schema_version":"1.0"},"canonical_sha256":"b1791b9793dd6c9ac1cd9a120142505196d5544da23b0d100016908a23836fd4","source":{"kind":"arxiv","id":"1901.07828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07828","created_at":"2026-05-17T23:42:24Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07828v1","created_at":"2026-05-17T23:42:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07828","created_at":"2026-05-17T23:42:24Z"},{"alias_kind":"pith_short_12","alias_value":"WF4RXF4T3VWJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WF4RXF4T3VWJVQON","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WF4RXF4T","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WF4RXF4T3VWJVQONTIJACQSQKG","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-23T11:36:33Z","cross_cats_sorted":[],"title_canon_sha256":"b844ebf9c1a56d086f483d548050be89af2f6ffbe64ed73c4778f44b2589fd3a","abstract_canon_sha256":"5e37c2aee64c32c185c991f2b8c303c94bdde2229a0ab6b1e6d29c6825a1a43f"},"schema_version":"1.0"},"canonical_sha256":"b1791b9793dd6c9ac1cd9a120142505196d5544da23b0d100016908a23836fd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:24.504617Z","signature_b64":"6vnQbUmu4UGzK9BK2sXtks1hiJMdIG2umG61Pj7dRChG0KLKrRZghui5RxdnHW8XKh8dXEQjh41AzD+oaZQDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1791b9793dd6c9ac1cd9a120142505196d5544da23b0d100016908a23836fd4","last_reissued_at":"2026-05-17T23:42:24.503894Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:24.503894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07828","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-17T23:42:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPFFnwY4mrt8CpRLW9rgNGg62jQLgEB8kFZGsVvKYGD6/t04Qlz8fzJOXIFTE4GFWjCo4s3WuBQXsJ9Hz7NpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:24:21.498102Z"},"content_sha256":"c3dbde42610a999854d09afe6e6ceeb92ce7bbb675ea672007c1d07118cc9efe","schema_version":"1.0","event_id":"sha256:c3dbde42610a999854d09afe6e6ceeb92ce7bbb675ea672007c1d07118cc9efe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WF4RXF4T3VWJVQONTIJACQSQKG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Forest with Learned Representations for Semantic Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Byeongkeun Kang, Truong Q. Nguyen","submitted_at":"2019-01-23T11:36:33Z","abstract_excerpt":"In this work, we present a random forest framework that learns the weights, shapes, and sparsities of feature representations for real-time semantic segmentation. Typical filters (kernels) have predetermined shapes and sparsities and learn only weights. A few feature extraction methods fix weights and learn only shapes and sparsities. These predetermined constraints restrict learning and extracting optimal features. To overcome this limitation, we propose an unconstrained representation that is able to extract optimal features by learning weights, shapes, and sparsities. We, then, present the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07828","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-17T23:42:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k93HYstZv4Ry+MRzpfTyLvBY1oczkoPXj9rkPdJ4MzBTbLAh/IOXj148Ir2nfgvx5bEBvY5OkrXTWKfjJ4oSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:24:21.498468Z"},"content_sha256":"734d292871902b88440917ae8dd33211bc7cd33776dacfbc5dba20f6fcc1ffa4","schema_version":"1.0","event_id":"sha256:734d292871902b88440917ae8dd33211bc7cd33776dacfbc5dba20f6fcc1ffa4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WF4RXF4T3VWJVQONTIJACQSQKG/bundle.json","state_url":"https://pith.science/pith/WF4RXF4T3VWJVQONTIJACQSQKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WF4RXF4T3VWJVQONTIJACQSQKG/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-06-03T05:24:21Z","links":{"resolver":"https://pith.science/pith/WF4RXF4T3VWJVQONTIJACQSQKG","bundle":"https://pith.science/pith/WF4RXF4T3VWJVQONTIJACQSQKG/bundle.json","state":"https://pith.science/pith/WF4RXF4T3VWJVQONTIJACQSQKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WF4RXF4T3VWJVQONTIJACQSQKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WF4RXF4T3VWJVQONTIJACQSQKG","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":"5e37c2aee64c32c185c991f2b8c303c94bdde2229a0ab6b1e6d29c6825a1a43f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-23T11:36:33Z","title_canon_sha256":"b844ebf9c1a56d086f483d548050be89af2f6ffbe64ed73c4778f44b2589fd3a"},"schema_version":"1.0","source":{"id":"1901.07828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07828","created_at":"2026-05-17T23:42:24Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07828v1","created_at":"2026-05-17T23:42:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07828","created_at":"2026-05-17T23:42:24Z"},{"alias_kind":"pith_short_12","alias_value":"WF4RXF4T3VWJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WF4RXF4T3VWJVQON","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WF4RXF4T","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:734d292871902b88440917ae8dd33211bc7cd33776dacfbc5dba20f6fcc1ffa4","target":"graph","created_at":"2026-05-17T23:42:24Z","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 work, we present a random forest framework that learns the weights, shapes, and sparsities of feature representations for real-time semantic segmentation. Typical filters (kernels) have predetermined shapes and sparsities and learn only weights. A few feature extraction methods fix weights and learn only shapes and sparsities. These predetermined constraints restrict learning and extracting optimal features. To overcome this limitation, we propose an unconstrained representation that is able to extract optimal features by learning weights, shapes, and sparsities. We, then, present the ","authors_text":"Byeongkeun Kang, Truong Q. Nguyen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-23T11:36:33Z","title":"Random Forest with Learned Representations for Semantic Segmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07828","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:c3dbde42610a999854d09afe6e6ceeb92ce7bbb675ea672007c1d07118cc9efe","target":"record","created_at":"2026-05-17T23:42:24Z","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":"5e37c2aee64c32c185c991f2b8c303c94bdde2229a0ab6b1e6d29c6825a1a43f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-23T11:36:33Z","title_canon_sha256":"b844ebf9c1a56d086f483d548050be89af2f6ffbe64ed73c4778f44b2589fd3a"},"schema_version":"1.0","source":{"id":"1901.07828","kind":"arxiv","version":1}},"canonical_sha256":"b1791b9793dd6c9ac1cd9a120142505196d5544da23b0d100016908a23836fd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1791b9793dd6c9ac1cd9a120142505196d5544da23b0d100016908a23836fd4","first_computed_at":"2026-05-17T23:42:24.503894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:24.503894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6vnQbUmu4UGzK9BK2sXtks1hiJMdIG2umG61Pj7dRChG0KLKrRZghui5RxdnHW8XKh8dXEQjh41AzD+oaZQDAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:24.504617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3dbde42610a999854d09afe6e6ceeb92ce7bbb675ea672007c1d07118cc9efe","sha256:734d292871902b88440917ae8dd33211bc7cd33776dacfbc5dba20f6fcc1ffa4"],"state_sha256":"24ed45016f02d4ae756055592bc766d065fa9f873b6314cb2679666fb3502113"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Asf9mxeUM/PPxrhjkw8KmpKYElUc75jXMJ0eDinNvQi0eaNiqQ517r1lN68TFUd8wiPR+PXeKVhtGK3TWgbbAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:24:21.500402Z","bundle_sha256":"0490a5b6fa8ec7feb9013e6ab73a0673910649a6359c2a558d2502b569a2a5eb"}}