{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DUOTG4NA3CNFIS5JOVNGTB36MI","short_pith_number":"pith:DUOTG4NA","schema_version":"1.0","canonical_sha256":"1d1d3371a0d89a544ba9755a69877e6233ac5680fdd49fef11e9d35ea63509c0","source":{"kind":"arxiv","id":"1404.4467","version":2},"attestation_state":"computed","paper":{"title":"Cube-Cut: Vertebral Body Segmentation in MRI-Data through Cubic-Shaped Divergences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bernd Freisleben, Christopher Nimsky, Jan Egger, Robert Schwarzenberg","submitted_at":"2014-04-17T09:58:28Z","abstract_excerpt":"In this article, we present a graph-based method using a cubic template for volumetric segmentation of vertebrae in magnetic resonance imaging (MRI) acquisitions. The user can define the degree of deviation from a regular cube via a smoothness value Delta. The Cube-Cut algorithm generates a directed graph with two terminal nodes (s-t-network), where the nodes of the graph correspond to a cubic-shaped subset of the image's voxels. The weightings of the graph's terminal edges, which connect every node with a virtual source s or a virtual sink t, represent the affinity of a voxel to the vertebra "},"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":"1404.4467","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-17T09:58:28Z","cross_cats_sorted":[],"title_canon_sha256":"35dafc69ac4bb4ab68c465f0670a6412282d349713cc8fae4049f21a10ce9353","abstract_canon_sha256":"bd0ce07f819ee9ed5b4bbad8248d7e6e8cfd2024613e82e90d02d969f5068af5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:43:29.025535Z","signature_b64":"/k2v1obMSwXC4OMdk5l9ht7Er2cSQdCHE+0pCvYnD5jcwdV0r8EPSxPHPcl5rQgJv2yTN2z6mAcjBHe2R2RgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d1d3371a0d89a544ba9755a69877e6233ac5680fdd49fef11e9d35ea63509c0","last_reissued_at":"2026-05-18T01:43:29.024954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:43:29.024954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cube-Cut: Vertebral Body Segmentation in MRI-Data through Cubic-Shaped Divergences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bernd Freisleben, Christopher Nimsky, Jan Egger, Robert Schwarzenberg","submitted_at":"2014-04-17T09:58:28Z","abstract_excerpt":"In this article, we present a graph-based method using a cubic template for volumetric segmentation of vertebrae in magnetic resonance imaging (MRI) acquisitions. The user can define the degree of deviation from a regular cube via a smoothness value Delta. The Cube-Cut algorithm generates a directed graph with two terminal nodes (s-t-network), where the nodes of the graph correspond to a cubic-shaped subset of the image's voxels. The weightings of the graph's terminal edges, which connect every node with a virtual source s or a virtual sink t, represent the affinity of a voxel to the vertebra "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4467","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.4467","created_at":"2026-05-18T01:43:29.025034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4467v2","created_at":"2026-05-18T01:43:29.025034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4467","created_at":"2026-05-18T01:43:29.025034+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUOTG4NA3CNF","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUOTG4NA3CNFIS5J","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUOTG4NA","created_at":"2026-05-18T12:28:25.294606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DUOTG4NA3CNFIS5JOVNGTB36MI","json":"https://pith.science/pith/DUOTG4NA3CNFIS5JOVNGTB36MI.json","graph_json":"https://pith.science/api/pith-number/DUOTG4NA3CNFIS5JOVNGTB36MI/graph.json","events_json":"https://pith.science/api/pith-number/DUOTG4NA3CNFIS5JOVNGTB36MI/events.json","paper":"https://pith.science/paper/DUOTG4NA"},"agent_actions":{"view_html":"https://pith.science/pith/DUOTG4NA3CNFIS5JOVNGTB36MI","download_json":"https://pith.science/pith/DUOTG4NA3CNFIS5JOVNGTB36MI.json","view_paper":"https://pith.science/paper/DUOTG4NA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4467&json=true","fetch_graph":"https://pith.science/api/pith-number/DUOTG4NA3CNFIS5JOVNGTB36MI/graph.json","fetch_events":"https://pith.science/api/pith-number/DUOTG4NA3CNFIS5JOVNGTB36MI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUOTG4NA3CNFIS5JOVNGTB36MI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUOTG4NA3CNFIS5JOVNGTB36MI/action/storage_attestation","attest_author":"https://pith.science/pith/DUOTG4NA3CNFIS5JOVNGTB36MI/action/author_attestation","sign_citation":"https://pith.science/pith/DUOTG4NA3CNFIS5JOVNGTB36MI/action/citation_signature","submit_replication":"https://pith.science/pith/DUOTG4NA3CNFIS5JOVNGTB36MI/action/replication_record"}},"created_at":"2026-05-18T01:43:29.025034+00:00","updated_at":"2026-05-18T01:43:29.025034+00:00"}