{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NBUDVUG7FYSLU6MN5A5CMFXFHF","short_pith_number":"pith:NBUDVUG7","canonical_record":{"source":{"id":"1408.5389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-22T19:12:19Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"0c014c21cf92b2b4da9d0fbe4a78b430dee17f5991fe4ff1997193e28de39e95","abstract_canon_sha256":"2190080f590172a51c6b8b6896342bcc9b6bc4dcd4dc445e7a843e0e4f08ee17"},"schema_version":"1.0"},"canonical_sha256":"68683ad0df2e24ba798de83a2616e53963bae78d69c462f586061452d79aca28","source":{"kind":"arxiv","id":"1408.5389","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5389","created_at":"2026-05-18T02:39:33Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5389v1","created_at":"2026-05-18T02:39:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5389","created_at":"2026-05-18T02:39:33Z"},{"alias_kind":"pith_short_12","alias_value":"NBUDVUG7FYSL","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NBUDVUG7FYSLU6MN","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NBUDVUG7","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NBUDVUG7FYSLU6MN5A5CMFXFHF","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-22T19:12:19Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"0c014c21cf92b2b4da9d0fbe4a78b430dee17f5991fe4ff1997193e28de39e95","abstract_canon_sha256":"2190080f590172a51c6b8b6896342bcc9b6bc4dcd4dc445e7a843e0e4f08ee17"},"schema_version":"1.0"},"canonical_sha256":"68683ad0df2e24ba798de83a2616e53963bae78d69c462f586061452d79aca28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:33.351681Z","signature_b64":"eXxbNh9WLgtZeTSWOLHaL3Bi9zHNPRHUxJUSAfA2ly7wbdrMQ//7h1oGo+lIrekBYSZUnPMp3mUYzyxK7XdyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68683ad0df2e24ba798de83a2616e53963bae78d69c462f586061452d79aca28","last_reissued_at":"2026-05-18T02:39:33.351220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:33.351220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5389","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:39:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/Fw3F46XVcgXBmORDMnH1PJaI9vB3vKunY/nu1BzLwiyvI7yznrLoOKSLzEQXMHwg2vRVAPQT9IFabSRRgUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:57:31.256702Z"},"content_sha256":"2d21f698543dbd2eeaf45741a86190d6d59dd39f639be0c5cd966019c3397190","schema_version":"1.0","event_id":"sha256:2d21f698543dbd2eeaf45741a86190d6d59dd39f639be0c5cd966019c3397190"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NBUDVUG7FYSLU6MN5A5CMFXFHF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Multi-Relational Sufficient Statistics for Large Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LG","authors_text":"Oliver Schulte, Yan Sun, Zhensong Qian","submitted_at":"2014-08-22T19:12:19Z","abstract_excerpt":"Databases contain information about which relationships do and do not hold among entities. To make this information accessible for statistical analysis requires computing sufficient statistics that combine information from different database tables. Such statistics may involve any number of {\\em positive and negative} relationships. With a naive enumeration approach, computing sufficient statistics for negative relationships is feasible only for small databases. We solve this problem with a new dynamic programming algorithm that performs a virtual join, where the requisite counts are computed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5389","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:39:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OejqPK7kPS1EPP/horWQ25p2SIEIg5SL8FplQjbJvaXW8CBKJatR6vwCA+IOMLAFP7p6xMi3aB83gMxdGrH7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:57:31.257368Z"},"content_sha256":"ef056a39b6bd7fe8e2840f2fc1be7a3713d0424ea62fb70999a89ee3c95895b3","schema_version":"1.0","event_id":"sha256:ef056a39b6bd7fe8e2840f2fc1be7a3713d0424ea62fb70999a89ee3c95895b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBUDVUG7FYSLU6MN5A5CMFXFHF/bundle.json","state_url":"https://pith.science/pith/NBUDVUG7FYSLU6MN5A5CMFXFHF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBUDVUG7FYSLU6MN5A5CMFXFHF/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-25T17:57:31Z","links":{"resolver":"https://pith.science/pith/NBUDVUG7FYSLU6MN5A5CMFXFHF","bundle":"https://pith.science/pith/NBUDVUG7FYSLU6MN5A5CMFXFHF/bundle.json","state":"https://pith.science/pith/NBUDVUG7FYSLU6MN5A5CMFXFHF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBUDVUG7FYSLU6MN5A5CMFXFHF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NBUDVUG7FYSLU6MN5A5CMFXFHF","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":"2190080f590172a51c6b8b6896342bcc9b6bc4dcd4dc445e7a843e0e4f08ee17","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-22T19:12:19Z","title_canon_sha256":"0c014c21cf92b2b4da9d0fbe4a78b430dee17f5991fe4ff1997193e28de39e95"},"schema_version":"1.0","source":{"id":"1408.5389","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5389","created_at":"2026-05-18T02:39:33Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5389v1","created_at":"2026-05-18T02:39:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5389","created_at":"2026-05-18T02:39:33Z"},{"alias_kind":"pith_short_12","alias_value":"NBUDVUG7FYSL","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NBUDVUG7FYSLU6MN","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NBUDVUG7","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:ef056a39b6bd7fe8e2840f2fc1be7a3713d0424ea62fb70999a89ee3c95895b3","target":"graph","created_at":"2026-05-18T02:39:33Z","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":"Databases contain information about which relationships do and do not hold among entities. To make this information accessible for statistical analysis requires computing sufficient statistics that combine information from different database tables. Such statistics may involve any number of {\\em positive and negative} relationships. With a naive enumeration approach, computing sufficient statistics for negative relationships is feasible only for small databases. We solve this problem with a new dynamic programming algorithm that performs a virtual join, where the requisite counts are computed ","authors_text":"Oliver Schulte, Yan Sun, Zhensong Qian","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-22T19:12:19Z","title":"Computing Multi-Relational Sufficient Statistics for Large Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5389","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:2d21f698543dbd2eeaf45741a86190d6d59dd39f639be0c5cd966019c3397190","target":"record","created_at":"2026-05-18T02:39:33Z","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":"2190080f590172a51c6b8b6896342bcc9b6bc4dcd4dc445e7a843e0e4f08ee17","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-22T19:12:19Z","title_canon_sha256":"0c014c21cf92b2b4da9d0fbe4a78b430dee17f5991fe4ff1997193e28de39e95"},"schema_version":"1.0","source":{"id":"1408.5389","kind":"arxiv","version":1}},"canonical_sha256":"68683ad0df2e24ba798de83a2616e53963bae78d69c462f586061452d79aca28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68683ad0df2e24ba798de83a2616e53963bae78d69c462f586061452d79aca28","first_computed_at":"2026-05-18T02:39:33.351220Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:33.351220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eXxbNh9WLgtZeTSWOLHaL3Bi9zHNPRHUxJUSAfA2ly7wbdrMQ//7h1oGo+lIrekBYSZUnPMp3mUYzyxK7XdyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:33.351681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5389","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d21f698543dbd2eeaf45741a86190d6d59dd39f639be0c5cd966019c3397190","sha256:ef056a39b6bd7fe8e2840f2fc1be7a3713d0424ea62fb70999a89ee3c95895b3"],"state_sha256":"c872e31d422d919d3fa77bf4889958820e15189b6a44aa315fbabd2d16e435e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YpATimAGc0A5fIjJpkCpu3s9koTiOcDxRh+He+oEyF+Kqt2triIXgoiPwYHjLA/w/MmDGMB4kBiQtkFoM6ZaAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:57:31.260639Z","bundle_sha256":"ecbb85fcd8dd6702505273978a53416fb10f4db00f6ac2313004b779293e61ef"}}