{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AVHQVPRHLWJLGHTFVJZKN6OOHJ","short_pith_number":"pith:AVHQVPRH","schema_version":"1.0","canonical_sha256":"054f0abe275d92b31e65aa72a6f9ce3a6027be0552e8e92fd88eef017557071c","source":{"kind":"arxiv","id":"1905.02036","version":1},"attestation_state":"computed","paper":{"title":"Unsupervised Domain Adaptation using Graph Transduction Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.GT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Torcinovich, Elena Marchiori, Marcello Pelillo, Sebastiano Vascon, Sinem Aslan, Twan van Laarhoven","submitted_at":"2019-05-06T13:34:04Z","abstract_excerpt":"Unsupervised domain adaptation (UDA) amounts to assigning class labels to the unlabeled instances of a dataset from a target domain, using labeled instances of a dataset from a related source domain. In this paper, we propose to cast this problem in a game-theoretic setting as a non-cooperative game and introduce a fully automatized iterative algorithm for UDA based on graph transduction games (GTG). The main advantages of this approach are its principled foundation, guaranteed termination of the iterative algorithms to a Nash equilibrium (which corresponds to a consistent labeling condition) "},"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":"1905.02036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-06T13:34:04Z","cross_cats_sorted":["cs.CV","cs.GT","stat.ML"],"title_canon_sha256":"bf2cd1b85d06578322cabc087341c9d9932d2f55689ec7f392636fc9bc2d47f8","abstract_canon_sha256":"426638883877ceb1d2df384746fa66f80ff0cc6940b49807e6b469e401ec5b45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:56.593567Z","signature_b64":"oCu9SsVA72R3tJ+37cs8shiILwHB0EN0IjGvJyOWpoBUNpGH5Tk/tL9VTtHMMuhajQWVGeI8bfDqyoT/wL78Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"054f0abe275d92b31e65aa72a6f9ce3a6027be0552e8e92fd88eef017557071c","last_reissued_at":"2026-05-17T23:46:56.592838Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:56.592838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unsupervised Domain Adaptation using Graph Transduction Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.GT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Torcinovich, Elena Marchiori, Marcello Pelillo, Sebastiano Vascon, Sinem Aslan, Twan van Laarhoven","submitted_at":"2019-05-06T13:34:04Z","abstract_excerpt":"Unsupervised domain adaptation (UDA) amounts to assigning class labels to the unlabeled instances of a dataset from a target domain, using labeled instances of a dataset from a related source domain. In this paper, we propose to cast this problem in a game-theoretic setting as a non-cooperative game and introduce a fully automatized iterative algorithm for UDA based on graph transduction games (GTG). The main advantages of this approach are its principled foundation, guaranteed termination of the iterative algorithms to a Nash equilibrium (which corresponds to a consistent labeling condition) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02036","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":"1905.02036","created_at":"2026-05-17T23:46:56.592946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.02036v1","created_at":"2026-05-17T23:46:56.592946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02036","created_at":"2026-05-17T23:46:56.592946+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVHQVPRHLWJL","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVHQVPRHLWJLGHTF","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVHQVPRH","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/AVHQVPRHLWJLGHTFVJZKN6OOHJ","json":"https://pith.science/pith/AVHQVPRHLWJLGHTFVJZKN6OOHJ.json","graph_json":"https://pith.science/api/pith-number/AVHQVPRHLWJLGHTFVJZKN6OOHJ/graph.json","events_json":"https://pith.science/api/pith-number/AVHQVPRHLWJLGHTFVJZKN6OOHJ/events.json","paper":"https://pith.science/paper/AVHQVPRH"},"agent_actions":{"view_html":"https://pith.science/pith/AVHQVPRHLWJLGHTFVJZKN6OOHJ","download_json":"https://pith.science/pith/AVHQVPRHLWJLGHTFVJZKN6OOHJ.json","view_paper":"https://pith.science/paper/AVHQVPRH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.02036&json=true","fetch_graph":"https://pith.science/api/pith-number/AVHQVPRHLWJLGHTFVJZKN6OOHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/AVHQVPRHLWJLGHTFVJZKN6OOHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVHQVPRHLWJLGHTFVJZKN6OOHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVHQVPRHLWJLGHTFVJZKN6OOHJ/action/storage_attestation","attest_author":"https://pith.science/pith/AVHQVPRHLWJLGHTFVJZKN6OOHJ/action/author_attestation","sign_citation":"https://pith.science/pith/AVHQVPRHLWJLGHTFVJZKN6OOHJ/action/citation_signature","submit_replication":"https://pith.science/pith/AVHQVPRHLWJLGHTFVJZKN6OOHJ/action/replication_record"}},"created_at":"2026-05-17T23:46:56.592946+00:00","updated_at":"2026-05-17T23:46:56.592946+00:00"}