{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Z6P2SBASZUBK4TESG343M7AYMD","short_pith_number":"pith:Z6P2SBAS","canonical_record":{"source":{"id":"1804.01640","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-04-05T01:05:34Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"329742a822f012cbd7d1523bed9a681d3d3f405906d334779252a7b6c8e6883d","abstract_canon_sha256":"c60fd35e6507582d27708b9b235c718c41d780483db5bef294955a8e4f4ee007"},"schema_version":"1.0"},"canonical_sha256":"cf9fa90412cd02ae4c9236f9b67c1860d55e6d350d9090fa18290950b9998c77","source":{"kind":"arxiv","id":"1804.01640","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01640","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01640v1","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01640","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"Z6P2SBASZUBK","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z6P2SBASZUBK4TES","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z6P2SBAS","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Z6P2SBASZUBK4TESG343M7AYMD","target":"record","payload":{"canonical_record":{"source":{"id":"1804.01640","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-04-05T01:05:34Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"329742a822f012cbd7d1523bed9a681d3d3f405906d334779252a7b6c8e6883d","abstract_canon_sha256":"c60fd35e6507582d27708b9b235c718c41d780483db5bef294955a8e4f4ee007"},"schema_version":"1.0"},"canonical_sha256":"cf9fa90412cd02ae4c9236f9b67c1860d55e6d350d9090fa18290950b9998c77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:10.581376Z","signature_b64":"s4+PGGoxB4hK8GR/FS9z5xehGbiB/3wSB8Y0S4AKIshNa1A4kI8XpPTlAadk6aQNkCX2R0wHAS6EtcUpVJrTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf9fa90412cd02ae4c9236f9b67c1860d55e6d350d9090fa18290950b9998c77","last_reissued_at":"2026-05-18T00:19:10.580604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:10.580604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.01640","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:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WcUMNo7XYX+syujlo13yFm4to2FgO5gGnp9eYzcMyjgRj3YjSn585BHySVwh+xF9h0DykSzhLj1gTZV513FgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:57:38.751784Z"},"content_sha256":"f49774645d9f2f1efd8b0498a1c9ffc15a45c72d38b8707dcbd5467ff1692b80","schema_version":"1.0","event_id":"sha256:f49774645d9f2f1efd8b0498a1c9ffc15a45c72d38b8707dcbd5467ff1692b80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Z6P2SBASZUBK4TESG343M7AYMD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hypertree Decompositions Revisited for PGMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.AI","authors_text":"Aarthy Shivram Arun, Atri Rudra, Christopher R\\'e, Sai Vikneshwar Mani Jayaraman","submitted_at":"2018-04-05T01:05:34Z","abstract_excerpt":"We revisit the classical problem of exact inference on probabilistic graphical models (PGMs). Our algorithm is based on recent worst-case optimal database join algorithms, which can be asymptotically faster than traditional data processing methods. We present the first empirical evaluation of these new algorithms via JoinInfer, a new exact inference engine. We empirically explore the properties of the data for which our engine can be expected to outperform traditional inference engines refining current theoretical notions. Further, JoinInfer outperforms existing state-of-the-art inference engi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01640","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:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"obTKIbvatcR62Fm3JCNhW7QpR1lk0XtdTIZtH8XQDQunwngFTdENsLpfClZBpfLZBIia6RTUbiTBZxtexckiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:57:38.752135Z"},"content_sha256":"29472fa84c412d9635533594daf5b168fbd327640fa3c38196074a6eefdfc68e","schema_version":"1.0","event_id":"sha256:29472fa84c412d9635533594daf5b168fbd327640fa3c38196074a6eefdfc68e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z6P2SBASZUBK4TESG343M7AYMD/bundle.json","state_url":"https://pith.science/pith/Z6P2SBASZUBK4TESG343M7AYMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z6P2SBASZUBK4TESG343M7AYMD/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-22T12:57:38Z","links":{"resolver":"https://pith.science/pith/Z6P2SBASZUBK4TESG343M7AYMD","bundle":"https://pith.science/pith/Z6P2SBASZUBK4TESG343M7AYMD/bundle.json","state":"https://pith.science/pith/Z6P2SBASZUBK4TESG343M7AYMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z6P2SBASZUBK4TESG343M7AYMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z6P2SBASZUBK4TESG343M7AYMD","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":"c60fd35e6507582d27708b9b235c718c41d780483db5bef294955a8e4f4ee007","cross_cats_sorted":["cs.DB"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-04-05T01:05:34Z","title_canon_sha256":"329742a822f012cbd7d1523bed9a681d3d3f405906d334779252a7b6c8e6883d"},"schema_version":"1.0","source":{"id":"1804.01640","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01640","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01640v1","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01640","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"Z6P2SBASZUBK","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z6P2SBASZUBK4TES","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z6P2SBAS","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:29472fa84c412d9635533594daf5b168fbd327640fa3c38196074a6eefdfc68e","target":"graph","created_at":"2026-05-18T00:19: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":"We revisit the classical problem of exact inference on probabilistic graphical models (PGMs). Our algorithm is based on recent worst-case optimal database join algorithms, which can be asymptotically faster than traditional data processing methods. We present the first empirical evaluation of these new algorithms via JoinInfer, a new exact inference engine. We empirically explore the properties of the data for which our engine can be expected to outperform traditional inference engines refining current theoretical notions. Further, JoinInfer outperforms existing state-of-the-art inference engi","authors_text":"Aarthy Shivram Arun, Atri Rudra, Christopher R\\'e, Sai Vikneshwar Mani Jayaraman","cross_cats":["cs.DB"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-04-05T01:05:34Z","title":"Hypertree Decompositions Revisited for PGMs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01640","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:f49774645d9f2f1efd8b0498a1c9ffc15a45c72d38b8707dcbd5467ff1692b80","target":"record","created_at":"2026-05-18T00:19: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":"c60fd35e6507582d27708b9b235c718c41d780483db5bef294955a8e4f4ee007","cross_cats_sorted":["cs.DB"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-04-05T01:05:34Z","title_canon_sha256":"329742a822f012cbd7d1523bed9a681d3d3f405906d334779252a7b6c8e6883d"},"schema_version":"1.0","source":{"id":"1804.01640","kind":"arxiv","version":1}},"canonical_sha256":"cf9fa90412cd02ae4c9236f9b67c1860d55e6d350d9090fa18290950b9998c77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf9fa90412cd02ae4c9236f9b67c1860d55e6d350d9090fa18290950b9998c77","first_computed_at":"2026-05-18T00:19:10.580604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:10.580604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s4+PGGoxB4hK8GR/FS9z5xehGbiB/3wSB8Y0S4AKIshNa1A4kI8XpPTlAadk6aQNkCX2R0wHAS6EtcUpVJrTBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:10.581376Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01640","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f49774645d9f2f1efd8b0498a1c9ffc15a45c72d38b8707dcbd5467ff1692b80","sha256:29472fa84c412d9635533594daf5b168fbd327640fa3c38196074a6eefdfc68e"],"state_sha256":"6a0d205cb91bc954f81362a799b4ac6bf298d94e9984a6af239226b52f518e5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HAcNgMnBJV9HSfDsr8RXUF27RmxbmfCAULqvVPeitT6n9U4b+1RjD/05DK9aA7p5gGHofSR9Qr5y+RAQ+DmDBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T12:57:38.754088Z","bundle_sha256":"f33f91a00903d2c00ec821495237eed6b8806e842f503df681be84a1237f11fd"}}