{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EGSZLLE3UHOSM34BNMCMZAYII4","short_pith_number":"pith:EGSZLLE3","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"},"canonical_sha256":"21a595ac9ba1dd266f816b04cc83084737c4581e1dd7324fc7d5ec6100bc5553","source":{"kind":"arxiv","id":"1809.08723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08723","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08723v1","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08723","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"EGSZLLE3UHOS","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EGSZLLE3UHOSM34B","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EGSZLLE3","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EGSZLLE3UHOSM34BNMCMZAYII4","target":"record","payload":{"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"},"canonical_sha256":"21a595ac9ba1dd266f816b04cc83084737c4581e1dd7324fc7d5ec6100bc5553","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"},"source_kind":"arxiv","source_id":"1809.08723","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJws1kNKaj7pXblvjtbjhkPkhNB3+3qZDlQXVMKoCd3s0URQmeBRcLRcvnYvgULfgCbsheQoVe88GZtyHEOkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:28:05.579094Z"},"content_sha256":"7992336d04f94d83ac3a88f9cdb7aa6f2e9d684f0c7cec5bf394b5931e7a5183","schema_version":"1.0","event_id":"sha256:7992336d04f94d83ac3a88f9cdb7aa6f2e9d684f0c7cec5bf394b5931e7a5183"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EGSZLLE3UHOSM34BNMCMZAYII4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3upCobBFhg/dWrdlETjIyOh7JVU62w3Dwrym2XKBNOfTcuwmiqXJU6njJyEK7OnTCnPrPIh9rTdCTXvhwvY7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:28:05.579492Z"},"content_sha256":"54cfc09376a58dcbf932c0262ffbcd6ca9168cf1b74cf0b04bbb756954efd52f","schema_version":"1.0","event_id":"sha256:54cfc09376a58dcbf932c0262ffbcd6ca9168cf1b74cf0b04bbb756954efd52f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EGSZLLE3UHOSM34BNMCMZAYII4/bundle.json","state_url":"https://pith.science/pith/EGSZLLE3UHOSM34BNMCMZAYII4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EGSZLLE3UHOSM34BNMCMZAYII4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T06:28:05Z","links":{"resolver":"https://pith.science/pith/EGSZLLE3UHOSM34BNMCMZAYII4","bundle":"https://pith.science/pith/EGSZLLE3UHOSM34BNMCMZAYII4/bundle.json","state":"https://pith.science/pith/EGSZLLE3UHOSM34BNMCMZAYII4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EGSZLLE3UHOSM34BNMCMZAYII4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EGSZLLE3UHOSM34BNMCMZAYII4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e444ae982f316b034759fe4e5486a1142f2fa6828824eac54395ab027ee8a5bc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-24T02:13:57Z","title_canon_sha256":"08c297b150380f994b2186b323dd83d40319c5882998cdda75295005d109b29b"},"schema_version":"1.0","source":{"id":"1809.08723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08723","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08723v1","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08723","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"EGSZLLE3UHOS","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EGSZLLE3UHOSM34B","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EGSZLLE3","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:54cfc09376a58dcbf932c0262ffbcd6ca9168cf1b74cf0b04bbb756954efd52f","target":"graph","created_at":"2026-05-18T00:05:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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}$","authors_text":"David G. Harris, Dev R. Phulara, John A. Proos, R. W. R. Darling","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-24T02:13:57Z","title":"The Combinatorial Data Fusion Problem in Conflicted-supervised Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08723","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7992336d04f94d83ac3a88f9cdb7aa6f2e9d684f0c7cec5bf394b5931e7a5183","target":"record","created_at":"2026-05-18T00:05:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e444ae982f316b034759fe4e5486a1142f2fa6828824eac54395ab027ee8a5bc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-24T02:13:57Z","title_canon_sha256":"08c297b150380f994b2186b323dd83d40319c5882998cdda75295005d109b29b"},"schema_version":"1.0","source":{"id":"1809.08723","kind":"arxiv","version":1}},"canonical_sha256":"21a595ac9ba1dd266f816b04cc83084737c4581e1dd7324fc7d5ec6100bc5553","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21a595ac9ba1dd266f816b04cc83084737c4581e1dd7324fc7d5ec6100bc5553","first_computed_at":"2026-05-18T00:05:03.737377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:03.737377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+E/NzDq4P/A3JpC0dfGx2Bftb6beZqqL0P87A22j5IkTEGECriMgjTjBoAvWWG3ingPrsC+H0y7IW1PcxxafCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:03.737811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7992336d04f94d83ac3a88f9cdb7aa6f2e9d684f0c7cec5bf394b5931e7a5183","sha256:54cfc09376a58dcbf932c0262ffbcd6ca9168cf1b74cf0b04bbb756954efd52f"],"state_sha256":"2c4de9b9201597e2b1d7b29aba852b21e05a50f686703ef57a38e686aaf5eda3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JSx6Wse0A+niMu/rqqfYsyH4xSBZUBVG37EpLiCV7OCycBSZhPkp2zlwlLvzjsAnghvVDACNVchBqh9hwLEsBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:28:05.583866Z","bundle_sha256":"bc14e84dad3b14e5ef595e021098216c66e0bc33b3aae04411c21623f7476afb"}}