{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EGSZLLE3UHOSM34BNMCMZAYII4","short_pith_number":"pith:EGSZLLE3","schema_version":"1.0","canonical_sha256":"21a595ac9ba1dd266f816b04cc83084737c4581e1dd7324fc7d5ec6100bc5553","source":{"kind":"arxiv","id":"1809.08723","version":1},"attestation_state":"computed","paper":{"title":"The Combinatorial Data Fusion Problem in Conflicted-supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"David G. Harris, Dev R. Phulara, John A. Proos, R. W. R. Darling","submitted_at":"2018-09-24T02:13:57Z","abstract_excerpt":"The best merge problem in industrial data science generates instances where disparate data sources place incompatible relational structures on the same set $V$ of objects. Graph vertex labelling data may include (1) missing or erroneous labels,(2) assertions that two vertices carry the same (unspecified) label, and (3) denying some subset of vertices from carrying the same label. Conflicted-supervised learning applies to cases where no labelling scheme satisfies (1), (2), and (3). Our rigorous formulation starts from a connected weighted graph $(V, E)$, and an independence system $\\mathcal{S}$"},"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":"1809.08723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-24T02:13:57Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"08c297b150380f994b2186b323dd83d40319c5882998cdda75295005d109b29b","abstract_canon_sha256":"e444ae982f316b034759fe4e5486a1142f2fa6828824eac54395ab027ee8a5bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:03.737811Z","signature_b64":"+E/NzDq4P/A3JpC0dfGx2Bftb6beZqqL0P87A22j5IkTEGECriMgjTjBoAvWWG3ingPrsC+H0y7IW1PcxxafCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21a595ac9ba1dd266f816b04cc83084737c4581e1dd7324fc7d5ec6100bc5553","last_reissued_at":"2026-05-18T00:05:03.737377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:03.737377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Combinatorial Data Fusion Problem in Conflicted-supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"David G. Harris, Dev R. Phulara, John A. Proos, R. W. R. Darling","submitted_at":"2018-09-24T02:13:57Z","abstract_excerpt":"The best merge problem in industrial data science generates instances where disparate data sources place incompatible relational structures on the same set $V$ of objects. Graph vertex labelling data may include (1) missing or erroneous labels,(2) assertions that two vertices carry the same (unspecified) label, and (3) denying some subset of vertices from carrying the same label. Conflicted-supervised learning applies to cases where no labelling scheme satisfies (1), (2), and (3). Our rigorous formulation starts from a connected weighted graph $(V, E)$, and an independence system $\\mathcal{S}$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08723","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":"1809.08723","created_at":"2026-05-18T00:05:03.737455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08723v1","created_at":"2026-05-18T00:05:03.737455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08723","created_at":"2026-05-18T00:05:03.737455+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGSZLLE3UHOS","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGSZLLE3UHOSM34B","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGSZLLE3","created_at":"2026-05-18T12:32:22.470017+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/EGSZLLE3UHOSM34BNMCMZAYII4","json":"https://pith.science/pith/EGSZLLE3UHOSM34BNMCMZAYII4.json","graph_json":"https://pith.science/api/pith-number/EGSZLLE3UHOSM34BNMCMZAYII4/graph.json","events_json":"https://pith.science/api/pith-number/EGSZLLE3UHOSM34BNMCMZAYII4/events.json","paper":"https://pith.science/paper/EGSZLLE3"},"agent_actions":{"view_html":"https://pith.science/pith/EGSZLLE3UHOSM34BNMCMZAYII4","download_json":"https://pith.science/pith/EGSZLLE3UHOSM34BNMCMZAYII4.json","view_paper":"https://pith.science/paper/EGSZLLE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08723&json=true","fetch_graph":"https://pith.science/api/pith-number/EGSZLLE3UHOSM34BNMCMZAYII4/graph.json","fetch_events":"https://pith.science/api/pith-number/EGSZLLE3UHOSM34BNMCMZAYII4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGSZLLE3UHOSM34BNMCMZAYII4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGSZLLE3UHOSM34BNMCMZAYII4/action/storage_attestation","attest_author":"https://pith.science/pith/EGSZLLE3UHOSM34BNMCMZAYII4/action/author_attestation","sign_citation":"https://pith.science/pith/EGSZLLE3UHOSM34BNMCMZAYII4/action/citation_signature","submit_replication":"https://pith.science/pith/EGSZLLE3UHOSM34BNMCMZAYII4/action/replication_record"}},"created_at":"2026-05-18T00:05:03.737455+00:00","updated_at":"2026-05-18T00:05:03.737455+00:00"}