{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TXJUNSGNPWXSSUPB2LOUAFDHUF","short_pith_number":"pith:TXJUNSGN","canonical_record":{"source":{"id":"1811.04483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-11T21:18:46Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ecfd8cc22cca3fc97dd4b8381e7d1576d1cba9e2116908b251ff4de3ae2f99d7","abstract_canon_sha256":"91720150914fd35c01789d9cf5beead7d14365b1739dc472e48347c20927d862"},"schema_version":"1.0"},"canonical_sha256":"9dd346c8cd7daf2951e1d2dd401467a157653c51bf0f2eb210336ca29aabbfd4","source":{"kind":"arxiv","id":"1811.04483","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04483","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04483v1","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04483","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"pith_short_12","alias_value":"TXJUNSGNPWXS","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TXJUNSGNPWXSSUPB","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TXJUNSGN","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TXJUNSGNPWXSSUPB2LOUAFDHUF","target":"record","payload":{"canonical_record":{"source":{"id":"1811.04483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-11T21:18:46Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ecfd8cc22cca3fc97dd4b8381e7d1576d1cba9e2116908b251ff4de3ae2f99d7","abstract_canon_sha256":"91720150914fd35c01789d9cf5beead7d14365b1739dc472e48347c20927d862"},"schema_version":"1.0"},"canonical_sha256":"9dd346c8cd7daf2951e1d2dd401467a157653c51bf0f2eb210336ca29aabbfd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:05.042980Z","signature_b64":"iw5ckbWKUDXk8k01ZYG+Yb2Wfe6hS0lcpwD2SaGq1oqH0IcFgrJxKZSqbax8SsX/ugPcDsyyoFZJ1vAhHirnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dd346c8cd7daf2951e1d2dd401467a157653c51bf0f2eb210336ca29aabbfd4","last_reissued_at":"2026-05-18T00:01:05.042417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:05.042417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.04483","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:01:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YI9b0K1Pw9DzPuGKM9L5a8Uw2ubKfGuxZYIzI2lqWDwAFuibBu1TwekoB7sLrG34jFHSBpSJ3dMuEnf8SQHcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:29:32.037575Z"},"content_sha256":"89e59a517eb6f3d6affbed053040463254f0dc2318f8f6e43ecb548a54331a00","schema_version":"1.0","event_id":"sha256:89e59a517eb6f3d6affbed053040463254f0dc2318f8f6e43ecb548a54331a00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TXJUNSGNPWXSSUPB2LOUAFDHUF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anomaly Detection and Correction in Large Labeled Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Mark L. Velednitsky, R. W. R. Darling","submitted_at":"2018-11-11T21:18:46Z","abstract_excerpt":"Binary classification problems can be naturally modeled as bipartite graphs, where we attempt to classify right nodes based on their left adjacencies. We consider the case of labeled bipartite graphs in which some labels and edges are not trustworthy. Our goal is to reduce noise by identifying and fixing these labels and edges.\n  We first propose a geometric technique for generating random graph instances with untrustworthy labels and analyze the resulting graph properties. We focus on generating graphs which reflect real-world data, where degree and label frequencies follow power law distribu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04483","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:01:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2LKcrrMIwydBymnQzpGDB7t468qQmmPqTYcVdb9iLmbME6ROMnNpwRworFLYIh9ie9PiIkDsodrR3hrIWSAHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:29:32.037931Z"},"content_sha256":"56e70bf0ee3f1d6fe585224879eb88ffbb3bdc92134a900562302f3211686eaf","schema_version":"1.0","event_id":"sha256:56e70bf0ee3f1d6fe585224879eb88ffbb3bdc92134a900562302f3211686eaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXJUNSGNPWXSSUPB2LOUAFDHUF/bundle.json","state_url":"https://pith.science/pith/TXJUNSGNPWXSSUPB2LOUAFDHUF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXJUNSGNPWXSSUPB2LOUAFDHUF/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-05T08:29:32Z","links":{"resolver":"https://pith.science/pith/TXJUNSGNPWXSSUPB2LOUAFDHUF","bundle":"https://pith.science/pith/TXJUNSGNPWXSSUPB2LOUAFDHUF/bundle.json","state":"https://pith.science/pith/TXJUNSGNPWXSSUPB2LOUAFDHUF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXJUNSGNPWXSSUPB2LOUAFDHUF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TXJUNSGNPWXSSUPB2LOUAFDHUF","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":"91720150914fd35c01789d9cf5beead7d14365b1739dc472e48347c20927d862","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-11T21:18:46Z","title_canon_sha256":"ecfd8cc22cca3fc97dd4b8381e7d1576d1cba9e2116908b251ff4de3ae2f99d7"},"schema_version":"1.0","source":{"id":"1811.04483","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04483","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04483v1","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04483","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"pith_short_12","alias_value":"TXJUNSGNPWXS","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TXJUNSGNPWXSSUPB","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TXJUNSGN","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:56e70bf0ee3f1d6fe585224879eb88ffbb3bdc92134a900562302f3211686eaf","target":"graph","created_at":"2026-05-18T00:01:05Z","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":"Binary classification problems can be naturally modeled as bipartite graphs, where we attempt to classify right nodes based on their left adjacencies. We consider the case of labeled bipartite graphs in which some labels and edges are not trustworthy. Our goal is to reduce noise by identifying and fixing these labels and edges.\n  We first propose a geometric technique for generating random graph instances with untrustworthy labels and analyze the resulting graph properties. We focus on generating graphs which reflect real-world data, where degree and label frequencies follow power law distribu","authors_text":"Mark L. Velednitsky, R. W. R. Darling","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-11T21:18:46Z","title":"Anomaly Detection and Correction in Large Labeled Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04483","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:89e59a517eb6f3d6affbed053040463254f0dc2318f8f6e43ecb548a54331a00","target":"record","created_at":"2026-05-18T00:01:05Z","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":"91720150914fd35c01789d9cf5beead7d14365b1739dc472e48347c20927d862","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-11T21:18:46Z","title_canon_sha256":"ecfd8cc22cca3fc97dd4b8381e7d1576d1cba9e2116908b251ff4de3ae2f99d7"},"schema_version":"1.0","source":{"id":"1811.04483","kind":"arxiv","version":1}},"canonical_sha256":"9dd346c8cd7daf2951e1d2dd401467a157653c51bf0f2eb210336ca29aabbfd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9dd346c8cd7daf2951e1d2dd401467a157653c51bf0f2eb210336ca29aabbfd4","first_computed_at":"2026-05-18T00:01:05.042417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:05.042417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iw5ckbWKUDXk8k01ZYG+Yb2Wfe6hS0lcpwD2SaGq1oqH0IcFgrJxKZSqbax8SsX/ugPcDsyyoFZJ1vAhHirnAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:05.042980Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04483","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89e59a517eb6f3d6affbed053040463254f0dc2318f8f6e43ecb548a54331a00","sha256:56e70bf0ee3f1d6fe585224879eb88ffbb3bdc92134a900562302f3211686eaf"],"state_sha256":"f4b371c3a89648c50efabf2f148ca28297e62dc7225d3db54edefff871d559d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMZ4gbaP3urCAns0znl3Coe7D4UML+iLUn0oV5hjNe531SXQFLg6OMBAYwsuDyifpKiB0YNbOEh45OplZE6QDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:29:32.039924Z","bundle_sha256":"9dd05e458bb8a2aa0751923c7cdb32bdce40f03549e9ded99a28122ef7b46004"}}