{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PQFOBDPRAWGP5KBMLDPF56P2YV","short_pith_number":"pith:PQFOBDPR","schema_version":"1.0","canonical_sha256":"7c0ae08df1058cfea82c58de5ef9fac5668a76cd8d096b4100c9d1e6846ed384","source":{"kind":"arxiv","id":"2001.00528","version":2},"attestation_state":"computed","paper":{"title":"Non-Parametric Learning of Gaifman Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Devendra Singh Dhami, Gautam Kunapuli, Siwen Yan, Sriraam Natarajan","submitted_at":"2020-01-02T17:20:53Z","abstract_excerpt":"We consider the problem of structure learning for Gaifman models and learn relational features that can be used to derive feature representations from a knowledge base. These relational features are first-order rules that are then partially grounded and counted over local neighborhoods of a Gaifman model to obtain the feature representations. We propose a method for learning these relational features for a Gaifman model by using relational tree distances. Our empirical evaluation on real data sets demonstrates the superiority of our approach over classical rule-learning."},"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":"2001.00528","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-02T17:20:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7a19cb85f5eb2745cc61f4665e60c236cde20b2d21589245d4284e805ad6bc02","abstract_canon_sha256":"e669561245984477991a4621b3d360cc69943cbc98a695730eeb2c83fe8a7bf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:33:44.832503Z","signature_b64":"Ij20Kj04UPHAYIDXiy1WiJSpQ3aPxPGdxiay8XC9eTj6JaY79BGTuBxerpPaioNqMA2yol1IvjuEBriRuTRyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c0ae08df1058cfea82c58de5ef9fac5668a76cd8d096b4100c9d1e6846ed384","last_reissued_at":"2026-07-05T00:33:44.832093Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:33:44.832093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Parametric Learning of Gaifman Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Devendra Singh Dhami, Gautam Kunapuli, Siwen Yan, Sriraam Natarajan","submitted_at":"2020-01-02T17:20:53Z","abstract_excerpt":"We consider the problem of structure learning for Gaifman models and learn relational features that can be used to derive feature representations from a knowledge base. These relational features are first-order rules that are then partially grounded and counted over local neighborhoods of a Gaifman model to obtain the feature representations. We propose a method for learning these relational features for a Gaifman model by using relational tree distances. Our empirical evaluation on real data sets demonstrates the superiority of our approach over classical rule-learning."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.00528","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.00528/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":"2001.00528","created_at":"2026-07-05T00:33:44.832158+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.00528v2","created_at":"2026-07-05T00:33:44.832158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.00528","created_at":"2026-07-05T00:33:44.832158+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQFOBDPRAWGP","created_at":"2026-07-05T00:33:44.832158+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQFOBDPRAWGP5KBM","created_at":"2026-07-05T00:33:44.832158+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQFOBDPR","created_at":"2026-07-05T00:33:44.832158+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/PQFOBDPRAWGP5KBMLDPF56P2YV","json":"https://pith.science/pith/PQFOBDPRAWGP5KBMLDPF56P2YV.json","graph_json":"https://pith.science/api/pith-number/PQFOBDPRAWGP5KBMLDPF56P2YV/graph.json","events_json":"https://pith.science/api/pith-number/PQFOBDPRAWGP5KBMLDPF56P2YV/events.json","paper":"https://pith.science/paper/PQFOBDPR"},"agent_actions":{"view_html":"https://pith.science/pith/PQFOBDPRAWGP5KBMLDPF56P2YV","download_json":"https://pith.science/pith/PQFOBDPRAWGP5KBMLDPF56P2YV.json","view_paper":"https://pith.science/paper/PQFOBDPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.00528&json=true","fetch_graph":"https://pith.science/api/pith-number/PQFOBDPRAWGP5KBMLDPF56P2YV/graph.json","fetch_events":"https://pith.science/api/pith-number/PQFOBDPRAWGP5KBMLDPF56P2YV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQFOBDPRAWGP5KBMLDPF56P2YV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQFOBDPRAWGP5KBMLDPF56P2YV/action/storage_attestation","attest_author":"https://pith.science/pith/PQFOBDPRAWGP5KBMLDPF56P2YV/action/author_attestation","sign_citation":"https://pith.science/pith/PQFOBDPRAWGP5KBMLDPF56P2YV/action/citation_signature","submit_replication":"https://pith.science/pith/PQFOBDPRAWGP5KBMLDPF56P2YV/action/replication_record"}},"created_at":"2026-07-05T00:33:44.832158+00:00","updated_at":"2026-07-05T00:33:44.832158+00:00"}