{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:46SKHYJJTCLRUWWKNPGFT7454T","short_pith_number":"pith:46SKHYJJ","canonical_record":{"source":{"id":"1806.00411","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-01T15:56:50Z","cross_cats_sorted":[],"title_canon_sha256":"c43e4e0dcea4dda0116a0d910f9748a86f2f3893c4bf2e7b159684c0da936f17","abstract_canon_sha256":"45b408f1617748d362e14be1388555b4e2401467a90f57cf2c68c5a41e447859"},"schema_version":"1.0"},"canonical_sha256":"e7a4a3e12998971a5aca6bcc59ff9de4e3dcbc59d360315b5873e63eabeeeeec","source":{"kind":"arxiv","id":"1806.00411","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00411","created_at":"2026-07-05T00:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00411v2","created_at":"2026-07-05T00:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00411","created_at":"2026-07-05T00:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"46SKHYJJTCLR","created_at":"2026-07-05T00:02:23Z"},{"alias_kind":"pith_short_16","alias_value":"46SKHYJJTCLRUWWK","created_at":"2026-07-05T00:02:23Z"},{"alias_kind":"pith_short_8","alias_value":"46SKHYJJ","created_at":"2026-07-05T00:02:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:46SKHYJJTCLRUWWKNPGFT7454T","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00411","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-01T15:56:50Z","cross_cats_sorted":[],"title_canon_sha256":"c43e4e0dcea4dda0116a0d910f9748a86f2f3893c4bf2e7b159684c0da936f17","abstract_canon_sha256":"45b408f1617748d362e14be1388555b4e2401467a90f57cf2c68c5a41e447859"},"schema_version":"1.0"},"canonical_sha256":"e7a4a3e12998971a5aca6bcc59ff9de4e3dcbc59d360315b5873e63eabeeeeec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:23.416847Z","signature_b64":"hCbwStsHFYDzp4nu7diMJ6SVQA9ZkHHxdy9K1uPsrStxibOrSLqbUy5cCI6EqctI4pwczoltW6e028L4viPuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7a4a3e12998971a5aca6bcc59ff9de4e3dcbc59d360315b5873e63eabeeeeec","last_reissued_at":"2026-07-05T00:02:23.416495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:23.416495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00411","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-07-05T00: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":"fU4SL76n7Bbsugvw/1ChDmUEQ4LhjsxHZbt8fxyC7XWUmfaLD/ZdK5E7KIkBaDHfCWTKlcsPin+8mAj4JxXzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T16:32:42.470081Z"},"content_sha256":"56d4594760ab152c01fbfba5e80e2af1d5da4fd66176e4fcfd08771384ed05ac","schema_version":"1.0","event_id":"sha256:56d4594760ab152c01fbfba5e80e2af1d5da4fd66176e4fcfd08771384ed05ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:46SKHYJJTCLRUWWKNPGFT7454T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adapted and Oversegmenting Graphs: Application to Geometric Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alberto Gomez, Bishesh Khanal, Julia A. Schnabel, Nicolas Toussaint, Veronika A. Zimmer","submitted_at":"2018-06-01T15:56:50Z","abstract_excerpt":"We propose a novel iterative method to adapt a a graph to d-dimensional image data. The method drives the nodes of the graph towards image features. The adaptation process naturally lends itself to a measure of feature saliency which can then be used to retain meaningful nodes and edges in the graph. From the adapted graph, we also propose the computation of a dual graph, which inherits the saliency measure from the adapted graph, and whose edges run along image features, hence producing an oversegmenting graph. The proposed method is computationally efficient and fully parallelisable. We prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00411","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1806.00411/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-05T00: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":"xGieD1RCbKoam2In/h9P7l7zvuuBB365UGXfvibIU00ZrUJJIYiSuTA0TddnaaQgsYKo/Va7/gEtybb72yruDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T16:32:42.470586Z"},"content_sha256":"34b93fe0ed44680e5f567a14ec33656a7d4d0034750290f8276aaaf0638b12aa","schema_version":"1.0","event_id":"sha256:34b93fe0ed44680e5f567a14ec33656a7d4d0034750290f8276aaaf0638b12aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/46SKHYJJTCLRUWWKNPGFT7454T/bundle.json","state_url":"https://pith.science/pith/46SKHYJJTCLRUWWKNPGFT7454T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/46SKHYJJTCLRUWWKNPGFT7454T/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-20T16:32:42Z","links":{"resolver":"https://pith.science/pith/46SKHYJJTCLRUWWKNPGFT7454T","bundle":"https://pith.science/pith/46SKHYJJTCLRUWWKNPGFT7454T/bundle.json","state":"https://pith.science/pith/46SKHYJJTCLRUWWKNPGFT7454T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/46SKHYJJTCLRUWWKNPGFT7454T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:46SKHYJJTCLRUWWKNPGFT7454T","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":"45b408f1617748d362e14be1388555b4e2401467a90f57cf2c68c5a41e447859","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-01T15:56:50Z","title_canon_sha256":"c43e4e0dcea4dda0116a0d910f9748a86f2f3893c4bf2e7b159684c0da936f17"},"schema_version":"1.0","source":{"id":"1806.00411","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00411","created_at":"2026-07-05T00:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00411v2","created_at":"2026-07-05T00:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00411","created_at":"2026-07-05T00:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"46SKHYJJTCLR","created_at":"2026-07-05T00:02:23Z"},{"alias_kind":"pith_short_16","alias_value":"46SKHYJJTCLRUWWK","created_at":"2026-07-05T00:02:23Z"},{"alias_kind":"pith_short_8","alias_value":"46SKHYJJ","created_at":"2026-07-05T00:02:23Z"}],"graph_snapshots":[{"event_id":"sha256:34b93fe0ed44680e5f567a14ec33656a7d4d0034750290f8276aaaf0638b12aa","target":"graph","created_at":"2026-07-05T00: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/1806.00411/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a novel iterative method to adapt a a graph to d-dimensional image data. The method drives the nodes of the graph towards image features. The adaptation process naturally lends itself to a measure of feature saliency which can then be used to retain meaningful nodes and edges in the graph. From the adapted graph, we also propose the computation of a dual graph, which inherits the saliency measure from the adapted graph, and whose edges run along image features, hence producing an oversegmenting graph. The proposed method is computationally efficient and fully parallelisable. We prop","authors_text":"Alberto Gomez, Bishesh Khanal, Julia A. Schnabel, Nicolas Toussaint, Veronika A. Zimmer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-01T15:56:50Z","title":"Adapted and Oversegmenting Graphs: Application to Geometric Deep Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00411","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:56d4594760ab152c01fbfba5e80e2af1d5da4fd66176e4fcfd08771384ed05ac","target":"record","created_at":"2026-07-05T00: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":"45b408f1617748d362e14be1388555b4e2401467a90f57cf2c68c5a41e447859","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-01T15:56:50Z","title_canon_sha256":"c43e4e0dcea4dda0116a0d910f9748a86f2f3893c4bf2e7b159684c0da936f17"},"schema_version":"1.0","source":{"id":"1806.00411","kind":"arxiv","version":2}},"canonical_sha256":"e7a4a3e12998971a5aca6bcc59ff9de4e3dcbc59d360315b5873e63eabeeeeec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7a4a3e12998971a5aca6bcc59ff9de4e3dcbc59d360315b5873e63eabeeeeec","first_computed_at":"2026-07-05T00:02:23.416495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:02:23.416495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hCbwStsHFYDzp4nu7diMJ6SVQA9ZkHHxdy9K1uPsrStxibOrSLqbUy5cCI6EqctI4pwczoltW6e028L4viPuBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:02:23.416847Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00411","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56d4594760ab152c01fbfba5e80e2af1d5da4fd66176e4fcfd08771384ed05ac","sha256:34b93fe0ed44680e5f567a14ec33656a7d4d0034750290f8276aaaf0638b12aa"],"state_sha256":"b240a981db154a82dbb5c352f8adba1e39144231ab4147a84c5a82dcecca88c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3qdUXbr3AfZUyKlSoC8LtVzXdW9jh9T6ZPnhrwSyQzk3nHXVLyc8QWiywT/T8jihPla+vvI1Vds3ChyjWeWxAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T16:32:42.485041Z","bundle_sha256":"2940f463aaf96ee56bc4f50c7049011786bd036f997fddae04ae05a4cb5e68fa"}}