{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:M2VECYSODLKCC4DUMWEXRT3G4B","short_pith_number":"pith:M2VECYSO","canonical_record":{"source":{"id":"1712.00213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-01T07:15:28Z","cross_cats_sorted":[],"title_canon_sha256":"7427c60c9db0ba338789f7ab5304815bd8cb5af87561b3bc402228c3621daaed","abstract_canon_sha256":"7691d0823baaeef85d9ca427cf9b5f18ba53a25fd685120311c8f0769993f2d4"},"schema_version":"1.0"},"canonical_sha256":"66aa41624e1ad4217074658978cf66e0484b4db184cd06008312b0910eacffbe","source":{"kind":"arxiv","id":"1712.00213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00213","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00213v1","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00213","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"pith_short_12","alias_value":"M2VECYSODLKC","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M2VECYSODLKCC4DU","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M2VECYSO","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:M2VECYSODLKCC4DUMWEXRT3G4B","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-01T07:15:28Z","cross_cats_sorted":[],"title_canon_sha256":"7427c60c9db0ba338789f7ab5304815bd8cb5af87561b3bc402228c3621daaed","abstract_canon_sha256":"7691d0823baaeef85d9ca427cf9b5f18ba53a25fd685120311c8f0769993f2d4"},"schema_version":"1.0"},"canonical_sha256":"66aa41624e1ad4217074658978cf66e0484b4db184cd06008312b0910eacffbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:06.927810Z","signature_b64":"2mh9I8nMyPz5IOfHByTz7zlvl93ATLaG11/eQg/QLhhi50PpfZRBo2oJvIfl/HYizWoMkPkbCUzhsOmlvOD1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66aa41624e1ad4217074658978cf66e0484b4db184cd06008312b0910eacffbe","last_reissued_at":"2026-05-18T00:29:06.927194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:06.927194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00213","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:29:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GaujxvDxx7VWHDRvOf13vHl4HUQyS9q5Zobb/o88UUKXLoabytyUE2OQ/l1NYNy60fzHkt8WzorTuNCJFq29Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:32:01.870892Z"},"content_sha256":"7e6725e7f5e3bd238732e87f0a8f831fb336728e993418d4d77d6770bb330c2a","schema_version":"1.0","event_id":"sha256:7e6725e7f5e3bd238732e87f0a8f831fb336728e993418d4d77d6770bb330c2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:M2VECYSODLKCC4DUMWEXRT3G4B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Real-time Semantic Image Segmentation via Spatial Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anton van den Hengel, Chunhua Shen, Zifeng Wu","submitted_at":"2017-12-01T07:15:28Z","abstract_excerpt":"We propose an approach to semantic (image) segmentation that reduces the computational costs by a factor of 25 with limited impact on the quality of results. Semantic segmentation has a number of practical applications, and for most such applications the computational costs are critical. The method follows a typical two-column network structure, where one column accepts an input image, while the other accepts a half-resolution version of that image. By identifying specific regions in the full-resolution image that can be safely ignored, as well as carefully tailoring the network structure, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00213","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:29:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c+CzNFlIjoMPW9WJuVOfIZ3xlZCgOogeTPDMOpvWxtiaXUN1PwJzuNktdfYUCHCqvBYrYJGMa3GiH58faaagCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:32:01.871570Z"},"content_sha256":"2b1371c90eaad3e51ed1566f5e64a0acefc4b6f590d14a653250cb57ae277d3f","schema_version":"1.0","event_id":"sha256:2b1371c90eaad3e51ed1566f5e64a0acefc4b6f590d14a653250cb57ae277d3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M2VECYSODLKCC4DUMWEXRT3G4B/bundle.json","state_url":"https://pith.science/pith/M2VECYSODLKCC4DUMWEXRT3G4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M2VECYSODLKCC4DUMWEXRT3G4B/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-26T08:32:01Z","links":{"resolver":"https://pith.science/pith/M2VECYSODLKCC4DUMWEXRT3G4B","bundle":"https://pith.science/pith/M2VECYSODLKCC4DUMWEXRT3G4B/bundle.json","state":"https://pith.science/pith/M2VECYSODLKCC4DUMWEXRT3G4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M2VECYSODLKCC4DUMWEXRT3G4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:M2VECYSODLKCC4DUMWEXRT3G4B","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":"7691d0823baaeef85d9ca427cf9b5f18ba53a25fd685120311c8f0769993f2d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-01T07:15:28Z","title_canon_sha256":"7427c60c9db0ba338789f7ab5304815bd8cb5af87561b3bc402228c3621daaed"},"schema_version":"1.0","source":{"id":"1712.00213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00213","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00213v1","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00213","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"pith_short_12","alias_value":"M2VECYSODLKC","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M2VECYSODLKCC4DU","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M2VECYSO","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:2b1371c90eaad3e51ed1566f5e64a0acefc4b6f590d14a653250cb57ae277d3f","target":"graph","created_at":"2026-05-18T00:29:06Z","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":"We propose an approach to semantic (image) segmentation that reduces the computational costs by a factor of 25 with limited impact on the quality of results. Semantic segmentation has a number of practical applications, and for most such applications the computational costs are critical. The method follows a typical two-column network structure, where one column accepts an input image, while the other accepts a half-resolution version of that image. By identifying specific regions in the full-resolution image that can be safely ignored, as well as carefully tailoring the network structure, we ","authors_text":"Anton van den Hengel, Chunhua Shen, Zifeng Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-01T07:15:28Z","title":"Real-time Semantic Image Segmentation via Spatial Sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00213","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:7e6725e7f5e3bd238732e87f0a8f831fb336728e993418d4d77d6770bb330c2a","target":"record","created_at":"2026-05-18T00:29:06Z","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":"7691d0823baaeef85d9ca427cf9b5f18ba53a25fd685120311c8f0769993f2d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-01T07:15:28Z","title_canon_sha256":"7427c60c9db0ba338789f7ab5304815bd8cb5af87561b3bc402228c3621daaed"},"schema_version":"1.0","source":{"id":"1712.00213","kind":"arxiv","version":1}},"canonical_sha256":"66aa41624e1ad4217074658978cf66e0484b4db184cd06008312b0910eacffbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66aa41624e1ad4217074658978cf66e0484b4db184cd06008312b0910eacffbe","first_computed_at":"2026-05-18T00:29:06.927194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:06.927194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2mh9I8nMyPz5IOfHByTz7zlvl93ATLaG11/eQg/QLhhi50PpfZRBo2oJvIfl/HYizWoMkPkbCUzhsOmlvOD1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:06.927810Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e6725e7f5e3bd238732e87f0a8f831fb336728e993418d4d77d6770bb330c2a","sha256:2b1371c90eaad3e51ed1566f5e64a0acefc4b6f590d14a653250cb57ae277d3f"],"state_sha256":"dadcb3c4033efe30c3d24afe1859533d650782d900fdf7df26064f5abd31541d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gqPRDO+9jlFQLZC47I3Ag5oAR7sCjfedZ+3/sjfieiagERav/3ZgkJXI3t6BZTcSaxTE1uhwSQ/ZpDwTepaEBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:32:01.874762Z","bundle_sha256":"4733b93ab316a5fd963db0cac5a4eccb6b486626df1aba57b3a8c9ab6f4fd981"}}