{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VQ3EMB7BMVX7JMDK37T2N25CLK","short_pith_number":"pith:VQ3EMB7B","schema_version":"1.0","canonical_sha256":"ac364607e1656ff4b06adfe7a6eba25a98486e1923cbda1f798c98772340a753","source":{"kind":"arxiv","id":"1702.05413","version":1},"attestation_state":"computed","paper":{"title":"3D Cell Nuclei Segmentation with Balanced Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CV","authors_text":"Johannes Stegmaier, Julian Arz, Peter Sanders, Ralf Mikut","submitted_at":"2017-02-17T16:01:50Z","abstract_excerpt":"Cell nuclei segmentation is one of the most important tasks in the analysis of biomedical images. With ever-growing sizes and amounts of three-dimensional images to be processed, there is a need for better and faster segmentation methods. Graph-based image segmentation has seen a rise in popularity in recent years, but is seen as very costly with regard to computational demand. We propose a new segmentation algorithm which overcomes these limitations. Our method uses recursive balanced graph partitioning to segment foreground components of a fast and efficient binarization. We construct a mode"},"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":"1702.05413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-17T16:01:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"16c5651c9a1c31f220adec975563b4f0c370d8b4b1b50e51de1c9823a7a2ef2e","abstract_canon_sha256":"30fe233729ef6f7afc977226dd7136dd4c854c2bab5a49d8819e3a1ed15fe41a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:31.799920Z","signature_b64":"tuQWuQdKGsE+deiaPSEnMvQRDeXfUEM/W5Ak9xtxSCisCHvLGWNwUP4sf1SFIuVeogeNBPv2UCq2x2Qc0ldmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac364607e1656ff4b06adfe7a6eba25a98486e1923cbda1f798c98772340a753","last_reissued_at":"2026-05-18T00:50:31.799207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:31.799207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"3D Cell Nuclei Segmentation with Balanced Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CV","authors_text":"Johannes Stegmaier, Julian Arz, Peter Sanders, Ralf Mikut","submitted_at":"2017-02-17T16:01:50Z","abstract_excerpt":"Cell nuclei segmentation is one of the most important tasks in the analysis of biomedical images. With ever-growing sizes and amounts of three-dimensional images to be processed, there is a need for better and faster segmentation methods. Graph-based image segmentation has seen a rise in popularity in recent years, but is seen as very costly with regard to computational demand. We propose a new segmentation algorithm which overcomes these limitations. Our method uses recursive balanced graph partitioning to segment foreground components of a fast and efficient binarization. We construct a mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05413","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":"1702.05413","created_at":"2026-05-18T00:50:31.799324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05413v1","created_at":"2026-05-18T00:50:31.799324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05413","created_at":"2026-05-18T00:50:31.799324+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQ3EMB7BMVX7","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQ3EMB7BMVX7JMDK","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQ3EMB7B","created_at":"2026-05-18T12:31:49.984773+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/VQ3EMB7BMVX7JMDK37T2N25CLK","json":"https://pith.science/pith/VQ3EMB7BMVX7JMDK37T2N25CLK.json","graph_json":"https://pith.science/api/pith-number/VQ3EMB7BMVX7JMDK37T2N25CLK/graph.json","events_json":"https://pith.science/api/pith-number/VQ3EMB7BMVX7JMDK37T2N25CLK/events.json","paper":"https://pith.science/paper/VQ3EMB7B"},"agent_actions":{"view_html":"https://pith.science/pith/VQ3EMB7BMVX7JMDK37T2N25CLK","download_json":"https://pith.science/pith/VQ3EMB7BMVX7JMDK37T2N25CLK.json","view_paper":"https://pith.science/paper/VQ3EMB7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05413&json=true","fetch_graph":"https://pith.science/api/pith-number/VQ3EMB7BMVX7JMDK37T2N25CLK/graph.json","fetch_events":"https://pith.science/api/pith-number/VQ3EMB7BMVX7JMDK37T2N25CLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQ3EMB7BMVX7JMDK37T2N25CLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQ3EMB7BMVX7JMDK37T2N25CLK/action/storage_attestation","attest_author":"https://pith.science/pith/VQ3EMB7BMVX7JMDK37T2N25CLK/action/author_attestation","sign_citation":"https://pith.science/pith/VQ3EMB7BMVX7JMDK37T2N25CLK/action/citation_signature","submit_replication":"https://pith.science/pith/VQ3EMB7BMVX7JMDK37T2N25CLK/action/replication_record"}},"created_at":"2026-05-18T00:50:31.799324+00:00","updated_at":"2026-05-18T00:50:31.799324+00:00"}