{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TIBPXKPIGEEF476GBCYM4UL55S","short_pith_number":"pith:TIBPXKPI","canonical_record":{"source":{"id":"1410.3935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-15T06:01:03Z","cross_cats_sorted":[],"title_canon_sha256":"d968fe90caa6828a5faaf83b865d1b091ae7a813696aa1e1e1ff27b90991a95e","abstract_canon_sha256":"8527e5639c6a4380f1ae10a6502db51983786674b02afbeb069c5c4c6d73970f"},"schema_version":"1.0"},"canonical_sha256":"9a02fba9e831085e7fc608b0ce517dec95318ae6b2d53267a309dcaca7d74c9a","source":{"kind":"arxiv","id":"1410.3935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3935","created_at":"2026-05-18T02:40:03Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3935v1","created_at":"2026-05-18T02:40:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3935","created_at":"2026-05-18T02:40:03Z"},{"alias_kind":"pith_short_12","alias_value":"TIBPXKPIGEEF","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TIBPXKPIGEEF476G","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TIBPXKPI","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TIBPXKPIGEEF476GBCYM4UL55S","target":"record","payload":{"canonical_record":{"source":{"id":"1410.3935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-15T06:01:03Z","cross_cats_sorted":[],"title_canon_sha256":"d968fe90caa6828a5faaf83b865d1b091ae7a813696aa1e1e1ff27b90991a95e","abstract_canon_sha256":"8527e5639c6a4380f1ae10a6502db51983786674b02afbeb069c5c4c6d73970f"},"schema_version":"1.0"},"canonical_sha256":"9a02fba9e831085e7fc608b0ce517dec95318ae6b2d53267a309dcaca7d74c9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:03.607715Z","signature_b64":"I4eMdwBl9+77ReSHtiRTw6Y6kSy1QibmqwJttH+DUAH8BRWTAyR6VPa2o0iYv8J3/PHRQ0OqFEKWDnHXP9xsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a02fba9e831085e7fc608b0ce517dec95318ae6b2d53267a309dcaca7d74c9a","last_reissued_at":"2026-05-18T02:40:03.607167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:03.607167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.3935","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-18T02:40:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R9au6yI+mnofT7LbNwjvOG8xpWEzeGgCQc7mcGmIxYcxSOOLmhCdb2PQsWqLvUIcg8OhQ4C3A9OXC2F5N1omDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:02:02.636096Z"},"content_sha256":"3b341591db067a9aeb43eb2fae94637bc5fd6701a05350ccd682659242203696","schema_version":"1.0","event_id":"sha256:3b341591db067a9aeb43eb2fae94637bc5fd6701a05350ccd682659242203696"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TIBPXKPIGEEF476GBCYM4UL55S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Logic-based Approach to Generatively Defined Discriminative Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Keiichi Kubota, Taisuke Sato, Yoshitaka Kameya","submitted_at":"2014-10-15T06:01:03Z","abstract_excerpt":"Conditional random fields (CRFs) are usually specified by graphical models but in this paper we propose to use probabilistic logic programs and specify them generatively. Our intension is first to provide a unified approach to CRFs for complex modeling through the use of a Turing complete language and second to offer a convenient way of realizing generative-discriminative pairs in machine learning to compare generative and discriminative models and choose the best model. We implemented our approach as the D-PRISM language by modifying PRISM, a logic-based probabilistic modeling language for ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3935","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-18T02:40:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n4VbNyLGP5vche32gw4Id5L+x/LwdmilGYGUuvR62UrRs6Txl9VBw7hxAgZEvycq3X77zpfOrhpAW/cTur9/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:02:02.636821Z"},"content_sha256":"bb6e81a9b90b5f4be41440055ec33e572d02d340278b1d9e958dadf25e24d232","schema_version":"1.0","event_id":"sha256:bb6e81a9b90b5f4be41440055ec33e572d02d340278b1d9e958dadf25e24d232"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TIBPXKPIGEEF476GBCYM4UL55S/bundle.json","state_url":"https://pith.science/pith/TIBPXKPIGEEF476GBCYM4UL55S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TIBPXKPIGEEF476GBCYM4UL55S/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-08T19:02:02Z","links":{"resolver":"https://pith.science/pith/TIBPXKPIGEEF476GBCYM4UL55S","bundle":"https://pith.science/pith/TIBPXKPIGEEF476GBCYM4UL55S/bundle.json","state":"https://pith.science/pith/TIBPXKPIGEEF476GBCYM4UL55S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TIBPXKPIGEEF476GBCYM4UL55S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TIBPXKPIGEEF476GBCYM4UL55S","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":"8527e5639c6a4380f1ae10a6502db51983786674b02afbeb069c5c4c6d73970f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-15T06:01:03Z","title_canon_sha256":"d968fe90caa6828a5faaf83b865d1b091ae7a813696aa1e1e1ff27b90991a95e"},"schema_version":"1.0","source":{"id":"1410.3935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3935","created_at":"2026-05-18T02:40:03Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3935v1","created_at":"2026-05-18T02:40:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3935","created_at":"2026-05-18T02:40:03Z"},{"alias_kind":"pith_short_12","alias_value":"TIBPXKPIGEEF","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TIBPXKPIGEEF476G","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TIBPXKPI","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:bb6e81a9b90b5f4be41440055ec33e572d02d340278b1d9e958dadf25e24d232","target":"graph","created_at":"2026-05-18T02:40:03Z","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":"Conditional random fields (CRFs) are usually specified by graphical models but in this paper we propose to use probabilistic logic programs and specify them generatively. Our intension is first to provide a unified approach to CRFs for complex modeling through the use of a Turing complete language and second to offer a convenient way of realizing generative-discriminative pairs in machine learning to compare generative and discriminative models and choose the best model. We implemented our approach as the D-PRISM language by modifying PRISM, a logic-based probabilistic modeling language for ge","authors_text":"Keiichi Kubota, Taisuke Sato, Yoshitaka Kameya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-15T06:01:03Z","title":"A Logic-based Approach to Generatively Defined Discriminative Modeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3935","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:3b341591db067a9aeb43eb2fae94637bc5fd6701a05350ccd682659242203696","target":"record","created_at":"2026-05-18T02:40:03Z","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":"8527e5639c6a4380f1ae10a6502db51983786674b02afbeb069c5c4c6d73970f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-15T06:01:03Z","title_canon_sha256":"d968fe90caa6828a5faaf83b865d1b091ae7a813696aa1e1e1ff27b90991a95e"},"schema_version":"1.0","source":{"id":"1410.3935","kind":"arxiv","version":1}},"canonical_sha256":"9a02fba9e831085e7fc608b0ce517dec95318ae6b2d53267a309dcaca7d74c9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a02fba9e831085e7fc608b0ce517dec95318ae6b2d53267a309dcaca7d74c9a","first_computed_at":"2026-05-18T02:40:03.607167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:03.607167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I4eMdwBl9+77ReSHtiRTw6Y6kSy1QibmqwJttH+DUAH8BRWTAyR6VPa2o0iYv8J3/PHRQ0OqFEKWDnHXP9xsBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:03.607715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b341591db067a9aeb43eb2fae94637bc5fd6701a05350ccd682659242203696","sha256:bb6e81a9b90b5f4be41440055ec33e572d02d340278b1d9e958dadf25e24d232"],"state_sha256":"14a38a8fa59ba06dec006624a2628b789801c012ae5b6706c6dca01d260e229f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1fSts4X+NyrAg4gHRHhcrLbL5VDrESXYofrqCu6nsoRsNUojNz2EIdjiWBvAOEsL40WwKrk2/FYyI6h0hVbLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:02:02.640662Z","bundle_sha256":"b95007cde80de1cb1112cf83cb54dbd0bb93912a8aae211ee7900406a3baf653"}}