{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IH27XCX2BSHNGPCJAJLEGTCWWH","short_pith_number":"pith:IH27XCX2","schema_version":"1.0","canonical_sha256":"41f5fb8afa0c8ed33c490256434c56b1c1d2bdc162cf794e39cfd4ce91303530","source":{"kind":"arxiv","id":"1511.06747","version":4},"attestation_state":"computed","paper":{"title":"Data-Dependent Path Normalization in Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Behnam Neyshabur, Nathan Srebro, Ruslan Salakhutdinov, Ryota Tomioka","submitted_at":"2015-11-20T20:27:45Z","abstract_excerpt":"We propose a unified framework for neural net normalization, regularization and optimization, which includes Path-SGD and Batch-Normalization and interpolates between them across two different dimensions. Through this framework we investigate issue of invariance of the optimization, data dependence and the connection with natural gradients."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1511.06747","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-20T20:27:45Z","cross_cats_sorted":[],"title_canon_sha256":"07a787a2e7893c74b9be8a2186976158b059902d77f7750f2f6ed54a963d9ea7","abstract_canon_sha256":"7a78c368853372f3e737aaabeba4a49406f539c805fa457b973defa3f4efbf94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:32.983681Z","signature_b64":"YoFaBfBJgwda3UCvTcPhHbLE11uzEjpru9wDgNjWOjZFezQahNnEIJGZ1fzyLwhVWSarjMc0gByTMy4FjHXkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41f5fb8afa0c8ed33c490256434c56b1c1d2bdc162cf794e39cfd4ce91303530","last_reissued_at":"2026-05-18T01:22:32.983256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:32.983256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-Dependent Path Normalization in Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Behnam Neyshabur, Nathan Srebro, Ruslan Salakhutdinov, Ryota Tomioka","submitted_at":"2015-11-20T20:27:45Z","abstract_excerpt":"We propose a unified framework for neural net normalization, regularization and optimization, which includes Path-SGD and Batch-Normalization and interpolates between them across two different dimensions. Through this framework we investigate issue of invariance of the optimization, data dependence and the connection with natural gradients."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06747","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.06747","created_at":"2026-05-18T01:22:32.983329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06747v4","created_at":"2026-05-18T01:22:32.983329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06747","created_at":"2026-05-18T01:22:32.983329+00:00"},{"alias_kind":"pith_short_12","alias_value":"IH27XCX2BSHN","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IH27XCX2BSHNGPCJ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IH27XCX2","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IH27XCX2BSHNGPCJAJLEGTCWWH","json":"https://pith.science/pith/IH27XCX2BSHNGPCJAJLEGTCWWH.json","graph_json":"https://pith.science/api/pith-number/IH27XCX2BSHNGPCJAJLEGTCWWH/graph.json","events_json":"https://pith.science/api/pith-number/IH27XCX2BSHNGPCJAJLEGTCWWH/events.json","paper":"https://pith.science/paper/IH27XCX2"},"agent_actions":{"view_html":"https://pith.science/pith/IH27XCX2BSHNGPCJAJLEGTCWWH","download_json":"https://pith.science/pith/IH27XCX2BSHNGPCJAJLEGTCWWH.json","view_paper":"https://pith.science/paper/IH27XCX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06747&json=true","fetch_graph":"https://pith.science/api/pith-number/IH27XCX2BSHNGPCJAJLEGTCWWH/graph.json","fetch_events":"https://pith.science/api/pith-number/IH27XCX2BSHNGPCJAJLEGTCWWH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IH27XCX2BSHNGPCJAJLEGTCWWH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IH27XCX2BSHNGPCJAJLEGTCWWH/action/storage_attestation","attest_author":"https://pith.science/pith/IH27XCX2BSHNGPCJAJLEGTCWWH/action/author_attestation","sign_citation":"https://pith.science/pith/IH27XCX2BSHNGPCJAJLEGTCWWH/action/citation_signature","submit_replication":"https://pith.science/pith/IH27XCX2BSHNGPCJAJLEGTCWWH/action/replication_record"}},"created_at":"2026-05-18T01:22:32.983329+00:00","updated_at":"2026-05-18T01:22:32.983329+00:00"}