{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PIAMCCZSURF6Q265JFY73A62TS","short_pith_number":"pith:PIAMCCZS","schema_version":"1.0","canonical_sha256":"7a00c10b32a44be86bdd4971fd83da9c81c22f182a282279e382fa9173bb7495","source":{"kind":"arxiv","id":"1703.10530","version":1},"attestation_state":"computed","paper":{"title":"Efficient optimization for Hierarchically-structured Interacting Segments (HINTS)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hossam Isack, Ipek Oguz, Milan Sonka, Olga Veksler, Yuri Boykov","submitted_at":"2017-03-30T15:32:29Z","abstract_excerpt":"We propose an effective optimization algorithm for a general hierarchical segmentation model with geometric interactions between segments. Any given tree can specify a partial order over object labels defining a hierarchy. It is well-established that segment interactions, such as inclusion/exclusion and margin constraints, make the model significantly more discriminant. However, existing optimization methods do not allow full use of such models. Generic -expansion results in weak local minima, while common binary multi-layered formulations lead to non-submodularity, complex high-order potentia"},"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":"1703.10530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-03-30T15:32:29Z","cross_cats_sorted":[],"title_canon_sha256":"77d3f93d179712a930bbd46461003b174d1f02047be6bcd11249e9882497e348","abstract_canon_sha256":"0f2f3a354f0fc831824870bcdbd595f1dd02f0bf83b1d92c1a90f7b0d93438b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:34.458478Z","signature_b64":"bw3udYMAGtUmiUcLCk1DBssEvd71FbuadcJJ92JNN/pHOB3rlUG9GplgLNgx9rpnUKiTcXlj45sJ81vHBp00Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a00c10b32a44be86bdd4971fd83da9c81c22f182a282279e382fa9173bb7495","last_reissued_at":"2026-05-18T00:47:34.457853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:34.457853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient optimization for Hierarchically-structured Interacting Segments (HINTS)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hossam Isack, Ipek Oguz, Milan Sonka, Olga Veksler, Yuri Boykov","submitted_at":"2017-03-30T15:32:29Z","abstract_excerpt":"We propose an effective optimization algorithm for a general hierarchical segmentation model with geometric interactions between segments. Any given tree can specify a partial order over object labels defining a hierarchy. It is well-established that segment interactions, such as inclusion/exclusion and margin constraints, make the model significantly more discriminant. However, existing optimization methods do not allow full use of such models. Generic -expansion results in weak local minima, while common binary multi-layered formulations lead to non-submodularity, complex high-order potentia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10530","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":"1703.10530","created_at":"2026-05-18T00:47:34.457962+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10530v1","created_at":"2026-05-18T00:47:34.457962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10530","created_at":"2026-05-18T00:47:34.457962+00:00"},{"alias_kind":"pith_short_12","alias_value":"PIAMCCZSURF6","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PIAMCCZSURF6Q265","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PIAMCCZS","created_at":"2026-05-18T12:31:37.085036+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/PIAMCCZSURF6Q265JFY73A62TS","json":"https://pith.science/pith/PIAMCCZSURF6Q265JFY73A62TS.json","graph_json":"https://pith.science/api/pith-number/PIAMCCZSURF6Q265JFY73A62TS/graph.json","events_json":"https://pith.science/api/pith-number/PIAMCCZSURF6Q265JFY73A62TS/events.json","paper":"https://pith.science/paper/PIAMCCZS"},"agent_actions":{"view_html":"https://pith.science/pith/PIAMCCZSURF6Q265JFY73A62TS","download_json":"https://pith.science/pith/PIAMCCZSURF6Q265JFY73A62TS.json","view_paper":"https://pith.science/paper/PIAMCCZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10530&json=true","fetch_graph":"https://pith.science/api/pith-number/PIAMCCZSURF6Q265JFY73A62TS/graph.json","fetch_events":"https://pith.science/api/pith-number/PIAMCCZSURF6Q265JFY73A62TS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PIAMCCZSURF6Q265JFY73A62TS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PIAMCCZSURF6Q265JFY73A62TS/action/storage_attestation","attest_author":"https://pith.science/pith/PIAMCCZSURF6Q265JFY73A62TS/action/author_attestation","sign_citation":"https://pith.science/pith/PIAMCCZSURF6Q265JFY73A62TS/action/citation_signature","submit_replication":"https://pith.science/pith/PIAMCCZSURF6Q265JFY73A62TS/action/replication_record"}},"created_at":"2026-05-18T00:47:34.457962+00:00","updated_at":"2026-05-18T00:47:34.457962+00:00"}