{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:M2VECYSODLKCC4DUMWEXRT3G4B","short_pith_number":"pith:M2VECYSO","schema_version":"1.0","canonical_sha256":"66aa41624e1ad4217074658978cf66e0484b4db184cd06008312b0910eacffbe","source":{"kind":"arxiv","id":"1712.00213","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.00213","created_at":"2026-05-18T00:29:06.927277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.00213v1","created_at":"2026-05-18T00:29:06.927277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00213","created_at":"2026-05-18T00:29:06.927277+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2VECYSODLKC","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2VECYSODLKCC4DU","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2VECYSO","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.01058","citing_title":"Associative Embedding for Game-Agnostic Team Discrimination","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M2VECYSODLKCC4DUMWEXRT3G4B","json":"https://pith.science/pith/M2VECYSODLKCC4DUMWEXRT3G4B.json","graph_json":"https://pith.science/api/pith-number/M2VECYSODLKCC4DUMWEXRT3G4B/graph.json","events_json":"https://pith.science/api/pith-number/M2VECYSODLKCC4DUMWEXRT3G4B/events.json","paper":"https://pith.science/paper/M2VECYSO"},"agent_actions":{"view_html":"https://pith.science/pith/M2VECYSODLKCC4DUMWEXRT3G4B","download_json":"https://pith.science/pith/M2VECYSODLKCC4DUMWEXRT3G4B.json","view_paper":"https://pith.science/paper/M2VECYSO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.00213&json=true","fetch_graph":"https://pith.science/api/pith-number/M2VECYSODLKCC4DUMWEXRT3G4B/graph.json","fetch_events":"https://pith.science/api/pith-number/M2VECYSODLKCC4DUMWEXRT3G4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2VECYSODLKCC4DUMWEXRT3G4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2VECYSODLKCC4DUMWEXRT3G4B/action/storage_attestation","attest_author":"https://pith.science/pith/M2VECYSODLKCC4DUMWEXRT3G4B/action/author_attestation","sign_citation":"https://pith.science/pith/M2VECYSODLKCC4DUMWEXRT3G4B/action/citation_signature","submit_replication":"https://pith.science/pith/M2VECYSODLKCC4DUMWEXRT3G4B/action/replication_record"}},"created_at":"2026-05-18T00:29:06.927277+00:00","updated_at":"2026-05-18T00:29:06.927277+00:00"}