{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CRDYZNZI7LW56LJQAWJCSZJAJZ","short_pith_number":"pith:CRDYZNZI","canonical_record":{"source":{"id":"1510.00646","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-10-02T17:13:33Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"7ecfb1596b40c39afe22cca5a0c04564a7463bb94e47ccb219b64973052e2973","abstract_canon_sha256":"c8c0c473a7d991a2b982078e46e599d883507fd6b9a080186da22bbe4d8851c9"},"schema_version":"1.0"},"canonical_sha256":"14478cb728faeddf2d3005922965204e5b79979b1b55c63447b22f158101ce62","source":{"kind":"arxiv","id":"1510.00646","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00646","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00646v2","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00646","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"CRDYZNZI7LW5","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CRDYZNZI7LW56LJQ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CRDYZNZI","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CRDYZNZI7LW56LJQAWJCSZJAJZ","target":"record","payload":{"canonical_record":{"source":{"id":"1510.00646","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-10-02T17:13:33Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"7ecfb1596b40c39afe22cca5a0c04564a7463bb94e47ccb219b64973052e2973","abstract_canon_sha256":"c8c0c473a7d991a2b982078e46e599d883507fd6b9a080186da22bbe4d8851c9"},"schema_version":"1.0"},"canonical_sha256":"14478cb728faeddf2d3005922965204e5b79979b1b55c63447b22f158101ce62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:12.745311Z","signature_b64":"EIxJUddyRSzXNWchwgzgtFdA3PJS83CB8vz5lNeCOmDMGjh0Q34PbVBVBRV9fq1Qqu0nlfN2URonY+q8DHs8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14478cb728faeddf2d3005922965204e5b79979b1b55c63447b22f158101ce62","last_reissued_at":"2026-05-18T00:06:12.744583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:12.744583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.00646","source_version":2,"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:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AkfMIZAbqJK9ormlbqD5ay0UB1d1bZOtKVhSqt1wPsZhF8ObKKoip8fvQgTJu9/a12bRMLvoD9Z0NutzCzasAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:52:58.044141Z"},"content_sha256":"35226d04c2133e1c22d1114ba08bce452890b760cae8d712fbff2190c3cc2359","schema_version":"1.0","event_id":"sha256:35226d04c2133e1c22d1114ba08bce452890b760cae8d712fbff2190c3cc2359"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CRDYZNZI7LW56LJQAWJCSZJAJZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian modeling of networks in complex business intelligence problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.AP","authors_text":"Bruno Scarpa, Daniele Durante, David B. Dunson, Sally Paganin","submitted_at":"2015-10-02T17:13:33Z","abstract_excerpt":"Complex network data problems are increasingly common in many fields of application. Our motivation is drawn from strategic marketing studies monitoring customer choices of specific products, along with co-subscription networks encoding multiple purchasing behavior. Data are available for several agencies within the same insurance company, and our goal is to efficiently exploit co-subscription networks to inform targeted advertising of cross-sell strategies to currently mono-product customers. We address this goal by developing a Bayesian hierarchical model, which clusters agencies according t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00646","kind":"arxiv","version":2},"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:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cJdHAQIPyA3mChOn/Bc93xn1Sp/ASMWhWa+9CnkaWr/8ehl0wL0EA0WTZWdJUt3BX0LA7qXgjQhl0pct5c7zAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:52:58.044511Z"},"content_sha256":"2b8a68a49b61b2aaa37e2756ad6ec438603af958c70ed29aa13b3c09ba6be834","schema_version":"1.0","event_id":"sha256:2b8a68a49b61b2aaa37e2756ad6ec438603af958c70ed29aa13b3c09ba6be834"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CRDYZNZI7LW56LJQAWJCSZJAJZ/bundle.json","state_url":"https://pith.science/pith/CRDYZNZI7LW56LJQAWJCSZJAJZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CRDYZNZI7LW56LJQAWJCSZJAJZ/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-02T19:52:58Z","links":{"resolver":"https://pith.science/pith/CRDYZNZI7LW56LJQAWJCSZJAJZ","bundle":"https://pith.science/pith/CRDYZNZI7LW56LJQAWJCSZJAJZ/bundle.json","state":"https://pith.science/pith/CRDYZNZI7LW56LJQAWJCSZJAJZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CRDYZNZI7LW56LJQAWJCSZJAJZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CRDYZNZI7LW56LJQAWJCSZJAJZ","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":"c8c0c473a7d991a2b982078e46e599d883507fd6b9a080186da22bbe4d8851c9","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-10-02T17:13:33Z","title_canon_sha256":"7ecfb1596b40c39afe22cca5a0c04564a7463bb94e47ccb219b64973052e2973"},"schema_version":"1.0","source":{"id":"1510.00646","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00646","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00646v2","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00646","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"CRDYZNZI7LW5","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CRDYZNZI7LW56LJQ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CRDYZNZI","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:2b8a68a49b61b2aaa37e2756ad6ec438603af958c70ed29aa13b3c09ba6be834","target":"graph","created_at":"2026-05-18T00:06:12Z","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":"Complex network data problems are increasingly common in many fields of application. Our motivation is drawn from strategic marketing studies monitoring customer choices of specific products, along with co-subscription networks encoding multiple purchasing behavior. Data are available for several agencies within the same insurance company, and our goal is to efficiently exploit co-subscription networks to inform targeted advertising of cross-sell strategies to currently mono-product customers. We address this goal by developing a Bayesian hierarchical model, which clusters agencies according t","authors_text":"Bruno Scarpa, Daniele Durante, David B. Dunson, Sally Paganin","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-10-02T17:13:33Z","title":"Bayesian modeling of networks in complex business intelligence problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00646","kind":"arxiv","version":2},"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:35226d04c2133e1c22d1114ba08bce452890b760cae8d712fbff2190c3cc2359","target":"record","created_at":"2026-05-18T00:06:12Z","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":"c8c0c473a7d991a2b982078e46e599d883507fd6b9a080186da22bbe4d8851c9","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-10-02T17:13:33Z","title_canon_sha256":"7ecfb1596b40c39afe22cca5a0c04564a7463bb94e47ccb219b64973052e2973"},"schema_version":"1.0","source":{"id":"1510.00646","kind":"arxiv","version":2}},"canonical_sha256":"14478cb728faeddf2d3005922965204e5b79979b1b55c63447b22f158101ce62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14478cb728faeddf2d3005922965204e5b79979b1b55c63447b22f158101ce62","first_computed_at":"2026-05-18T00:06:12.744583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:12.744583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EIxJUddyRSzXNWchwgzgtFdA3PJS83CB8vz5lNeCOmDMGjh0Q34PbVBVBRV9fq1Qqu0nlfN2URonY+q8DHs8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:12.745311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.00646","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35226d04c2133e1c22d1114ba08bce452890b760cae8d712fbff2190c3cc2359","sha256:2b8a68a49b61b2aaa37e2756ad6ec438603af958c70ed29aa13b3c09ba6be834"],"state_sha256":"65ed3bf222eac82f45b38dcebbcb21d6b929bbe3da96fd28f8bd6e531b0f88e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BjxmV5041p8r8D1D3BeqeLed5CHTzvMEFqFaM50FUOw8gXDVB6YdWLK5RZoUSEBE/hf0rAlToGgn9/qPlKwsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:52:58.047123Z","bundle_sha256":"99cd2989bd148896138b541abb13037394c4e4a65ef470bf38f4a5d6a8899586"}}