{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ONTZ5D7H3NMMC76HVR7CJPK52D","short_pith_number":"pith:ONTZ5D7H","schema_version":"1.0","canonical_sha256":"73679e8fe7db58c17fc7ac7e24bd5dd0e232d32d66aa577195de9556c21a62c2","source":{"kind":"arxiv","id":"1304.5759","version":1},"attestation_state":"computed","paper":{"title":"Uncertainty Quantification of Discrete Association Problems in Image Sequence-based Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","stat.AP"],"primary_cat":"q-bio.QM","authors_text":"Alexander Mont, Aubrey V. Wiegel, Christopher P. Calderon, Diego Krapf","submitted_at":"2013-04-21T16:04:32Z","abstract_excerpt":"Applications, ranging from tracking molecular motion within cells to analyzing complex animal foraging behavior, require algorithms for associating a collection of spot-like particles in one image with particles contained in another image. These associations are often made via network flow algorithms. However, it is often the case that many candidate association solutions (the output of network flow algorithms) have nearly optimal scores; in this case, the optimal assignment solution is of dubious quality. Algorithms for reliably computing the uncertainty of candidate association solutions are"},"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":"1304.5759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2013-04-21T16:04:32Z","cross_cats_sorted":["cond-mat.mes-hall","stat.AP"],"title_canon_sha256":"b89028aa24fa1eeb33caa72a72aea3cc1fb6411c4ea05db6c889bc59e1ae8a26","abstract_canon_sha256":"ce20a6d0f0fd06a896ea4ca2840522710e6dde807daa2719396bf0d7025f23df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:24.235410Z","signature_b64":"klkrZmevpeXiV3T/H5PGNrWedoTCYl2U3xDYK3S9RTGV62R3RZmTp8v1VbdKfct8Q7OMWFWVOYlQLEuyCK8vCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73679e8fe7db58c17fc7ac7e24bd5dd0e232d32d66aa577195de9556c21a62c2","last_reissued_at":"2026-05-18T03:27:24.234683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:24.234683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncertainty Quantification of Discrete Association Problems in Image Sequence-based Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","stat.AP"],"primary_cat":"q-bio.QM","authors_text":"Alexander Mont, Aubrey V. Wiegel, Christopher P. Calderon, Diego Krapf","submitted_at":"2013-04-21T16:04:32Z","abstract_excerpt":"Applications, ranging from tracking molecular motion within cells to analyzing complex animal foraging behavior, require algorithms for associating a collection of spot-like particles in one image with particles contained in another image. These associations are often made via network flow algorithms. However, it is often the case that many candidate association solutions (the output of network flow algorithms) have nearly optimal scores; in this case, the optimal assignment solution is of dubious quality. Algorithms for reliably computing the uncertainty of candidate association solutions are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5759","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":"1304.5759","created_at":"2026-05-18T03:27:24.234814+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.5759v1","created_at":"2026-05-18T03:27:24.234814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5759","created_at":"2026-05-18T03:27:24.234814+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONTZ5D7H3NMM","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONTZ5D7H3NMMC76H","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONTZ5D7H","created_at":"2026-05-18T12:27:54.935989+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/ONTZ5D7H3NMMC76HVR7CJPK52D","json":"https://pith.science/pith/ONTZ5D7H3NMMC76HVR7CJPK52D.json","graph_json":"https://pith.science/api/pith-number/ONTZ5D7H3NMMC76HVR7CJPK52D/graph.json","events_json":"https://pith.science/api/pith-number/ONTZ5D7H3NMMC76HVR7CJPK52D/events.json","paper":"https://pith.science/paper/ONTZ5D7H"},"agent_actions":{"view_html":"https://pith.science/pith/ONTZ5D7H3NMMC76HVR7CJPK52D","download_json":"https://pith.science/pith/ONTZ5D7H3NMMC76HVR7CJPK52D.json","view_paper":"https://pith.science/paper/ONTZ5D7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.5759&json=true","fetch_graph":"https://pith.science/api/pith-number/ONTZ5D7H3NMMC76HVR7CJPK52D/graph.json","fetch_events":"https://pith.science/api/pith-number/ONTZ5D7H3NMMC76HVR7CJPK52D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONTZ5D7H3NMMC76HVR7CJPK52D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONTZ5D7H3NMMC76HVR7CJPK52D/action/storage_attestation","attest_author":"https://pith.science/pith/ONTZ5D7H3NMMC76HVR7CJPK52D/action/author_attestation","sign_citation":"https://pith.science/pith/ONTZ5D7H3NMMC76HVR7CJPK52D/action/citation_signature","submit_replication":"https://pith.science/pith/ONTZ5D7H3NMMC76HVR7CJPK52D/action/replication_record"}},"created_at":"2026-05-18T03:27:24.234814+00:00","updated_at":"2026-05-18T03:27:24.234814+00:00"}