{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AD2YXAIRXPTIZHTNEDP7NMM5GS","short_pith_number":"pith:AD2YXAIR","schema_version":"1.0","canonical_sha256":"00f58b8111bbe68c9e6d20dff6b19d348a85a91849d0229f52ae0191127e9a79","source":{"kind":"arxiv","id":"1201.2925","version":2},"attestation_state":"computed","paper":{"title":"Combining Heterogeneous Classifiers for Relational Databases","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LG","authors_text":"Dinkar Sitaram, Geetha Manjunatha, M Narasimha Murty","submitted_at":"2012-01-13T19:54:27Z","abstract_excerpt":"Most enterprise data is distributed in multiple relational databases with expert-designed schema. Using traditional single-table machine learning techniques over such data not only incur a computational penalty for converting to a 'flat' form (mega-join), even the human-specified semantic information present in the relations is lost. In this paper, we present a practical, two-phase hierarchical meta-classification algorithm for relational databases with a semantic divide and conquer approach. We propose a recursive, prediction aggregation technique over heterogeneous classifiers applied on ind"},"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":"1201.2925","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2012-01-13T19:54:27Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"57fed1c0e316e226ebf94222cadc658ecd87f09aaa1ee8f7bf76bfca963c41ef","abstract_canon_sha256":"c761ebb9ad5ecf3a06e8ec8d9c0ad8fc2007b18000555ffc4636b7cd00b24984"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:15.241330Z","signature_b64":"7HpbWdf9eNaGmpLVm6ig4/V7IgJiI8Zb8wNTUB8pE8SWO9e42tZ2qjJ7na/eXGWSQzMzr5FA5gK7X3HfdfXmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00f58b8111bbe68c9e6d20dff6b19d348a85a91849d0229f52ae0191127e9a79","last_reissued_at":"2026-05-18T04:00:15.240049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:15.240049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combining Heterogeneous Classifiers for Relational Databases","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LG","authors_text":"Dinkar Sitaram, Geetha Manjunatha, M Narasimha Murty","submitted_at":"2012-01-13T19:54:27Z","abstract_excerpt":"Most enterprise data is distributed in multiple relational databases with expert-designed schema. Using traditional single-table machine learning techniques over such data not only incur a computational penalty for converting to a 'flat' form (mega-join), even the human-specified semantic information present in the relations is lost. In this paper, we present a practical, two-phase hierarchical meta-classification algorithm for relational databases with a semantic divide and conquer approach. We propose a recursive, prediction aggregation technique over heterogeneous classifiers applied on ind"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2925","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":"1201.2925","created_at":"2026-05-18T04:00:15.240649+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.2925v2","created_at":"2026-05-18T04:00:15.240649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2925","created_at":"2026-05-18T04:00:15.240649+00:00"},{"alias_kind":"pith_short_12","alias_value":"AD2YXAIRXPTI","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AD2YXAIRXPTIZHTN","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AD2YXAIR","created_at":"2026-05-18T12:26:58.693483+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/AD2YXAIRXPTIZHTNEDP7NMM5GS","json":"https://pith.science/pith/AD2YXAIRXPTIZHTNEDP7NMM5GS.json","graph_json":"https://pith.science/api/pith-number/AD2YXAIRXPTIZHTNEDP7NMM5GS/graph.json","events_json":"https://pith.science/api/pith-number/AD2YXAIRXPTIZHTNEDP7NMM5GS/events.json","paper":"https://pith.science/paper/AD2YXAIR"},"agent_actions":{"view_html":"https://pith.science/pith/AD2YXAIRXPTIZHTNEDP7NMM5GS","download_json":"https://pith.science/pith/AD2YXAIRXPTIZHTNEDP7NMM5GS.json","view_paper":"https://pith.science/paper/AD2YXAIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.2925&json=true","fetch_graph":"https://pith.science/api/pith-number/AD2YXAIRXPTIZHTNEDP7NMM5GS/graph.json","fetch_events":"https://pith.science/api/pith-number/AD2YXAIRXPTIZHTNEDP7NMM5GS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AD2YXAIRXPTIZHTNEDP7NMM5GS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AD2YXAIRXPTIZHTNEDP7NMM5GS/action/storage_attestation","attest_author":"https://pith.science/pith/AD2YXAIRXPTIZHTNEDP7NMM5GS/action/author_attestation","sign_citation":"https://pith.science/pith/AD2YXAIRXPTIZHTNEDP7NMM5GS/action/citation_signature","submit_replication":"https://pith.science/pith/AD2YXAIRXPTIZHTNEDP7NMM5GS/action/replication_record"}},"created_at":"2026-05-18T04:00:15.240649+00:00","updated_at":"2026-05-18T04:00:15.240649+00:00"}