{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7ZTMY4THUHCJLRSTLZYEEIQS2L","short_pith_number":"pith:7ZTMY4TH","schema_version":"1.0","canonical_sha256":"fe66cc7267a1c495c6535e70422212d2cb170d19e0e30b551407697706ba43e2","source":{"kind":"arxiv","id":"1907.00141","version":2},"attestation_state":"computed","paper":{"title":"Approximate Inference in Structured Instances with Noisy Categorical Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alireza Heidari, Ihab F. Ilyas, Theodoros Rekatsinas","submitted_at":"2019-06-29T04:15:33Z","abstract_excerpt":"We study the problem of recovering the latent ground truth labeling of a structured instance with categorical random variables in the presence of noisy observations. We present a new approximate algorithm for graphs with categorical variables that achieves low Hamming error in the presence of noisy vertex and edge observations. Our main result shows a logarithmic dependency of the Hamming error to the number of categories of the random variables. Our approach draws connections to correlation clustering with a fixed number of clusters. Our results generalize the works of Globerson et al. (2015)"},"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":"1907.00141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-29T04:15:33Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"4754ccb3a9f34c4815ffddac90d3deb65522a5da195d50716652e3f5fca80ec8","abstract_canon_sha256":"7bd18057d8f20d5b3f0a5adfdc4c9d3d31fb8d3b4da30c63affc652f8fbeeb4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:21.551648Z","signature_b64":"6ApEZEHaludO3ErJoKbyykjVkvQZgMggWidbToHEH4zZyiZ+bVjeq9fiRKVXOp2pnhsUNALLXYTDu/x5LhwRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe66cc7267a1c495c6535e70422212d2cb170d19e0e30b551407697706ba43e2","last_reissued_at":"2026-05-17T23:41:21.550937Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:21.550937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Inference in Structured Instances with Noisy Categorical Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alireza Heidari, Ihab F. Ilyas, Theodoros Rekatsinas","submitted_at":"2019-06-29T04:15:33Z","abstract_excerpt":"We study the problem of recovering the latent ground truth labeling of a structured instance with categorical random variables in the presence of noisy observations. We present a new approximate algorithm for graphs with categorical variables that achieves low Hamming error in the presence of noisy vertex and edge observations. Our main result shows a logarithmic dependency of the Hamming error to the number of categories of the random variables. Our approach draws connections to correlation clustering with a fixed number of clusters. Our results generalize the works of Globerson et al. (2015)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00141","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":"1907.00141","created_at":"2026-05-17T23:41:21.551051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.00141v2","created_at":"2026-05-17T23:41:21.551051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00141","created_at":"2026-05-17T23:41:21.551051+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZTMY4THUHCJ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZTMY4THUHCJLRST","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZTMY4TH","created_at":"2026-05-18T12:33:12.712433+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/7ZTMY4THUHCJLRSTLZYEEIQS2L","json":"https://pith.science/pith/7ZTMY4THUHCJLRSTLZYEEIQS2L.json","graph_json":"https://pith.science/api/pith-number/7ZTMY4THUHCJLRSTLZYEEIQS2L/graph.json","events_json":"https://pith.science/api/pith-number/7ZTMY4THUHCJLRSTLZYEEIQS2L/events.json","paper":"https://pith.science/paper/7ZTMY4TH"},"agent_actions":{"view_html":"https://pith.science/pith/7ZTMY4THUHCJLRSTLZYEEIQS2L","download_json":"https://pith.science/pith/7ZTMY4THUHCJLRSTLZYEEIQS2L.json","view_paper":"https://pith.science/paper/7ZTMY4TH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.00141&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZTMY4THUHCJLRSTLZYEEIQS2L/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZTMY4THUHCJLRSTLZYEEIQS2L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZTMY4THUHCJLRSTLZYEEIQS2L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZTMY4THUHCJLRSTLZYEEIQS2L/action/storage_attestation","attest_author":"https://pith.science/pith/7ZTMY4THUHCJLRSTLZYEEIQS2L/action/author_attestation","sign_citation":"https://pith.science/pith/7ZTMY4THUHCJLRSTLZYEEIQS2L/action/citation_signature","submit_replication":"https://pith.science/pith/7ZTMY4THUHCJLRSTLZYEEIQS2L/action/replication_record"}},"created_at":"2026-05-17T23:41:21.551051+00:00","updated_at":"2026-05-17T23:41:21.551051+00:00"}