{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZZM47JHV6ME7VKH4VNRTKZPL76","short_pith_number":"pith:ZZM47JHV","schema_version":"1.0","canonical_sha256":"ce59cfa4f5f309faa8fcab633565ebff90f88de87e9bb6af30a7f6dce221d496","source":{"kind":"arxiv","id":"1702.04111","version":2},"attestation_state":"computed","paper":{"title":"Efficient Algorithms for Moral Lineage Tracing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bjoern Andres, Bjoern H. Menze, Corinna Blasse, Eugene W. Myers, Florian Jug, Jan-Hendrik Lange, Markus Rempfler","submitted_at":"2017-02-14T08:39:33Z","abstract_excerpt":"Lineage tracing, the joint segmentation and tracking of living cells as they move and divide in a sequence of light microscopy images, is a challenging task. Jug et al. have proposed a mathematical abstraction of this task, the moral lineage tracing problem (MLTP), whose feasible solutions define both a segmentation of every image and a lineage forest of cells. Their branch-and-cut algorithm, however, is prone to many cuts and slow convergence for large instances. To address this problem, we make three contributions: (i) we devise the first efficient primal feasible local search algorithms for"},"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.04111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-14T08:39:33Z","cross_cats_sorted":[],"title_canon_sha256":"17f95ebc0a3e786275ef7f552a6f8192a4cc60cd48b81e7d2d9f7e9a3d4162f5","abstract_canon_sha256":"28dec68f883a1cdd9aa90b638364fb9b0c71a24c65bcabc1e8e1535de42acc57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:43.453930Z","signature_b64":"6QewSF1+8gjEkPdb6XzyX0k32Ssad13kpxLsgcuKqZqU+CoTVhy97X/qgCTLzwGI8iX80YbqX6SYF8efdjMWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce59cfa4f5f309faa8fcab633565ebff90f88de87e9bb6af30a7f6dce221d496","last_reissued_at":"2026-05-18T00:36:43.453250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:43.453250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Moral Lineage Tracing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bjoern Andres, Bjoern H. Menze, Corinna Blasse, Eugene W. Myers, Florian Jug, Jan-Hendrik Lange, Markus Rempfler","submitted_at":"2017-02-14T08:39:33Z","abstract_excerpt":"Lineage tracing, the joint segmentation and tracking of living cells as they move and divide in a sequence of light microscopy images, is a challenging task. Jug et al. have proposed a mathematical abstraction of this task, the moral lineage tracing problem (MLTP), whose feasible solutions define both a segmentation of every image and a lineage forest of cells. Their branch-and-cut algorithm, however, is prone to many cuts and slow convergence for large instances. To address this problem, we make three contributions: (i) we devise the first efficient primal feasible local search algorithms for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04111","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":"1702.04111","created_at":"2026-05-18T00:36:43.453340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04111v2","created_at":"2026-05-18T00:36:43.453340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04111","created_at":"2026-05-18T00:36:43.453340+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZM47JHV6ME7","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZM47JHV6ME7VKH4","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZM47JHV","created_at":"2026-05-18T12:31:59.375834+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/ZZM47JHV6ME7VKH4VNRTKZPL76","json":"https://pith.science/pith/ZZM47JHV6ME7VKH4VNRTKZPL76.json","graph_json":"https://pith.science/api/pith-number/ZZM47JHV6ME7VKH4VNRTKZPL76/graph.json","events_json":"https://pith.science/api/pith-number/ZZM47JHV6ME7VKH4VNRTKZPL76/events.json","paper":"https://pith.science/paper/ZZM47JHV"},"agent_actions":{"view_html":"https://pith.science/pith/ZZM47JHV6ME7VKH4VNRTKZPL76","download_json":"https://pith.science/pith/ZZM47JHV6ME7VKH4VNRTKZPL76.json","view_paper":"https://pith.science/paper/ZZM47JHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04111&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZM47JHV6ME7VKH4VNRTKZPL76/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZM47JHV6ME7VKH4VNRTKZPL76/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZM47JHV6ME7VKH4VNRTKZPL76/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZM47JHV6ME7VKH4VNRTKZPL76/action/storage_attestation","attest_author":"https://pith.science/pith/ZZM47JHV6ME7VKH4VNRTKZPL76/action/author_attestation","sign_citation":"https://pith.science/pith/ZZM47JHV6ME7VKH4VNRTKZPL76/action/citation_signature","submit_replication":"https://pith.science/pith/ZZM47JHV6ME7VKH4VNRTKZPL76/action/replication_record"}},"created_at":"2026-05-18T00:36:43.453340+00:00","updated_at":"2026-05-18T00:36:43.453340+00:00"}