{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WIGWEJNKKBWIXGR72KF7NRTML5","short_pith_number":"pith:WIGWEJNK","canonical_record":{"source":{"id":"1707.05373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-17T19:11:08Z","cross_cats_sorted":["cs.AI","cs.CR","cs.CV","cs.LG"],"title_canon_sha256":"f3a47ed27c651d35e714472520106c29e1e3ad9446792531f860acb00407043f","abstract_canon_sha256":"ec8942b8e877cc23487a31d16b460d89148521a1f0b67d55840010398dbcccf9"},"schema_version":"1.0"},"canonical_sha256":"b20d6225aa506c8b9a3fd28bf6c66c5f6bdc3edd8b71442abb612b63cd167501","source":{"kind":"arxiv","id":"1707.05373","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05373","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05373v1","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05373","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"WIGWEJNKKBWI","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WIGWEJNKKBWIXGR7","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WIGWEJNK","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WIGWEJNKKBWIXGR72KF7NRTML5","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-17T19:11:08Z","cross_cats_sorted":["cs.AI","cs.CR","cs.CV","cs.LG"],"title_canon_sha256":"f3a47ed27c651d35e714472520106c29e1e3ad9446792531f860acb00407043f","abstract_canon_sha256":"ec8942b8e877cc23487a31d16b460d89148521a1f0b67d55840010398dbcccf9"},"schema_version":"1.0"},"canonical_sha256":"b20d6225aa506c8b9a3fd28bf6c66c5f6bdc3edd8b71442abb612b63cd167501","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:02.540957Z","signature_b64":"IsaMezxhmHA1GrSch9Svjx+B5xf1myp7kYH5fmvRYO+rsJ2D/73062zeICC/+LutittYdqJy5sKuhC3JW1k4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b20d6225aa506c8b9a3fd28bf6c66c5f6bdc3edd8b71442abb612b63cd167501","last_reissued_at":"2026-05-18T00:40:02.540533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:02.540533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05373","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-18T00:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LLtY54FN4JbkaDm4FTZLNhQ+Q2Moqx3y86TOLM2sKcVhq2ZO9DH5YwIzIONPEPJkk40KPsFcx5bDSoy6ZouBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:33:43.130377Z"},"content_sha256":"518cf30d50e6f28ce7a98a93356d0b106123a98a8765d47af87d93c91e69db3f","schema_version":"1.0","event_id":"sha256:518cf30d50e6f28ce7a98a93356d0b106123a98a8765d47af87d93c91e69db3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WIGWEJNKKBWIXGR72KF7NRTML5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Houdini: Fooling Deep Structured Prediction Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR","cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Joseph Keshet, Moustapha Cisse, Natalia Neverova, Yossi Adi","submitted_at":"2017-07-17T19:11:08Z","abstract_excerpt":"Generating adversarial examples is a critical step for evaluating and improving the robustness of learning machines. So far, most existing methods only work for classification and are not designed to alter the true performance measure of the problem at hand. We introduce a novel flexible approach named Houdini for generating adversarial examples specifically tailored for the final performance measure of the task considered, be it combinatorial and non-decomposable. We successfully apply Houdini to a range of applications such as speech recognition, pose estimation and semantic segmentation. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05373","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-18T00:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45K1CElbq+XIDI/ZfQIu31+kXE01hncZ59bNPhCEluEwpWG21/LYLh21lymEn6a8gZh5PyV9aiBuzVXbw64NDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:33:43.130919Z"},"content_sha256":"5197b88d6074aa80435119f073aba09b04ae58e763a364027e03302e3a226278","schema_version":"1.0","event_id":"sha256:5197b88d6074aa80435119f073aba09b04ae58e763a364027e03302e3a226278"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIGWEJNKKBWIXGR72KF7NRTML5/bundle.json","state_url":"https://pith.science/pith/WIGWEJNKKBWIXGR72KF7NRTML5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIGWEJNKKBWIXGR72KF7NRTML5/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-26T03:33:43Z","links":{"resolver":"https://pith.science/pith/WIGWEJNKKBWIXGR72KF7NRTML5","bundle":"https://pith.science/pith/WIGWEJNKKBWIXGR72KF7NRTML5/bundle.json","state":"https://pith.science/pith/WIGWEJNKKBWIXGR72KF7NRTML5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIGWEJNKKBWIXGR72KF7NRTML5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WIGWEJNKKBWIXGR72KF7NRTML5","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":"ec8942b8e877cc23487a31d16b460d89148521a1f0b67d55840010398dbcccf9","cross_cats_sorted":["cs.AI","cs.CR","cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-17T19:11:08Z","title_canon_sha256":"f3a47ed27c651d35e714472520106c29e1e3ad9446792531f860acb00407043f"},"schema_version":"1.0","source":{"id":"1707.05373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05373","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05373v1","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05373","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"WIGWEJNKKBWI","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WIGWEJNKKBWIXGR7","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WIGWEJNK","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:5197b88d6074aa80435119f073aba09b04ae58e763a364027e03302e3a226278","target":"graph","created_at":"2026-05-18T00:40:02Z","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":"Generating adversarial examples is a critical step for evaluating and improving the robustness of learning machines. So far, most existing methods only work for classification and are not designed to alter the true performance measure of the problem at hand. We introduce a novel flexible approach named Houdini for generating adversarial examples specifically tailored for the final performance measure of the task considered, be it combinatorial and non-decomposable. We successfully apply Houdini to a range of applications such as speech recognition, pose estimation and semantic segmentation. In","authors_text":"Joseph Keshet, Moustapha Cisse, Natalia Neverova, Yossi Adi","cross_cats":["cs.AI","cs.CR","cs.CV","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-17T19:11:08Z","title":"Houdini: Fooling Deep Structured Prediction Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05373","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:518cf30d50e6f28ce7a98a93356d0b106123a98a8765d47af87d93c91e69db3f","target":"record","created_at":"2026-05-18T00:40:02Z","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":"ec8942b8e877cc23487a31d16b460d89148521a1f0b67d55840010398dbcccf9","cross_cats_sorted":["cs.AI","cs.CR","cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-17T19:11:08Z","title_canon_sha256":"f3a47ed27c651d35e714472520106c29e1e3ad9446792531f860acb00407043f"},"schema_version":"1.0","source":{"id":"1707.05373","kind":"arxiv","version":1}},"canonical_sha256":"b20d6225aa506c8b9a3fd28bf6c66c5f6bdc3edd8b71442abb612b63cd167501","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b20d6225aa506c8b9a3fd28bf6c66c5f6bdc3edd8b71442abb612b63cd167501","first_computed_at":"2026-05-18T00:40:02.540533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:02.540533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IsaMezxhmHA1GrSch9Svjx+B5xf1myp7kYH5fmvRYO+rsJ2D/73062zeICC/+LutittYdqJy5sKuhC3JW1k4Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:02.540957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:518cf30d50e6f28ce7a98a93356d0b106123a98a8765d47af87d93c91e69db3f","sha256:5197b88d6074aa80435119f073aba09b04ae58e763a364027e03302e3a226278"],"state_sha256":"07dd1221b0888f054f8ef449342e22d0920b0f79003b51ccfc2e8f851169e01e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+JEcvEIWdgwIpyvHmE6hRZn5um+KwbXe3RI8VhmMBptUU2S8R6EeiEWbpg4fTkTWoSbD44YMp8wQ/BlvQp8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:33:43.134385Z","bundle_sha256":"1dae6eac5cf4f70d026b8cb09fd5f54d9dd1e5358d1628faba5d9a412ac4199e"}}