{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:POGTQMPQAGRG2B3HNKKIOFKISH","short_pith_number":"pith:POGTQMPQ","canonical_record":{"source":{"id":"2509.00826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-08-31T12:52:49Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"18ef000d52b7d722900d6809b773fe80f26943bd53a72e0a4d71e0209d3c6e56","abstract_canon_sha256":"06465c72b8bfec341d7d9a2218730cbd7e5ed7b38102560500bbee2b12c5a0a9"},"schema_version":"1.0"},"canonical_sha256":"7b8d3831f001a26d07676a9487154891ed0eb574836978a07837c413cc4610f2","source":{"kind":"arxiv","id":"2509.00826","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.00826","created_at":"2026-07-05T12:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"2509.00826v1","created_at":"2026-07-05T12:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.00826","created_at":"2026-07-05T12:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"POGTQMPQAGRG","created_at":"2026-07-05T12:02:23Z"},{"alias_kind":"pith_short_16","alias_value":"POGTQMPQAGRG2B3H","created_at":"2026-07-05T12:02:23Z"},{"alias_kind":"pith_short_8","alias_value":"POGTQMPQ","created_at":"2026-07-05T12:02:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:POGTQMPQAGRG2B3HNKKIOFKISH","target":"record","payload":{"canonical_record":{"source":{"id":"2509.00826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-08-31T12:52:49Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"18ef000d52b7d722900d6809b773fe80f26943bd53a72e0a4d71e0209d3c6e56","abstract_canon_sha256":"06465c72b8bfec341d7d9a2218730cbd7e5ed7b38102560500bbee2b12c5a0a9"},"schema_version":"1.0"},"canonical_sha256":"7b8d3831f001a26d07676a9487154891ed0eb574836978a07837c413cc4610f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:23.319033Z","signature_b64":"A7mc/m8xBKfhAQsS3b80780lJzjZRhVYfoXSoWZ0200pHTjN3W7HcbOZcKBLfkoHHMZaP9uu6tAkDUToZ7rZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b8d3831f001a26d07676a9487154891ed0eb574836978a07837c413cc4610f2","last_reissued_at":"2026-07-05T12:02:23.318582Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:23.318582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.00826","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-05T12:02:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tXFG5N8JK/4suO7MMW2CJBtBkuXvxAZprSLc+LEQvsvEW9POT9Gis68LojckY4bVBUwmo4EO/eX84FRuiHQxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:18:45.937591Z"},"content_sha256":"236cdbd5773cc9c684cc6211812854b1d494e2672ce48c69e0de4e60fabc64a1","schema_version":"1.0","event_id":"sha256:236cdbd5773cc9c684cc6211812854b1d494e2672ce48c69e0de4e60fabc64a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:POGTQMPQAGRG2B3HNKKIOFKISH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Difference Maximization: Generating Adversarial Examples via Multi-Stage Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Baolin Li, Jichao Xie, Peng Yi, Tao Hu, Weitao Han, Xinlei Liu","submitted_at":"2025-08-31T12:52:49Z","abstract_excerpt":"Efficient adversarial attack methods are critical for assessing the robustness of computer vision models. In this paper, we reconstruct the optimization objective for generating adversarial examples as \"maximizing the difference between the non-true labels' probability upper bound and the true label's probability,\" and propose a gradient-based attack method termed Sequential Difference Maximization (SDM). SDM establishes a three-layer optimization framework of \"cycle-stage-step.\" The processes between cycles and between iterative steps are respectively identical, while optimization stages diff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.00826","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/2509.00826/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-05T12:02:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e266LUbl+50hsyH/PWtVVqIwCWnoKpr8hCIxgGTWvMS6jW0jRGgeH+L6kinSms2XGKfO7TItrfxmnQTA1RdJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:18:45.938004Z"},"content_sha256":"94a08c79126f232c7874eda0cfe21f076c734fdfb8f06340d1d5b6e91afd7498","schema_version":"1.0","event_id":"sha256:94a08c79126f232c7874eda0cfe21f076c734fdfb8f06340d1d5b6e91afd7498"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/POGTQMPQAGRG2B3HNKKIOFKISH/bundle.json","state_url":"https://pith.science/pith/POGTQMPQAGRG2B3HNKKIOFKISH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/POGTQMPQAGRG2B3HNKKIOFKISH/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-07-06T17:18:45Z","links":{"resolver":"https://pith.science/pith/POGTQMPQAGRG2B3HNKKIOFKISH","bundle":"https://pith.science/pith/POGTQMPQAGRG2B3HNKKIOFKISH/bundle.json","state":"https://pith.science/pith/POGTQMPQAGRG2B3HNKKIOFKISH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/POGTQMPQAGRG2B3HNKKIOFKISH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:POGTQMPQAGRG2B3HNKKIOFKISH","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":"06465c72b8bfec341d7d9a2218730cbd7e5ed7b38102560500bbee2b12c5a0a9","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-08-31T12:52:49Z","title_canon_sha256":"18ef000d52b7d722900d6809b773fe80f26943bd53a72e0a4d71e0209d3c6e56"},"schema_version":"1.0","source":{"id":"2509.00826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.00826","created_at":"2026-07-05T12:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"2509.00826v1","created_at":"2026-07-05T12:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.00826","created_at":"2026-07-05T12:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"POGTQMPQAGRG","created_at":"2026-07-05T12:02:23Z"},{"alias_kind":"pith_short_16","alias_value":"POGTQMPQAGRG2B3H","created_at":"2026-07-05T12:02:23Z"},{"alias_kind":"pith_short_8","alias_value":"POGTQMPQ","created_at":"2026-07-05T12:02:23Z"}],"graph_snapshots":[{"event_id":"sha256:94a08c79126f232c7874eda0cfe21f076c734fdfb8f06340d1d5b6e91afd7498","target":"graph","created_at":"2026-07-05T12:02:23Z","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/2509.00826/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Efficient adversarial attack methods are critical for assessing the robustness of computer vision models. In this paper, we reconstruct the optimization objective for generating adversarial examples as \"maximizing the difference between the non-true labels' probability upper bound and the true label's probability,\" and propose a gradient-based attack method termed Sequential Difference Maximization (SDM). SDM establishes a three-layer optimization framework of \"cycle-stage-step.\" The processes between cycles and between iterative steps are respectively identical, while optimization stages diff","authors_text":"Baolin Li, Jichao Xie, Peng Yi, Tao Hu, Weitao Han, Xinlei Liu","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-08-31T12:52:49Z","title":"Sequential Difference Maximization: Generating Adversarial Examples via Multi-Stage Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.00826","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:236cdbd5773cc9c684cc6211812854b1d494e2672ce48c69e0de4e60fabc64a1","target":"record","created_at":"2026-07-05T12:02:23Z","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":"06465c72b8bfec341d7d9a2218730cbd7e5ed7b38102560500bbee2b12c5a0a9","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-08-31T12:52:49Z","title_canon_sha256":"18ef000d52b7d722900d6809b773fe80f26943bd53a72e0a4d71e0209d3c6e56"},"schema_version":"1.0","source":{"id":"2509.00826","kind":"arxiv","version":1}},"canonical_sha256":"7b8d3831f001a26d07676a9487154891ed0eb574836978a07837c413cc4610f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b8d3831f001a26d07676a9487154891ed0eb574836978a07837c413cc4610f2","first_computed_at":"2026-07-05T12:02:23.318582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:02:23.318582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A7mc/m8xBKfhAQsS3b80780lJzjZRhVYfoXSoWZ0200pHTjN3W7HcbOZcKBLfkoHHMZaP9uu6tAkDUToZ7rZBg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:02:23.319033Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.00826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:236cdbd5773cc9c684cc6211812854b1d494e2672ce48c69e0de4e60fabc64a1","sha256:94a08c79126f232c7874eda0cfe21f076c734fdfb8f06340d1d5b6e91afd7498"],"state_sha256":"277d1637984d7448431f5f20a599c836260b1d2ca3817807de025663da97aacf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8N4aF4PUv47pPzMmP0ZyVgwmQ9xbr8AHlB4aHs28F0f6Coo+yR93hwhMCtz5Bjtu1xyQJzxmAZV1yHJz+ro9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T17:18:45.939972Z","bundle_sha256":"dad7531c0293e418b2d4c7e917f820d828080662b12d4b2f2eee721bb8064a17"}}