{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ZZKBYBJUBD3GE3XJJUUZURXPBR","short_pith_number":"pith:ZZKBYBJU","canonical_record":{"source":{"id":"2506.16862","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-20T09:26:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f2c43bd0849612df2bc184efbedac2da7b94e61036f000220aef211dd572b784","abstract_canon_sha256":"345665e97b67a09de856f48cf3f9304f199e994e52072043464f7d36b0bfc23e"},"schema_version":"1.0"},"canonical_sha256":"ce541c053408f6626ee94d299a46ef0c6830c9586f34a29e3dcd08026de7d231","source":{"kind":"arxiv","id":"2506.16862","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.16862","created_at":"2026-07-05T11:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"2506.16862v1","created_at":"2026-07-05T11:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16862","created_at":"2026-07-05T11:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZZKBYBJUBD3G","created_at":"2026-07-05T11:24:44Z"},{"alias_kind":"pith_short_16","alias_value":"ZZKBYBJUBD3GE3XJ","created_at":"2026-07-05T11:24:44Z"},{"alias_kind":"pith_short_8","alias_value":"ZZKBYBJU","created_at":"2026-07-05T11:24:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ZZKBYBJUBD3GE3XJJUUZURXPBR","target":"record","payload":{"canonical_record":{"source":{"id":"2506.16862","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-20T09:26:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f2c43bd0849612df2bc184efbedac2da7b94e61036f000220aef211dd572b784","abstract_canon_sha256":"345665e97b67a09de856f48cf3f9304f199e994e52072043464f7d36b0bfc23e"},"schema_version":"1.0"},"canonical_sha256":"ce541c053408f6626ee94d299a46ef0c6830c9586f34a29e3dcd08026de7d231","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:44.160411Z","signature_b64":"lcbHIIuYODbspy4B/YUM+vhRR0I/4lbNEq6WvyansiWCQjILXnvhSGBRwhKcPpJVrUSSqCJJcddmNRscaBDVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce541c053408f6626ee94d299a46ef0c6830c9586f34a29e3dcd08026de7d231","last_reissued_at":"2026-07-05T11:24:44.159926Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:44.159926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.16862","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-05T11:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BS/HUaXjSUYWVkgbw0Fz0vCcLbiKbcgYucmHE3+scFckI6RT3vmQh70rH2aWhUcuZA/Z9qSKcqyaGVsr061uBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:42:02.291011Z"},"content_sha256":"6360fc915f44f10d81248f666042fa9f37951d60e0284e9e504ea13130274cf0","schema_version":"1.0","event_id":"sha256:6360fc915f44f10d81248f666042fa9f37951d60e0284e9e504ea13130274cf0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ZZKBYBJUBD3GE3XJJUUZURXPBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Depth of Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Qian Qi","submitted_at":"2025-06-20T09:26:01Z","abstract_excerpt":"Determining the optimal depth of a neural network is a fundamental yet challenging problem, typically resolved through resource-intensive experimentation. This paper introduces a formal theoretical framework to address this question by recasting the forward pass of a deep network, specifically a Residual Network (ResNet), as an optimal stopping problem. We model the layer-by-layer evolution of hidden representations as a sequential decision process where, at each layer, a choice is made between halting computation to make a prediction or continuing to a deeper layer for a potentially more refi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.16862","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/2506.16862/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-05T11:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ztm8CD4EpjruhZe9nha1alrSwfi1AhbfCFLcrMSLJCaQh5QaB71gTug9i5vqX3rz7Y3a1zhz1+hoAELfGsJJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:42:02.291548Z"},"content_sha256":"ae919d52b39e8ae4f7c1292c500394916dd57935c20061285cdad8ed3eaa0874","schema_version":"1.0","event_id":"sha256:ae919d52b39e8ae4f7c1292c500394916dd57935c20061285cdad8ed3eaa0874"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZKBYBJUBD3GE3XJJUUZURXPBR/bundle.json","state_url":"https://pith.science/pith/ZZKBYBJUBD3GE3XJJUUZURXPBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZKBYBJUBD3GE3XJJUUZURXPBR/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-21T17:42:02Z","links":{"resolver":"https://pith.science/pith/ZZKBYBJUBD3GE3XJJUUZURXPBR","bundle":"https://pith.science/pith/ZZKBYBJUBD3GE3XJJUUZURXPBR/bundle.json","state":"https://pith.science/pith/ZZKBYBJUBD3GE3XJJUUZURXPBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZKBYBJUBD3GE3XJJUUZURXPBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZZKBYBJUBD3GE3XJJUUZURXPBR","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":"345665e97b67a09de856f48cf3f9304f199e994e52072043464f7d36b0bfc23e","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-20T09:26:01Z","title_canon_sha256":"f2c43bd0849612df2bc184efbedac2da7b94e61036f000220aef211dd572b784"},"schema_version":"1.0","source":{"id":"2506.16862","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.16862","created_at":"2026-07-05T11:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"2506.16862v1","created_at":"2026-07-05T11:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16862","created_at":"2026-07-05T11:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZZKBYBJUBD3G","created_at":"2026-07-05T11:24:44Z"},{"alias_kind":"pith_short_16","alias_value":"ZZKBYBJUBD3GE3XJ","created_at":"2026-07-05T11:24:44Z"},{"alias_kind":"pith_short_8","alias_value":"ZZKBYBJU","created_at":"2026-07-05T11:24:44Z"}],"graph_snapshots":[{"event_id":"sha256:ae919d52b39e8ae4f7c1292c500394916dd57935c20061285cdad8ed3eaa0874","target":"graph","created_at":"2026-07-05T11:24:44Z","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/2506.16862/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Determining the optimal depth of a neural network is a fundamental yet challenging problem, typically resolved through resource-intensive experimentation. This paper introduces a formal theoretical framework to address this question by recasting the forward pass of a deep network, specifically a Residual Network (ResNet), as an optimal stopping problem. We model the layer-by-layer evolution of hidden representations as a sequential decision process where, at each layer, a choice is made between halting computation to make a prediction or continuing to a deeper layer for a potentially more refi","authors_text":"Qian Qi","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-20T09:26:01Z","title":"Optimal Depth of Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.16862","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:6360fc915f44f10d81248f666042fa9f37951d60e0284e9e504ea13130274cf0","target":"record","created_at":"2026-07-05T11:24:44Z","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":"345665e97b67a09de856f48cf3f9304f199e994e52072043464f7d36b0bfc23e","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-20T09:26:01Z","title_canon_sha256":"f2c43bd0849612df2bc184efbedac2da7b94e61036f000220aef211dd572b784"},"schema_version":"1.0","source":{"id":"2506.16862","kind":"arxiv","version":1}},"canonical_sha256":"ce541c053408f6626ee94d299a46ef0c6830c9586f34a29e3dcd08026de7d231","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce541c053408f6626ee94d299a46ef0c6830c9586f34a29e3dcd08026de7d231","first_computed_at":"2026-07-05T11:24:44.159926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:24:44.159926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lcbHIIuYODbspy4B/YUM+vhRR0I/4lbNEq6WvyansiWCQjILXnvhSGBRwhKcPpJVrUSSqCJJcddmNRscaBDVDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:24:44.160411Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.16862","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6360fc915f44f10d81248f666042fa9f37951d60e0284e9e504ea13130274cf0","sha256:ae919d52b39e8ae4f7c1292c500394916dd57935c20061285cdad8ed3eaa0874"],"state_sha256":"7b5125689167154bb16563001c3fa4bffc0185b828a150faf57913b86a70a7b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EKbm8IY6zaNvTRW3LhsP3iz7pd/1VCrEvmtplToIefXlH+8T7yj+a/byW9Vk0AaEa6eNpamHypTTpCJnzVh+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T17:42:02.295590Z","bundle_sha256":"c00f12e501ea1fb84ec1ae9ad858f4af58bb6af0042885a469b1febc01522476"}}