{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PX56HRN7I57JP4JMRENJLVKSLD","short_pith_number":"pith:PX56HRN7","canonical_record":{"source":{"id":"1704.08847","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-28T08:43:55Z","cross_cats_sorted":["cs.AI","cs.CR","cs.LG"],"title_canon_sha256":"bb6e88339f60eda5c18c945af2c681cb8764d42cc54dbd183b0a8a4cba735187","abstract_canon_sha256":"3ec3a0d5d83fe2e0a29c85f950e3efd53a8aa83e471ddf382c8fc0748c445498"},"schema_version":"1.0"},"canonical_sha256":"7dfbe3c5bf477e97f12c891a95d55258d5cf85eadaea75f6428bdbdd2813364a","source":{"kind":"arxiv","id":"1704.08847","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08847","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08847v2","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08847","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"PX56HRN7I57J","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PX56HRN7I57JP4JM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PX56HRN7","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PX56HRN7I57JP4JMRENJLVKSLD","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08847","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-28T08:43:55Z","cross_cats_sorted":["cs.AI","cs.CR","cs.LG"],"title_canon_sha256":"bb6e88339f60eda5c18c945af2c681cb8764d42cc54dbd183b0a8a4cba735187","abstract_canon_sha256":"3ec3a0d5d83fe2e0a29c85f950e3efd53a8aa83e471ddf382c8fc0748c445498"},"schema_version":"1.0"},"canonical_sha256":"7dfbe3c5bf477e97f12c891a95d55258d5cf85eadaea75f6428bdbdd2813364a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:35.706586Z","signature_b64":"V1Z5299fAYmstodmd2Mk4z9nN6VoPj3nRk1TDzGNM3crww8Yi3NCTr1gEj+Fvuqhq/uuj2wdkbHfNedpUjfJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dfbe3c5bf477e97f12c891a95d55258d5cf85eadaea75f6428bdbdd2813364a","last_reissued_at":"2026-05-18T00:38:35.706160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:35.706160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08847","source_version":2,"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:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lvjX1dB724b85jfODBo4Nu5JdIZTSanM93sK+GW7c/+773JZ5ItC5czdgGDdjfDfI8dQOeIZpvll5dANGWd8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:17:46.922237Z"},"content_sha256":"c8acb65c537ab8c69faf17058888eda38813aa0558d9ccf08a74a0b456fcc0e1","schema_version":"1.0","event_id":"sha256:c8acb65c537ab8c69faf17058888eda38813aa0558d9ccf08a74a0b456fcc0e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PX56HRN7I57JP4JMRENJLVKSLD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parseval Networks: Improving Robustness to Adversarial Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Edouard Grave, Moustapha Cisse, Nicolas Usunier, Piotr Bojanowski, Yann Dauphin","submitted_at":"2017-04-28T08:43:55Z","abstract_excerpt":"We introduce Parseval networks, a form of deep neural networks in which the Lipschitz constant of linear, convolutional and aggregation layers is constrained to be smaller than 1. Parseval networks are empirically and theoretically motivated by an analysis of the robustness of the predictions made by deep neural networks when their input is subject to an adversarial perturbation. The most important feature of Parseval networks is to maintain weight matrices of linear and convolutional layers to be (approximately) Parseval tight frames, which are extensions of orthogonal matrices to non-square "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08847","kind":"arxiv","version":2},"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:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qQ+uDFK33sb/kvN7gDYFecBIw24SXWS0ivzkszrIwPu0EdIT47cc0/XBtXIcSiuDQyB8oPZlIalDFHV3r/MEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:17:46.922876Z"},"content_sha256":"33fee5c63c44c1cdbb710bdee06199d1b6b70c4c38822257e0e4e60c05e5b00c","schema_version":"1.0","event_id":"sha256:33fee5c63c44c1cdbb710bdee06199d1b6b70c4c38822257e0e4e60c05e5b00c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PX56HRN7I57JP4JMRENJLVKSLD/bundle.json","state_url":"https://pith.science/pith/PX56HRN7I57JP4JMRENJLVKSLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PX56HRN7I57JP4JMRENJLVKSLD/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-30T16:17:46Z","links":{"resolver":"https://pith.science/pith/PX56HRN7I57JP4JMRENJLVKSLD","bundle":"https://pith.science/pith/PX56HRN7I57JP4JMRENJLVKSLD/bundle.json","state":"https://pith.science/pith/PX56HRN7I57JP4JMRENJLVKSLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PX56HRN7I57JP4JMRENJLVKSLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PX56HRN7I57JP4JMRENJLVKSLD","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":"3ec3a0d5d83fe2e0a29c85f950e3efd53a8aa83e471ddf382c8fc0748c445498","cross_cats_sorted":["cs.AI","cs.CR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-28T08:43:55Z","title_canon_sha256":"bb6e88339f60eda5c18c945af2c681cb8764d42cc54dbd183b0a8a4cba735187"},"schema_version":"1.0","source":{"id":"1704.08847","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08847","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08847v2","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08847","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"PX56HRN7I57J","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PX56HRN7I57JP4JM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PX56HRN7","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:33fee5c63c44c1cdbb710bdee06199d1b6b70c4c38822257e0e4e60c05e5b00c","target":"graph","created_at":"2026-05-18T00:38:35Z","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":"We introduce Parseval networks, a form of deep neural networks in which the Lipschitz constant of linear, convolutional and aggregation layers is constrained to be smaller than 1. Parseval networks are empirically and theoretically motivated by an analysis of the robustness of the predictions made by deep neural networks when their input is subject to an adversarial perturbation. The most important feature of Parseval networks is to maintain weight matrices of linear and convolutional layers to be (approximately) Parseval tight frames, which are extensions of orthogonal matrices to non-square ","authors_text":"Edouard Grave, Moustapha Cisse, Nicolas Usunier, Piotr Bojanowski, Yann Dauphin","cross_cats":["cs.AI","cs.CR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-28T08:43:55Z","title":"Parseval Networks: Improving Robustness to Adversarial Examples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08847","kind":"arxiv","version":2},"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:c8acb65c537ab8c69faf17058888eda38813aa0558d9ccf08a74a0b456fcc0e1","target":"record","created_at":"2026-05-18T00:38:35Z","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":"3ec3a0d5d83fe2e0a29c85f950e3efd53a8aa83e471ddf382c8fc0748c445498","cross_cats_sorted":["cs.AI","cs.CR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-28T08:43:55Z","title_canon_sha256":"bb6e88339f60eda5c18c945af2c681cb8764d42cc54dbd183b0a8a4cba735187"},"schema_version":"1.0","source":{"id":"1704.08847","kind":"arxiv","version":2}},"canonical_sha256":"7dfbe3c5bf477e97f12c891a95d55258d5cf85eadaea75f6428bdbdd2813364a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7dfbe3c5bf477e97f12c891a95d55258d5cf85eadaea75f6428bdbdd2813364a","first_computed_at":"2026-05-18T00:38:35.706160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:35.706160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V1Z5299fAYmstodmd2Mk4z9nN6VoPj3nRk1TDzGNM3crww8Yi3NCTr1gEj+Fvuqhq/uuj2wdkbHfNedpUjfJBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:35.706586Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08847","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8acb65c537ab8c69faf17058888eda38813aa0558d9ccf08a74a0b456fcc0e1","sha256:33fee5c63c44c1cdbb710bdee06199d1b6b70c4c38822257e0e4e60c05e5b00c"],"state_sha256":"caadc79a283f16d902fc229bd93d3d8483b6791df1eba6df2c5b55d121653ca2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0JDZgG2yEQUkz0ohjxjZSi3Uh7uN8Fixk7rrbU8Eu+GOiH7+bh1NaSvFoMbId43frPPsLPmbUS5jo9bbnrx1AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:17:46.925965Z","bundle_sha256":"827f7280fdc10af43aac94ab6b5b778bcfcc047c5dbc958fcf91300288f21fd2"}}