{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5AUQNN4ZQUAI47ZD3NBQQO2EXN","short_pith_number":"pith:5AUQNN4Z","canonical_record":{"source":{"id":"2611.17074","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-11-12T16:46:17Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"cadf07fca4026e667ac4b0c61fb382fc1ada4f6813ccdd653a496e396d4ba28d","abstract_canon_sha256":"1f86ba71529313a879f0b1d8da11fab759da6d14c541f881b2c128ba5ebe7ba8"},"schema_version":"1.0"},"canonical_sha256":"e82906b79985008e7f23db43083b44bb5e9c056ce640c62e82f50c556ceb7b43","source":{"kind":"arxiv","id":"2611.17074","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2611.17074","created_at":"2026-11-13T06:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"2611.17074v1","created_at":"2026-11-13T06:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2611.17074","created_at":"2026-11-13T06:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"5AUQNN4ZQUAI","created_at":"2026-11-13T06:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"5AUQNN4ZQUAI47ZD","created_at":"2026-11-13T06:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"5AUQNN4Z","created_at":"2026-11-13T06:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5AUQNN4ZQUAI47ZD3NBQQO2EXN","target":"record","payload":{"canonical_record":{"source":{"id":"2611.17074","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-11-12T16:46:17Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"cadf07fca4026e667ac4b0c61fb382fc1ada4f6813ccdd653a496e396d4ba28d","abstract_canon_sha256":"1f86ba71529313a879f0b1d8da11fab759da6d14c541f881b2c128ba5ebe7ba8"},"schema_version":"1.0"},"canonical_sha256":"e82906b79985008e7f23db43083b44bb5e9c056ce640c62e82f50c556ceb7b43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-11-13T06:32:16.877037Z","signature_b64":"gIg7Jn/Vy3swDx5j/Y3OYqoj+I8c/9ioVPUmQ9PEPgg4+tums3DCjr/C8hz3tjHLUIPFoF1sqPjhCWJbNQIPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e82906b79985008e7f23db43083b44bb5e9c056ce640c62e82f50c556ceb7b43","last_reissued_at":"2026-11-13T06:32:16.874755Z","signature_status":"signed_v1","first_computed_at":"2026-11-13T06:32:16.874755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2611.17074","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-11-13T06:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pJmcADOyDcHSQ20EP45PlW96o3v+VpNLotmuTWT+peHQU7JBOjRBoKP5w+iSizKTLovE9vYsdEs/GeKtZ8xaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-11-16T03:41:02.001125Z"},"content_sha256":"f66f01c2de690cbdb179404e85fe8afeae49b3a304d87b067c53775d50087c3a","schema_version":"1.0","event_id":"sha256:f66f01c2de690cbdb179404e85fe8afeae49b3a304d87b067c53775d50087c3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5AUQNN4ZQUAI47ZD3NBQQO2EXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GraphInfer: Statistical Inference for Decomposable Graphical Models in R","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Rodrigo Labouriau","submitted_at":"2026-11-12T16:46:17Z","abstract_excerpt":"Decomposable graphical models combine closed-form maximum likelihood estimation with local model comparison, which makes structure inference practical with many variables. The R package GraphInfer provides one likelihood framework for decomposable models of continuous, discrete and mixed data, the last as conditional Gaussian models. Structure inference ranges from exact minimum forests and stepwise search to stochastic global search. Nested models are compared by likelihood-ratio tests whose null distributions are exact in finite samples: conditionally on the discrete data for edges with a co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2611.17074","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2611.17074/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"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-11-13T06:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C1e4B0yOLoUpmDbjVrKLqTcrLg0G8JxhtgAD5F30HdwUl5P+p9AB2/GIZb/LjE+RdWF+1q0VxZZufEA8oWBaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-11-16T03:41:02.001517Z"},"content_sha256":"e18c54872db823773948a32afdf98288fdf9ea63060eb27189d5c5fbaef586d1","schema_version":"1.0","event_id":"sha256:e18c54872db823773948a32afdf98288fdf9ea63060eb27189d5c5fbaef586d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5AUQNN4ZQUAI47ZD3NBQQO2EXN/bundle.json","state_url":"https://pith.science/pith/5AUQNN4ZQUAI47ZD3NBQQO2EXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5AUQNN4ZQUAI47ZD3NBQQO2EXN/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-11-16T03:41:02Z","links":{"resolver":"https://pith.science/pith/5AUQNN4ZQUAI47ZD3NBQQO2EXN","bundle":"https://pith.science/pith/5AUQNN4ZQUAI47ZD3NBQQO2EXN/bundle.json","state":"https://pith.science/pith/5AUQNN4ZQUAI47ZD3NBQQO2EXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5AUQNN4ZQUAI47ZD3NBQQO2EXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5AUQNN4ZQUAI47ZD3NBQQO2EXN","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":"1f86ba71529313a879f0b1d8da11fab759da6d14c541f881b2c128ba5ebe7ba8","cross_cats_sorted":["stat.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-11-12T16:46:17Z","title_canon_sha256":"cadf07fca4026e667ac4b0c61fb382fc1ada4f6813ccdd653a496e396d4ba28d"},"schema_version":"1.0","source":{"id":"2611.17074","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2611.17074","created_at":"2026-11-13T06:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"2611.17074v1","created_at":"2026-11-13T06:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2611.17074","created_at":"2026-11-13T06:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"5AUQNN4ZQUAI","created_at":"2026-11-13T06:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"5AUQNN4ZQUAI47ZD","created_at":"2026-11-13T06:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"5AUQNN4Z","created_at":"2026-11-13T06:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:e18c54872db823773948a32afdf98288fdf9ea63060eb27189d5c5fbaef586d1","target":"graph","created_at":"2026-11-13T06:32:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2611.17074/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decomposable graphical models combine closed-form maximum likelihood estimation with local model comparison, which makes structure inference practical with many variables. The R package GraphInfer provides one likelihood framework for decomposable models of continuous, discrete and mixed data, the last as conditional Gaussian models. Structure inference ranges from exact minimum forests and stepwise search to stochastic global search. Nested models are compared by likelihood-ratio tests whose null distributions are exact in finite samples: conditionally on the discrete data for edges with a co","authors_text":"Rodrigo Labouriau","cross_cats":["stat.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-11-12T16:46:17Z","title":"GraphInfer: Statistical Inference for Decomposable Graphical Models in R"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2611.17074","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:f66f01c2de690cbdb179404e85fe8afeae49b3a304d87b067c53775d50087c3a","target":"record","created_at":"2026-11-13T06:32:16Z","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":"1f86ba71529313a879f0b1d8da11fab759da6d14c541f881b2c128ba5ebe7ba8","cross_cats_sorted":["stat.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-11-12T16:46:17Z","title_canon_sha256":"cadf07fca4026e667ac4b0c61fb382fc1ada4f6813ccdd653a496e396d4ba28d"},"schema_version":"1.0","source":{"id":"2611.17074","kind":"arxiv","version":1}},"canonical_sha256":"e82906b79985008e7f23db43083b44bb5e9c056ce640c62e82f50c556ceb7b43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e82906b79985008e7f23db43083b44bb5e9c056ce640c62e82f50c556ceb7b43","first_computed_at":"2026-11-13T06:32:16.874755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-11-13T06:32:16.874755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gIg7Jn/Vy3swDx5j/Y3OYqoj+I8c/9ioVPUmQ9PEPgg4+tums3DCjr/C8hz3tjHLUIPFoF1sqPjhCWJbNQIPBQ==","signature_status":"signed_v1","signed_at":"2026-11-13T06:32:16.877037Z","signed_message":"canonical_sha256_bytes"},"source_id":"2611.17074","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f66f01c2de690cbdb179404e85fe8afeae49b3a304d87b067c53775d50087c3a","sha256:e18c54872db823773948a32afdf98288fdf9ea63060eb27189d5c5fbaef586d1"],"state_sha256":"2594448837610c1e4e10940e51ab338a9c507b11cc4317103eb0742c8f5ad668"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1LqB73d1kPl0j8qD2BbKkGvgz8pBDuFe0Hw83DCPF8FkB34+eLh+LOwrRXygDMOPDxCMdARL5Ua7wtkpGpC4Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-11-16T03:41:02.006908Z","bundle_sha256":"6efaa02ba9631970f0079ae27db81a00b3a079b41ab2614141f8eb5fbce998c3"}}