{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GRT4HD5EKSVJ36KTGHDFGJR2NH","short_pith_number":"pith:GRT4HD5E","canonical_record":{"source":{"id":"1803.05082","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-14T00:20:28Z","cross_cats_sorted":[],"title_canon_sha256":"2b79a4fb2d192c44c9b0e242a02a61b6454c59098cbfc07a7a8956ea2f8877c9","abstract_canon_sha256":"97ea6afd71e9b31fa3d07b9afb7b2890c4b759b25c9248e81b0863dd6977d1b0"},"schema_version":"1.0"},"canonical_sha256":"3467c38fa454aa9df95331c653263a69f39855014ff96f8fafffe0b7b910df73","source":{"kind":"arxiv","id":"1803.05082","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05082","created_at":"2026-05-18T00:20:21Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05082v2","created_at":"2026-05-18T00:20:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05082","created_at":"2026-05-18T00:20:21Z"},{"alias_kind":"pith_short_12","alias_value":"GRT4HD5EKSVJ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GRT4HD5EKSVJ36KT","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GRT4HD5E","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GRT4HD5EKSVJ36KTGHDFGJR2NH","target":"record","payload":{"canonical_record":{"source":{"id":"1803.05082","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-14T00:20:28Z","cross_cats_sorted":[],"title_canon_sha256":"2b79a4fb2d192c44c9b0e242a02a61b6454c59098cbfc07a7a8956ea2f8877c9","abstract_canon_sha256":"97ea6afd71e9b31fa3d07b9afb7b2890c4b759b25c9248e81b0863dd6977d1b0"},"schema_version":"1.0"},"canonical_sha256":"3467c38fa454aa9df95331c653263a69f39855014ff96f8fafffe0b7b910df73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:21.648878Z","signature_b64":"03iKRAQehUOAtTbzGbbf+wY1AxpdkCiUk+MOcjca5ubaLK+wWiFv0IZYVNkvxcb6c/eQqJLw5CuWI6Cwdou3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3467c38fa454aa9df95331c653263a69f39855014ff96f8fafffe0b7b910df73","last_reissued_at":"2026-05-18T00:20:21.648330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:21.648330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.05082","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:20:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MPXQtA2oIk7q4sG0jMPomSCSLF4oAhLlo81HAUfxa+DMNSzyGnGQbAOJ4k+7diary8n3rk9surLIdVzXHmikDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:05:59.108990Z"},"content_sha256":"c373c043bc2458a43ed03c1e2802fea444a922fce4e7fad9a440cf03e66de3f7","schema_version":"1.0","event_id":"sha256:c373c043bc2458a43ed03c1e2802fea444a922fce4e7fad9a440cf03e66de3f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GRT4HD5EKSVJ36KTGHDFGJR2NH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting Salient Object Detection: Simultaneous Detection, Ranking, and Subitizing of Multiple Salient Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Mahmoud Kalash, Md Amirul Islam, Neil D. B. Bruce","submitted_at":"2018-03-14T00:20:28Z","abstract_excerpt":"Salient object detection is a problem that has been considered in detail and many solutions proposed. In this paper, we argue that work to date has addressed a problem that is relatively ill-posed. Specifically, there is not universal agreement about what constitutes a salient object when multiple observers are queried. This implies that some objects are more likely to be judged salient than others, and implies a relative rank exists on salient objects. The solution presented in this paper solves this more general problem that considers relative rank, and we propose data and metrics suitable t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05082","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:20:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BWIoN71R7S5U23RYiB+FdzwQdGgdxzYtaSYe7U1RMk9S6RATS4/ZNZqdxtXuFdiZxjX3edT7VAheysnkOHVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:05:59.109580Z"},"content_sha256":"0664c6ae7708995d22b147bf94111186cc8122a9f4bf3bcb855aad6cb1dc2713","schema_version":"1.0","event_id":"sha256:0664c6ae7708995d22b147bf94111186cc8122a9f4bf3bcb855aad6cb1dc2713"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GRT4HD5EKSVJ36KTGHDFGJR2NH/bundle.json","state_url":"https://pith.science/pith/GRT4HD5EKSVJ36KTGHDFGJR2NH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GRT4HD5EKSVJ36KTGHDFGJR2NH/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-06-08T03:05:59Z","links":{"resolver":"https://pith.science/pith/GRT4HD5EKSVJ36KTGHDFGJR2NH","bundle":"https://pith.science/pith/GRT4HD5EKSVJ36KTGHDFGJR2NH/bundle.json","state":"https://pith.science/pith/GRT4HD5EKSVJ36KTGHDFGJR2NH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GRT4HD5EKSVJ36KTGHDFGJR2NH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GRT4HD5EKSVJ36KTGHDFGJR2NH","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":"97ea6afd71e9b31fa3d07b9afb7b2890c4b759b25c9248e81b0863dd6977d1b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-14T00:20:28Z","title_canon_sha256":"2b79a4fb2d192c44c9b0e242a02a61b6454c59098cbfc07a7a8956ea2f8877c9"},"schema_version":"1.0","source":{"id":"1803.05082","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05082","created_at":"2026-05-18T00:20:21Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05082v2","created_at":"2026-05-18T00:20:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05082","created_at":"2026-05-18T00:20:21Z"},{"alias_kind":"pith_short_12","alias_value":"GRT4HD5EKSVJ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GRT4HD5EKSVJ36KT","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GRT4HD5E","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:0664c6ae7708995d22b147bf94111186cc8122a9f4bf3bcb855aad6cb1dc2713","target":"graph","created_at":"2026-05-18T00:20:21Z","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":"Salient object detection is a problem that has been considered in detail and many solutions proposed. In this paper, we argue that work to date has addressed a problem that is relatively ill-posed. Specifically, there is not universal agreement about what constitutes a salient object when multiple observers are queried. This implies that some objects are more likely to be judged salient than others, and implies a relative rank exists on salient objects. The solution presented in this paper solves this more general problem that considers relative rank, and we propose data and metrics suitable t","authors_text":"Mahmoud Kalash, Md Amirul Islam, Neil D. B. Bruce","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-14T00:20:28Z","title":"Revisiting Salient Object Detection: Simultaneous Detection, Ranking, and Subitizing of Multiple Salient Objects"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05082","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:c373c043bc2458a43ed03c1e2802fea444a922fce4e7fad9a440cf03e66de3f7","target":"record","created_at":"2026-05-18T00:20:21Z","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":"97ea6afd71e9b31fa3d07b9afb7b2890c4b759b25c9248e81b0863dd6977d1b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-14T00:20:28Z","title_canon_sha256":"2b79a4fb2d192c44c9b0e242a02a61b6454c59098cbfc07a7a8956ea2f8877c9"},"schema_version":"1.0","source":{"id":"1803.05082","kind":"arxiv","version":2}},"canonical_sha256":"3467c38fa454aa9df95331c653263a69f39855014ff96f8fafffe0b7b910df73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3467c38fa454aa9df95331c653263a69f39855014ff96f8fafffe0b7b910df73","first_computed_at":"2026-05-18T00:20:21.648330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:21.648330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"03iKRAQehUOAtTbzGbbf+wY1AxpdkCiUk+MOcjca5ubaLK+wWiFv0IZYVNkvxcb6c/eQqJLw5CuWI6Cwdou3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:21.648878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05082","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c373c043bc2458a43ed03c1e2802fea444a922fce4e7fad9a440cf03e66de3f7","sha256:0664c6ae7708995d22b147bf94111186cc8122a9f4bf3bcb855aad6cb1dc2713"],"state_sha256":"37adcaa1db1ddbdb5c63adbeb55979015f0b5fb0f6c5339a8d39876ff1c25e73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qQxlgAfHr23Vzpq++FTrrjK2D3lBUUat2uGWoJCcjtl6oURXgvmmwUqgU9lh2QdnAq7Ej/1Q/1/j0nMZ1r/RAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:05:59.113032Z","bundle_sha256":"bacb82758e0bf454ca6e0494a134659b8587c9d612a564a9e06cdc567badceb7"}}