{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NTXJ7JMKY6GHO7P424TBEK3VZG","short_pith_number":"pith:NTXJ7JMK","canonical_record":{"source":{"id":"1805.00152","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2018-05-01T02:16:29Z","cross_cats_sorted":[],"title_canon_sha256":"deb02a97822b3241251047d36c9d114c01c0b0b574fb189efc41f6dccf98e21a","abstract_canon_sha256":"a202f33c9bb32c0b1976cad7e9b4ed0912492ffec925f9952de85cd6bb5dbbea"},"schema_version":"1.0"},"canonical_sha256":"6cee9fa58ac78c777dfcd726122b75c9926a35f80a4a707bdd3ccd21d14a0860","source":{"kind":"arxiv","id":"1805.00152","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00152","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00152v1","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00152","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"NTXJ7JMKY6GH","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NTXJ7JMKY6GHO7P4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NTXJ7JMK","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NTXJ7JMKY6GHO7P424TBEK3VZG","target":"record","payload":{"canonical_record":{"source":{"id":"1805.00152","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2018-05-01T02:16:29Z","cross_cats_sorted":[],"title_canon_sha256":"deb02a97822b3241251047d36c9d114c01c0b0b574fb189efc41f6dccf98e21a","abstract_canon_sha256":"a202f33c9bb32c0b1976cad7e9b4ed0912492ffec925f9952de85cd6bb5dbbea"},"schema_version":"1.0"},"canonical_sha256":"6cee9fa58ac78c777dfcd726122b75c9926a35f80a4a707bdd3ccd21d14a0860","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:10.458612Z","signature_b64":"791coWre7eaVFKeR05qiPkBEpqhulx6+oVFew4MPT7T1ucQmKKr0bPB1TZqP4MZ6oAFvvumMXjKOnBMjuwGbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cee9fa58ac78c777dfcd726122b75c9926a35f80a4a707bdd3ccd21d14a0860","last_reissued_at":"2026-05-18T00:17:10.457991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:10.457991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.00152","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-18T00:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WGP7sHY7iKkqjtdIGaz6riOZcCmvnIqXMwWuw/8NIMJtFOsUO+hvTCBuuGxPiqbFs08V3O1mFUTnn2l7eD/qDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:52:36.541192Z"},"content_sha256":"44e1d03590b5f98da789d2e11ad7fcab86863b43998d2810d00f1ca4a9118770","schema_version":"1.0","event_id":"sha256:44e1d03590b5f98da789d2e11ad7fcab86863b43998d2810d00f1ca4a9118770"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NTXJ7JMKY6GHO7P424TBEK3VZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Equivalence of Generative and Discriminative Formulations of the Sequential Dependence Model","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"John Foley, Laura Dietz","submitted_at":"2018-05-01T02:16:29Z","abstract_excerpt":"The sequential dependence model (SDM) is a popular retrieval model which is based on the theory of probabilistic graphical models. While it was originally introduced by Metzler and Croft as a Markov Random Field (aka discriminative probabilistic model), in this paper we demonstrate that it is equivalent to a generative probabilistic model.\n  To build an foundation for future retrieval models, this paper details the axiomatic underpinning of the SDM model as discriminative and generative probabilistic model. The only difference arises whether model parameters are estimated in log-space or Multi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00152","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-18T00:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"00P8o4OuKGchdcMshLUCS6RTM3HVmoKhgKG4I4ZksxzBTqvofGP6+oZsK7MbN0dGTaFSz5wTJflSyu4C9sFiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:52:36.541906Z"},"content_sha256":"7b21687eb17f42de3da9dc4d626f3ee509b2af28ceab35b1d2e20aa6a606805a","schema_version":"1.0","event_id":"sha256:7b21687eb17f42de3da9dc4d626f3ee509b2af28ceab35b1d2e20aa6a606805a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTXJ7JMKY6GHO7P424TBEK3VZG/bundle.json","state_url":"https://pith.science/pith/NTXJ7JMKY6GHO7P424TBEK3VZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTXJ7JMKY6GHO7P424TBEK3VZG/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-05-27T22:52:36Z","links":{"resolver":"https://pith.science/pith/NTXJ7JMKY6GHO7P424TBEK3VZG","bundle":"https://pith.science/pith/NTXJ7JMKY6GHO7P424TBEK3VZG/bundle.json","state":"https://pith.science/pith/NTXJ7JMKY6GHO7P424TBEK3VZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTXJ7JMKY6GHO7P424TBEK3VZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NTXJ7JMKY6GHO7P424TBEK3VZG","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":"a202f33c9bb32c0b1976cad7e9b4ed0912492ffec925f9952de85cd6bb5dbbea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2018-05-01T02:16:29Z","title_canon_sha256":"deb02a97822b3241251047d36c9d114c01c0b0b574fb189efc41f6dccf98e21a"},"schema_version":"1.0","source":{"id":"1805.00152","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00152","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00152v1","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00152","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"NTXJ7JMKY6GH","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NTXJ7JMKY6GHO7P4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NTXJ7JMK","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:7b21687eb17f42de3da9dc4d626f3ee509b2af28ceab35b1d2e20aa6a606805a","target":"graph","created_at":"2026-05-18T00:17:10Z","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":"The sequential dependence model (SDM) is a popular retrieval model which is based on the theory of probabilistic graphical models. While it was originally introduced by Metzler and Croft as a Markov Random Field (aka discriminative probabilistic model), in this paper we demonstrate that it is equivalent to a generative probabilistic model.\n  To build an foundation for future retrieval models, this paper details the axiomatic underpinning of the SDM model as discriminative and generative probabilistic model. The only difference arises whether model parameters are estimated in log-space or Multi","authors_text":"John Foley, Laura Dietz","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2018-05-01T02:16:29Z","title":"On the Equivalence of Generative and Discriminative Formulations of the Sequential Dependence Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00152","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:44e1d03590b5f98da789d2e11ad7fcab86863b43998d2810d00f1ca4a9118770","target":"record","created_at":"2026-05-18T00:17:10Z","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":"a202f33c9bb32c0b1976cad7e9b4ed0912492ffec925f9952de85cd6bb5dbbea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2018-05-01T02:16:29Z","title_canon_sha256":"deb02a97822b3241251047d36c9d114c01c0b0b574fb189efc41f6dccf98e21a"},"schema_version":"1.0","source":{"id":"1805.00152","kind":"arxiv","version":1}},"canonical_sha256":"6cee9fa58ac78c777dfcd726122b75c9926a35f80a4a707bdd3ccd21d14a0860","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cee9fa58ac78c777dfcd726122b75c9926a35f80a4a707bdd3ccd21d14a0860","first_computed_at":"2026-05-18T00:17:10.457991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:10.457991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"791coWre7eaVFKeR05qiPkBEpqhulx6+oVFew4MPT7T1ucQmKKr0bPB1TZqP4MZ6oAFvvumMXjKOnBMjuwGbDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:10.458612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.00152","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44e1d03590b5f98da789d2e11ad7fcab86863b43998d2810d00f1ca4a9118770","sha256:7b21687eb17f42de3da9dc4d626f3ee509b2af28ceab35b1d2e20aa6a606805a"],"state_sha256":"c28c15497df500ce7275dd1ce59d4906c353116239403bcda9215cc2579791f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fkkNBYjhqsaGs+Zu/FtGtnLDJyKNJ5TfWUB+21oh3rZ0hPGsZF9h7VCDV7OGNHFCwWrz4//DJNswrHtqRt/aAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:52:36.545444Z","bundle_sha256":"9e59e652424135a9e2013ae7018636cdefa8fed356c719aee37ccdc474001993"}}