{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BZQW7KEXD3PXVUM5SVNL5V2FC3","short_pith_number":"pith:BZQW7KEX","schema_version":"1.0","canonical_sha256":"0e616fa8971edf7ad19d955abed74516f300139280ff63e45f7a5455eaab18c4","source":{"kind":"arxiv","id":"2404.18399","version":2},"attestation_state":"computed","paper":{"title":"Semantic Line Combination Detector","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chang-Su Kim, Dongkwon Jin, Jinwon Ko","submitted_at":"2024-04-29T03:21:05Z","abstract_excerpt":"A novel algorithm, called semantic line combination detector (SLCD), to find an optimal combination of semantic lines is proposed in this paper. It processes all lines in each line combination at once to assess the overall harmony of the lines. First, we generate various line combinations from reliable lines. Second, we estimate the score of each line combination and determine the best one. Experimental results demonstrate that the proposed SLCD outperforms existing semantic line detectors on various datasets. Moreover, it is shown that SLCD can be applied effectively to three vision tasks of "},"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":"2404.18399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-04-29T03:21:05Z","cross_cats_sorted":[],"title_canon_sha256":"a3c43a4b3b4387198f844dc71cad003ce4d79b007ef6c67095e67844306742a8","abstract_canon_sha256":"ba926729c0e8b5240e62f4ceab0e72d52ab5b1378d77ba4cbc6ab7c62b23a19c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:14:06.121047Z","signature_b64":"YVAYwPwliVkjCYdmJV4ZWXfXQu7N5gEO6Tjft8dc4v4GxHjUxp/KwOVejcaDYxcbY5UsVmrmbXFcjMONylQWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e616fa8971edf7ad19d955abed74516f300139280ff63e45f7a5455eaab18c4","last_reissued_at":"2026-07-05T08:14:06.120591Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:14:06.120591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semantic Line Combination Detector","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chang-Su Kim, Dongkwon Jin, Jinwon Ko","submitted_at":"2024-04-29T03:21:05Z","abstract_excerpt":"A novel algorithm, called semantic line combination detector (SLCD), to find an optimal combination of semantic lines is proposed in this paper. It processes all lines in each line combination at once to assess the overall harmony of the lines. First, we generate various line combinations from reliable lines. Second, we estimate the score of each line combination and determine the best one. Experimental results demonstrate that the proposed SLCD outperforms existing semantic line detectors on various datasets. Moreover, it is shown that SLCD can be applied effectively to three vision tasks of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.18399","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.18399/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2404.18399","created_at":"2026-07-05T08:14:06.120649+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.18399v2","created_at":"2026-07-05T08:14:06.120649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.18399","created_at":"2026-07-05T08:14:06.120649+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZQW7KEXD3PX","created_at":"2026-07-05T08:14:06.120649+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZQW7KEXD3PXVUM5","created_at":"2026-07-05T08:14:06.120649+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZQW7KEX","created_at":"2026-07-05T08:14:06.120649+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22490","citing_title":"ProCrop: Learning Aesthetic Image Cropping from Professional Compositions","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BZQW7KEXD3PXVUM5SVNL5V2FC3","json":"https://pith.science/pith/BZQW7KEXD3PXVUM5SVNL5V2FC3.json","graph_json":"https://pith.science/api/pith-number/BZQW7KEXD3PXVUM5SVNL5V2FC3/graph.json","events_json":"https://pith.science/api/pith-number/BZQW7KEXD3PXVUM5SVNL5V2FC3/events.json","paper":"https://pith.science/paper/BZQW7KEX"},"agent_actions":{"view_html":"https://pith.science/pith/BZQW7KEXD3PXVUM5SVNL5V2FC3","download_json":"https://pith.science/pith/BZQW7KEXD3PXVUM5SVNL5V2FC3.json","view_paper":"https://pith.science/paper/BZQW7KEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.18399&json=true","fetch_graph":"https://pith.science/api/pith-number/BZQW7KEXD3PXVUM5SVNL5V2FC3/graph.json","fetch_events":"https://pith.science/api/pith-number/BZQW7KEXD3PXVUM5SVNL5V2FC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZQW7KEXD3PXVUM5SVNL5V2FC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZQW7KEXD3PXVUM5SVNL5V2FC3/action/storage_attestation","attest_author":"https://pith.science/pith/BZQW7KEXD3PXVUM5SVNL5V2FC3/action/author_attestation","sign_citation":"https://pith.science/pith/BZQW7KEXD3PXVUM5SVNL5V2FC3/action/citation_signature","submit_replication":"https://pith.science/pith/BZQW7KEXD3PXVUM5SVNL5V2FC3/action/replication_record"}},"created_at":"2026-07-05T08:14:06.120649+00:00","updated_at":"2026-07-05T08:14:06.120649+00:00"}