{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WW6PHLUSTGW2GRVZKIKR3FAXTJ","short_pith_number":"pith:WW6PHLUS","canonical_record":{"source":{"id":"2411.17961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-27T00:37:12Z","cross_cats_sorted":[],"title_canon_sha256":"f995095afe482e6c6edcea55eca8a30190f05fef201aac5eae6546e078282796","abstract_canon_sha256":"9439161151656326100433bdf6554689fd71e37cc29ded4bc503bf3d9a60ec8f"},"schema_version":"1.0"},"canonical_sha256":"b5bcf3ae9299ada346b952151d94179a4430d8aef05dc7b8721430261eef8c7f","source":{"kind":"arxiv","id":"2411.17961","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17961","created_at":"2026-07-05T09:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17961v1","created_at":"2026-07-05T09:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17961","created_at":"2026-07-05T09:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"WW6PHLUSTGW2","created_at":"2026-07-05T09:41:09Z"},{"alias_kind":"pith_short_16","alias_value":"WW6PHLUSTGW2GRVZ","created_at":"2026-07-05T09:41:09Z"},{"alias_kind":"pith_short_8","alias_value":"WW6PHLUS","created_at":"2026-07-05T09:41:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WW6PHLUSTGW2GRVZKIKR3FAXTJ","target":"record","payload":{"canonical_record":{"source":{"id":"2411.17961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-27T00:37:12Z","cross_cats_sorted":[],"title_canon_sha256":"f995095afe482e6c6edcea55eca8a30190f05fef201aac5eae6546e078282796","abstract_canon_sha256":"9439161151656326100433bdf6554689fd71e37cc29ded4bc503bf3d9a60ec8f"},"schema_version":"1.0"},"canonical_sha256":"b5bcf3ae9299ada346b952151d94179a4430d8aef05dc7b8721430261eef8c7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:09.502299Z","signature_b64":"Qy9BzDn7V8m1FjVjZbHScTK8ok+i8tLz7RqX7dWMcFNJrWB+vcZ1bR73YD0ZhrkvCDthPklz9+RktPno3SgnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5bcf3ae9299ada346b952151d94179a4430d8aef05dc7b8721430261eef8c7f","last_reissued_at":"2026-07-05T09:41:09.501882Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:09.501882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.17961","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-07-05T09:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ar687rXvzQ2CYs2ZyUdC68HjW40o74+4PWRH+lwx5JBzOVEDEhI/oi3PCouj8/DmGsPXzcDZVsxDUT9+RdRIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:50:32.389829Z"},"content_sha256":"b99a7020570996745aa9fdb7c2124465d6be15f776a86c24a78c13430e8f3d0f","schema_version":"1.0","event_id":"sha256:b99a7020570996745aa9fdb7c2124465d6be15f776a86c24a78c13430e8f3d0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WW6PHLUSTGW2GRVZKIKR3FAXTJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ESS-ReduNet: Enhancing Subspace Separability of ReduNet via Dynamic Expansion with Bayesian Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fengyang Sun, Haibo Zhang, Jeremiah Deng, Lizhi Peng, Xiaojie Yu","submitted_at":"2024-11-27T00:37:12Z","abstract_excerpt":"ReduNet is a deep neural network model that leverages the principle of maximal coding rate \\textbf{redu}ction to transform original data samples into a low-dimensional, linear discriminative feature representation. Unlike traditional deep learning frameworks, ReduNet constructs its parameters explicitly layer by layer, with each layer's parameters derived based on the features transformed from the preceding layer. Rather than directly using labels, ReduNet uses the similarity between each category's spanned subspace and the data samples for feature updates at each layer. This may lead to featu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17961","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.17961/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bSFW+iaei4jsL/YwocqTHisyu9tvuazjX8vWjBQUm4SRuxP101POr389ucnQpMwu3G99mECQEjOe3fxyT2/oAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:50:32.390499Z"},"content_sha256":"270419ce080f6fc716208b197a1f30715ae09c51abb74c292495d2756cf084cb","schema_version":"1.0","event_id":"sha256:270419ce080f6fc716208b197a1f30715ae09c51abb74c292495d2756cf084cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WW6PHLUSTGW2GRVZKIKR3FAXTJ/bundle.json","state_url":"https://pith.science/pith/WW6PHLUSTGW2GRVZKIKR3FAXTJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WW6PHLUSTGW2GRVZKIKR3FAXTJ/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-08-13T02:50:32Z","links":{"resolver":"https://pith.science/pith/WW6PHLUSTGW2GRVZKIKR3FAXTJ","bundle":"https://pith.science/pith/WW6PHLUSTGW2GRVZKIKR3FAXTJ/bundle.json","state":"https://pith.science/pith/WW6PHLUSTGW2GRVZKIKR3FAXTJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WW6PHLUSTGW2GRVZKIKR3FAXTJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WW6PHLUSTGW2GRVZKIKR3FAXTJ","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":"9439161151656326100433bdf6554689fd71e37cc29ded4bc503bf3d9a60ec8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-27T00:37:12Z","title_canon_sha256":"f995095afe482e6c6edcea55eca8a30190f05fef201aac5eae6546e078282796"},"schema_version":"1.0","source":{"id":"2411.17961","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17961","created_at":"2026-07-05T09:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17961v1","created_at":"2026-07-05T09:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17961","created_at":"2026-07-05T09:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"WW6PHLUSTGW2","created_at":"2026-07-05T09:41:09Z"},{"alias_kind":"pith_short_16","alias_value":"WW6PHLUSTGW2GRVZ","created_at":"2026-07-05T09:41:09Z"},{"alias_kind":"pith_short_8","alias_value":"WW6PHLUS","created_at":"2026-07-05T09:41:09Z"}],"graph_snapshots":[{"event_id":"sha256:270419ce080f6fc716208b197a1f30715ae09c51abb74c292495d2756cf084cb","target":"graph","created_at":"2026-07-05T09:41:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.17961/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"ReduNet is a deep neural network model that leverages the principle of maximal coding rate \\textbf{redu}ction to transform original data samples into a low-dimensional, linear discriminative feature representation. Unlike traditional deep learning frameworks, ReduNet constructs its parameters explicitly layer by layer, with each layer's parameters derived based on the features transformed from the preceding layer. Rather than directly using labels, ReduNet uses the similarity between each category's spanned subspace and the data samples for feature updates at each layer. This may lead to featu","authors_text":"Fengyang Sun, Haibo Zhang, Jeremiah Deng, Lizhi Peng, Xiaojie Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-27T00:37:12Z","title":"ESS-ReduNet: Enhancing Subspace Separability of ReduNet via Dynamic Expansion with Bayesian Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17961","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:b99a7020570996745aa9fdb7c2124465d6be15f776a86c24a78c13430e8f3d0f","target":"record","created_at":"2026-07-05T09:41:09Z","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":"9439161151656326100433bdf6554689fd71e37cc29ded4bc503bf3d9a60ec8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-27T00:37:12Z","title_canon_sha256":"f995095afe482e6c6edcea55eca8a30190f05fef201aac5eae6546e078282796"},"schema_version":"1.0","source":{"id":"2411.17961","kind":"arxiv","version":1}},"canonical_sha256":"b5bcf3ae9299ada346b952151d94179a4430d8aef05dc7b8721430261eef8c7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5bcf3ae9299ada346b952151d94179a4430d8aef05dc7b8721430261eef8c7f","first_computed_at":"2026-07-05T09:41:09.501882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:41:09.501882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qy9BzDn7V8m1FjVjZbHScTK8ok+i8tLz7RqX7dWMcFNJrWB+vcZ1bR73YD0ZhrkvCDthPklz9+RktPno3SgnAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:41:09.502299Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.17961","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b99a7020570996745aa9fdb7c2124465d6be15f776a86c24a78c13430e8f3d0f","sha256:270419ce080f6fc716208b197a1f30715ae09c51abb74c292495d2756cf084cb"],"state_sha256":"bedb56da1a02b2a1a6a67b37d98d190359c414ee5ae4f4b0befe8257d887f7a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iPQjJyep73cHvX2oU9Q9EuDmmcshcoyUgU3qdVcwhbPNzSRt4WG38nUWQWP8DKzNsk9Q5Dkje8DGBiqfENvLCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T02:50:32.396450Z","bundle_sha256":"615a4bf1828a6eba222f1b6ce777c05be78c048f2ad700bc2363c02875bba43c"}}