{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4BEDI4YOWIJ25HKK6VP4KTLX3A","short_pith_number":"pith:4BEDI4YO","schema_version":"1.0","canonical_sha256":"e04834730eb213ae9d4af55fc54d77d8209e7169b66cf7440a72f5b989c55e30","source":{"kind":"arxiv","id":"1804.10484","version":4},"attestation_state":"computed","paper":{"title":"Crossbar-Net: A Novel Convolutional Network for Kidney Tumor Segmentation in CT Images","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jianbing Zhu, Jinquan Sun, Qian Yu, Yakang Dai, Yang Gao, Yinghuan Shi","submitted_at":"2018-04-27T13:09:27Z","abstract_excerpt":"Due to the irregular motion, similar appearance and diverse shape, accurate segmentation of kidney tumor in CT images is a difficult and challenging task. To this end, we present a novel automatic segmentation method, termed as Crossbar-Net, with the goal of accurate segmenting the kidney tumors. Firstly, considering that the traditional learning-based segmentation methods normally employ either whole images or squared patches as the training samples, we innovatively sample the orthogonal non-squared patches (namely crossbar patches), to fully cover the whole kidney tumors in either horizontal"},"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":"1804.10484","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-27T13:09:27Z","cross_cats_sorted":[],"title_canon_sha256":"9eb4d988e3945439764b02b2eb8d8872f9acec9acc401424af62aafe8387aab5","abstract_canon_sha256":"c346f9967b94b4080fa92abe041e61da68fccd94d6a374bdd1da349b609330eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:52:25.593980Z","signature_b64":"rU4jD2+21k5MkHGxCa4FtJluZCvkt9wfw+ek6qJkaIodLHkTS8nflnUsWbm9TLsAOsEvcljanHavUftOAkAwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e04834730eb213ae9d4af55fc54d77d8209e7169b66cf7440a72f5b989c55e30","last_reissued_at":"2026-07-05T00:52:25.593321Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:52:25.593321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Crossbar-Net: A Novel Convolutional Network for Kidney Tumor Segmentation in CT Images","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jianbing Zhu, Jinquan Sun, Qian Yu, Yakang Dai, Yang Gao, Yinghuan Shi","submitted_at":"2018-04-27T13:09:27Z","abstract_excerpt":"Due to the irregular motion, similar appearance and diverse shape, accurate segmentation of kidney tumor in CT images is a difficult and challenging task. To this end, we present a novel automatic segmentation method, termed as Crossbar-Net, with the goal of accurate segmenting the kidney tumors. Firstly, considering that the traditional learning-based segmentation methods normally employ either whole images or squared patches as the training samples, we innovatively sample the orthogonal non-squared patches (namely crossbar patches), to fully cover the whole kidney tumors in either horizontal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10484","kind":"arxiv","version":4},"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/1804.10484/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.10484","created_at":"2026-07-05T00:52:25.593408+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10484v4","created_at":"2026-07-05T00:52:25.593408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10484","created_at":"2026-07-05T00:52:25.593408+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BEDI4YOWIJ2","created_at":"2026-07-05T00:52:25.593408+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BEDI4YOWIJ25HKK","created_at":"2026-07-05T00:52:25.593408+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BEDI4YO","created_at":"2026-07-05T00:52:25.593408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.02182","citing_title":"An attempt at beating the 3D U-Net","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4BEDI4YOWIJ25HKK6VP4KTLX3A","json":"https://pith.science/pith/4BEDI4YOWIJ25HKK6VP4KTLX3A.json","graph_json":"https://pith.science/api/pith-number/4BEDI4YOWIJ25HKK6VP4KTLX3A/graph.json","events_json":"https://pith.science/api/pith-number/4BEDI4YOWIJ25HKK6VP4KTLX3A/events.json","paper":"https://pith.science/paper/4BEDI4YO"},"agent_actions":{"view_html":"https://pith.science/pith/4BEDI4YOWIJ25HKK6VP4KTLX3A","download_json":"https://pith.science/pith/4BEDI4YOWIJ25HKK6VP4KTLX3A.json","view_paper":"https://pith.science/paper/4BEDI4YO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10484&json=true","fetch_graph":"https://pith.science/api/pith-number/4BEDI4YOWIJ25HKK6VP4KTLX3A/graph.json","fetch_events":"https://pith.science/api/pith-number/4BEDI4YOWIJ25HKK6VP4KTLX3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BEDI4YOWIJ25HKK6VP4KTLX3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BEDI4YOWIJ25HKK6VP4KTLX3A/action/storage_attestation","attest_author":"https://pith.science/pith/4BEDI4YOWIJ25HKK6VP4KTLX3A/action/author_attestation","sign_citation":"https://pith.science/pith/4BEDI4YOWIJ25HKK6VP4KTLX3A/action/citation_signature","submit_replication":"https://pith.science/pith/4BEDI4YOWIJ25HKK6VP4KTLX3A/action/replication_record"}},"created_at":"2026-07-05T00:52:25.593408+00:00","updated_at":"2026-07-05T00:52:25.593408+00:00"}