{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5UECO7Y6HOP5C2OWMX4C5CL5OV","short_pith_number":"pith:5UECO7Y6","canonical_record":{"source":{"id":"2607.27465","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2026-07-29T21:08:48Z","cross_cats_sorted":[],"title_canon_sha256":"943013023baa2eef5e1bce6ce5c4656e46de0155d1adb4c280a96e88e8b68885","abstract_canon_sha256":"4ec623d4433a3b3a4f7bc74861a620064bce7fc6895f3b7bcd365701bd342715"},"schema_version":"1.0"},"canonical_sha256":"ed08277f1e3b9fd169d665f82e897d757d08903d461b0adc2e08e6ff14bb32ad","source":{"kind":"arxiv","id":"2607.27465","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27465","created_at":"2026-07-31T01:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27465v1","created_at":"2026-07-31T01:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27465","created_at":"2026-07-31T01:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"5UECO7Y6HOP5","created_at":"2026-07-31T01:23:27Z"},{"alias_kind":"pith_short_16","alias_value":"5UECO7Y6HOP5C2OW","created_at":"2026-07-31T01:23:27Z"},{"alias_kind":"pith_short_8","alias_value":"5UECO7Y6","created_at":"2026-07-31T01:23:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5UECO7Y6HOP5C2OWMX4C5CL5OV","target":"record","payload":{"canonical_record":{"source":{"id":"2607.27465","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2026-07-29T21:08:48Z","cross_cats_sorted":[],"title_canon_sha256":"943013023baa2eef5e1bce6ce5c4656e46de0155d1adb4c280a96e88e8b68885","abstract_canon_sha256":"4ec623d4433a3b3a4f7bc74861a620064bce7fc6895f3b7bcd365701bd342715"},"schema_version":"1.0"},"canonical_sha256":"ed08277f1e3b9fd169d665f82e897d757d08903d461b0adc2e08e6ff14bb32ad","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed08277f1e3b9fd169d665f82e897d757d08903d461b0adc2e08e6ff14bb32ad","last_reissued_at":"2026-07-31T01:23:27.526902Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:23:27.526902Z"},"source_kind":"arxiv","source_id":"2607.27465","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-31T01:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n10vygIxqrPE34I6EA+ustcFUzBhgEgN3TNFvNEsu2LVG/PIjF1hUIKw0WdRaEVWsMSEp1RT79n6DPSXTaLlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:15:31.353377Z"},"content_sha256":"e37c3e4fe0bcf5dddb4feaf97811540a1087c4a14c99ec297f755117ca1707c1","schema_version":"1.0","event_id":"sha256:e37c3e4fe0bcf5dddb4feaf97811540a1087c4a14c99ec297f755117ca1707c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5UECO7Y6HOP5C2OWMX4C5CL5OV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"IGME: Efficient Chained Method Ensemble for Transferable Semantic Segmentation Attacks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jing Zhang, Mengqi He","submitted_at":"2026-07-29T21:08:48Z","abstract_excerpt":"Semantic segmentation models are vulnerable to transferable adversarial perturbations, yet evaluating transfer attacks on dense prediction models can be computationally expensive. Existing ensemble attacks often rely on multiple surrogate models, increasing the computation cost, even harder for segmentation. This paper studies an efficient single-source alternative for transferable attacks on semantic segmentation. We formulate transferable attack composition as a chained computation over differentiable attack components, allowing the expensive source-model gradient computation to be shared. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27465","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/2607.27465/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-31T01:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TtENbvRWPzfVAR4r/RceKEnRMzPXl6JNtYIf2JvuzGwq5U6YMMqb3FCaq5W4uwop5qv7tro2RMtO8u/j3OchAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:15:31.353887Z"},"content_sha256":"3a2b1d257a62262a167a1211b08fdf09aa6e1f2fab7eb074868dede6e04815ea","schema_version":"1.0","event_id":"sha256:3a2b1d257a62262a167a1211b08fdf09aa6e1f2fab7eb074868dede6e04815ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UECO7Y6HOP5C2OWMX4C5CL5OV/bundle.json","state_url":"https://pith.science/pith/5UECO7Y6HOP5C2OWMX4C5CL5OV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UECO7Y6HOP5C2OWMX4C5CL5OV/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-05T09:15:31Z","links":{"resolver":"https://pith.science/pith/5UECO7Y6HOP5C2OWMX4C5CL5OV","bundle":"https://pith.science/pith/5UECO7Y6HOP5C2OWMX4C5CL5OV/bundle.json","state":"https://pith.science/pith/5UECO7Y6HOP5C2OWMX4C5CL5OV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UECO7Y6HOP5C2OWMX4C5CL5OV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5UECO7Y6HOP5C2OWMX4C5CL5OV","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":"4ec623d4433a3b3a4f7bc74861a620064bce7fc6895f3b7bcd365701bd342715","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2026-07-29T21:08:48Z","title_canon_sha256":"943013023baa2eef5e1bce6ce5c4656e46de0155d1adb4c280a96e88e8b68885"},"schema_version":"1.0","source":{"id":"2607.27465","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27465","created_at":"2026-07-31T01:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27465v1","created_at":"2026-07-31T01:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27465","created_at":"2026-07-31T01:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"5UECO7Y6HOP5","created_at":"2026-07-31T01:23:27Z"},{"alias_kind":"pith_short_16","alias_value":"5UECO7Y6HOP5C2OW","created_at":"2026-07-31T01:23:27Z"},{"alias_kind":"pith_short_8","alias_value":"5UECO7Y6","created_at":"2026-07-31T01:23:27Z"}],"graph_snapshots":[{"event_id":"sha256:3a2b1d257a62262a167a1211b08fdf09aa6e1f2fab7eb074868dede6e04815ea","target":"graph","created_at":"2026-07-31T01:23:27Z","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/2607.27465/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Semantic segmentation models are vulnerable to transferable adversarial perturbations, yet evaluating transfer attacks on dense prediction models can be computationally expensive. Existing ensemble attacks often rely on multiple surrogate models, increasing the computation cost, even harder for segmentation. This paper studies an efficient single-source alternative for transferable attacks on semantic segmentation. We formulate transferable attack composition as a chained computation over differentiable attack components, allowing the expensive source-model gradient computation to be shared. T","authors_text":"Jing Zhang, Mengqi He","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2026-07-29T21:08:48Z","title":"IGME: Efficient Chained Method Ensemble for Transferable Semantic Segmentation Attacks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27465","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:e37c3e4fe0bcf5dddb4feaf97811540a1087c4a14c99ec297f755117ca1707c1","target":"record","created_at":"2026-07-31T01:23:27Z","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":"4ec623d4433a3b3a4f7bc74861a620064bce7fc6895f3b7bcd365701bd342715","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2026-07-29T21:08:48Z","title_canon_sha256":"943013023baa2eef5e1bce6ce5c4656e46de0155d1adb4c280a96e88e8b68885"},"schema_version":"1.0","source":{"id":"2607.27465","kind":"arxiv","version":1}},"canonical_sha256":"ed08277f1e3b9fd169d665f82e897d757d08903d461b0adc2e08e6ff14bb32ad","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed08277f1e3b9fd169d665f82e897d757d08903d461b0adc2e08e6ff14bb32ad","first_computed_at":"2026-07-31T01:23:27.526902Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:23:27.526902Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27465","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e37c3e4fe0bcf5dddb4feaf97811540a1087c4a14c99ec297f755117ca1707c1","sha256:3a2b1d257a62262a167a1211b08fdf09aa6e1f2fab7eb074868dede6e04815ea"],"state_sha256":"620ac5334d3637aecbbffc5e85f55b5c5b2e4148a912bcb77c1163f2cec8c3f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tiA3ph6dCAkPGhfyWws2ClcWjV7EYz8QpnKVk/tbkW6SDvEPRD9Ua4uOAXTo1o1R/A8fR8ahOiigfMSveJivDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T09:15:31.357174Z","bundle_sha256":"0ffc2f43ec23b7ce60365ed94d74a0fdd18745799a99fb52581fa60122625ef0"}}