{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SM4DPA36EDI6SGHEBKG3EREJ5C","short_pith_number":"pith:SM4DPA36","schema_version":"1.0","canonical_sha256":"933837837e20d1e918e40a8db24489e88bdc0b10c7bf6d6ca5498b358a67b004","source":{"kind":"arxiv","id":"1109.4684","version":1},"attestation_state":"computed","paper":{"title":"Exhaustive and Efficient Constraint Propagation: A Semi-Supervised Learning Perspective and Its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Horace H.S. Ip, Yuxin Peng, Zhiwu Lu","submitted_at":"2011-09-22T00:56:22Z","abstract_excerpt":"This paper presents a novel pairwise constraint propagation approach by decomposing the challenging constraint propagation problem into a set of independent semi-supervised learning subproblems which can be solved in quadratic time using label propagation based on k-nearest neighbor graphs. Considering that this time cost is proportional to the number of all possible pairwise constraints, our approach actually provides an efficient solution for exhaustively propagating pairwise constraints throughout the entire dataset. The resulting exhaustive set of propagated pairwise constraints are furthe"},"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":"1109.4684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-22T00:56:22Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"dac0a71ea93392c88336bf4d189892a459bdcf16879debfe9b8509bf6eb91a02","abstract_canon_sha256":"c1b466f2904468cdceb92aa1b64437629ce44ea7b2e3614c4cb07f7520a6b336"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:36.376100Z","signature_b64":"ipxpb4yDLe/5WUUlQKvCoql+N/AzzUmGrgSHQarRphXH1a2Oz0kUnH5pWsb7PU+LjtYh92++zKI1xc5icndBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"933837837e20d1e918e40a8db24489e88bdc0b10c7bf6d6ca5498b358a67b004","last_reissued_at":"2026-05-18T02:21:36.375654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:36.375654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exhaustive and Efficient Constraint Propagation: A Semi-Supervised Learning Perspective and Its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Horace H.S. Ip, Yuxin Peng, Zhiwu Lu","submitted_at":"2011-09-22T00:56:22Z","abstract_excerpt":"This paper presents a novel pairwise constraint propagation approach by decomposing the challenging constraint propagation problem into a set of independent semi-supervised learning subproblems which can be solved in quadratic time using label propagation based on k-nearest neighbor graphs. Considering that this time cost is proportional to the number of all possible pairwise constraints, our approach actually provides an efficient solution for exhaustively propagating pairwise constraints throughout the entire dataset. The resulting exhaustive set of propagated pairwise constraints are furthe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4684","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":"1109.4684","created_at":"2026-05-18T02:21:36.375717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4684v1","created_at":"2026-05-18T02:21:36.375717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4684","created_at":"2026-05-18T02:21:36.375717+00:00"},{"alias_kind":"pith_short_12","alias_value":"SM4DPA36EDI6","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SM4DPA36EDI6SGHE","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SM4DPA36","created_at":"2026-05-18T12:26:41.206345+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/SM4DPA36EDI6SGHEBKG3EREJ5C","json":"https://pith.science/pith/SM4DPA36EDI6SGHEBKG3EREJ5C.json","graph_json":"https://pith.science/api/pith-number/SM4DPA36EDI6SGHEBKG3EREJ5C/graph.json","events_json":"https://pith.science/api/pith-number/SM4DPA36EDI6SGHEBKG3EREJ5C/events.json","paper":"https://pith.science/paper/SM4DPA36"},"agent_actions":{"view_html":"https://pith.science/pith/SM4DPA36EDI6SGHEBKG3EREJ5C","download_json":"https://pith.science/pith/SM4DPA36EDI6SGHEBKG3EREJ5C.json","view_paper":"https://pith.science/paper/SM4DPA36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4684&json=true","fetch_graph":"https://pith.science/api/pith-number/SM4DPA36EDI6SGHEBKG3EREJ5C/graph.json","fetch_events":"https://pith.science/api/pith-number/SM4DPA36EDI6SGHEBKG3EREJ5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SM4DPA36EDI6SGHEBKG3EREJ5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SM4DPA36EDI6SGHEBKG3EREJ5C/action/storage_attestation","attest_author":"https://pith.science/pith/SM4DPA36EDI6SGHEBKG3EREJ5C/action/author_attestation","sign_citation":"https://pith.science/pith/SM4DPA36EDI6SGHEBKG3EREJ5C/action/citation_signature","submit_replication":"https://pith.science/pith/SM4DPA36EDI6SGHEBKG3EREJ5C/action/replication_record"}},"created_at":"2026-05-18T02:21:36.375717+00:00","updated_at":"2026-05-18T02:21:36.375717+00:00"}