{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:A36RQ3JG5IZPQH7IP3L6UZWES4","short_pith_number":"pith:A36RQ3JG","schema_version":"1.0","canonical_sha256":"06fd186d26ea32f81fe87ed7ea66c49716bd08254c08448a63e7e403181c905e","source":{"kind":"arxiv","id":"0907.1815","version":1},"attestation_state":"computed","paper":{"title":"Frustratingly Easy Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Hal Daum\\'e III","submitted_at":"2009-07-10T13:25:48Z","abstract_excerpt":"We describe an approach to domain adaptation that is appropriate exactly in the case when one has enough ``target'' data to do slightly better than just using only ``source'' data. Our approach is incredibly simple, easy to implement as a preprocessing step (10 lines of Perl!) and outperforms state-of-the-art approaches on a range of datasets. Moreover, it is trivially extended to a multi-domain adaptation problem, where one has data from a variety of different domains."},"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":"0907.1815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-07-10T13:25:48Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"6d09211a73047edf3bdd8acf134b4b609236fbbf940ef93b82c8280d3857d874","abstract_canon_sha256":"62f9811453f1f0bcbe1d4d873a1f6bdd2a39e29161f879a3108e94fc90561d1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:45:59.575668Z","signature_b64":"jRSmfuVc4+Db/03QIIvIj+o9ruNswYc2c59Y2YI9fLb0EXexzTeHiDMO9GnKoB9N5gsLFEvXZ37vrBVaQqFECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06fd186d26ea32f81fe87ed7ea66c49716bd08254c08448a63e7e403181c905e","last_reissued_at":"2026-07-04T15:45:59.575311Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:45:59.575311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frustratingly Easy Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Hal Daum\\'e III","submitted_at":"2009-07-10T13:25:48Z","abstract_excerpt":"We describe an approach to domain adaptation that is appropriate exactly in the case when one has enough ``target'' data to do slightly better than just using only ``source'' data. Our approach is incredibly simple, easy to implement as a preprocessing step (10 lines of Perl!) and outperforms state-of-the-art approaches on a range of datasets. Moreover, it is trivially extended to a multi-domain adaptation problem, where one has data from a variety of different domains."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.1815","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0907.1815/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0907.1815","created_at":"2026-07-04T15:45:59.575386+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.1815v1","created_at":"2026-07-04T15:45:59.575386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.1815","created_at":"2026-07-04T15:45:59.575386+00:00"},{"alias_kind":"pith_short_12","alias_value":"A36RQ3JG5IZP","created_at":"2026-07-04T15:45:59.575386+00:00"},{"alias_kind":"pith_short_16","alias_value":"A36RQ3JG5IZPQH7I","created_at":"2026-07-04T15:45:59.575386+00:00"},{"alias_kind":"pith_short_8","alias_value":"A36RQ3JG","created_at":"2026-07-04T15:45:59.575386+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09868","citing_title":"Pose Estimation for Non-Cooperative Rendezvous Using Neural Networks","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A36RQ3JG5IZPQH7IP3L6UZWES4","json":"https://pith.science/pith/A36RQ3JG5IZPQH7IP3L6UZWES4.json","graph_json":"https://pith.science/api/pith-number/A36RQ3JG5IZPQH7IP3L6UZWES4/graph.json","events_json":"https://pith.science/api/pith-number/A36RQ3JG5IZPQH7IP3L6UZWES4/events.json","paper":"https://pith.science/paper/A36RQ3JG"},"agent_actions":{"view_html":"https://pith.science/pith/A36RQ3JG5IZPQH7IP3L6UZWES4","download_json":"https://pith.science/pith/A36RQ3JG5IZPQH7IP3L6UZWES4.json","view_paper":"https://pith.science/paper/A36RQ3JG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.1815&json=true","fetch_graph":"https://pith.science/api/pith-number/A36RQ3JG5IZPQH7IP3L6UZWES4/graph.json","fetch_events":"https://pith.science/api/pith-number/A36RQ3JG5IZPQH7IP3L6UZWES4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A36RQ3JG5IZPQH7IP3L6UZWES4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A36RQ3JG5IZPQH7IP3L6UZWES4/action/storage_attestation","attest_author":"https://pith.science/pith/A36RQ3JG5IZPQH7IP3L6UZWES4/action/author_attestation","sign_citation":"https://pith.science/pith/A36RQ3JG5IZPQH7IP3L6UZWES4/action/citation_signature","submit_replication":"https://pith.science/pith/A36RQ3JG5IZPQH7IP3L6UZWES4/action/replication_record"}},"created_at":"2026-07-04T15:45:59.575386+00:00","updated_at":"2026-07-04T15:45:59.575386+00:00"}