{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZVLWY74KGMGELUCAGGISZZ4RNN","short_pith_number":"pith:ZVLWY74K","canonical_record":{"source":{"id":"1707.02780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-10T09:44:50Z","cross_cats_sorted":[],"title_canon_sha256":"384fe2730f702c0de7cb11baf081eda73ae89b4eaa67d3cfda31dd05c5872fec","abstract_canon_sha256":"13e136cc9344cc5db8423f3e728aae94032a262721182a2dfacde4845579fd08"},"schema_version":"1.0"},"canonical_sha256":"cd576c7f8a330c45d04031912ce7916b7453206284df5d86090caf396497a12b","source":{"kind":"arxiv","id":"1707.02780","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02780","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02780v1","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02780","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"pith_short_12","alias_value":"ZVLWY74KGMGE","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZVLWY74KGMGELUCA","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZVLWY74K","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZVLWY74KGMGELUCAGGISZZ4RNN","target":"record","payload":{"canonical_record":{"source":{"id":"1707.02780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-10T09:44:50Z","cross_cats_sorted":[],"title_canon_sha256":"384fe2730f702c0de7cb11baf081eda73ae89b4eaa67d3cfda31dd05c5872fec","abstract_canon_sha256":"13e136cc9344cc5db8423f3e728aae94032a262721182a2dfacde4845579fd08"},"schema_version":"1.0"},"canonical_sha256":"cd576c7f8a330c45d04031912ce7916b7453206284df5d86090caf396497a12b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:35.786457Z","signature_b64":"c09Iqra9e0lvMdNpmfbIC27BNs9aP68/BHmMhqsNNMJT+CVhxUzwNKGGIBMHiaasPvJoirrgQGMaFSI4gRVrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd576c7f8a330c45d04031912ce7916b7453206284df5d86090caf396497a12b","last_reissued_at":"2026-05-18T00:40:35.785909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:35.785909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.02780","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:40:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qFNfS3ewVSNoJXRqqJyjGReALeAmcmjSbqBXPo7MVND1qU/Enm+6FMfqw0w/5RmSHffWKKFoUFZf0liUY033Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:27:13.030282Z"},"content_sha256":"79f1a88af3e8ac27887586316a15fc9c56a1a0e8857586e8d1bd3b5ac6237981","schema_version":"1.0","event_id":"sha256:79f1a88af3e8ac27887586316a15fc9c56a1a0e8857586e8d1bd3b5ac6237981"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZVLWY74KGMGELUCAGGISZZ4RNN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Block modelling in dynamic networks with non-homogeneous Poisson processes and exact ICL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Fabrice Rossi (SAMM), Marco Corneli (SAMM), Pierre Latouche (SAMM)","submitted_at":"2017-07-10T09:44:50Z","abstract_excerpt":"We develop a model in which interactions between nodes of a dynamic network are counted by non homogeneous Poisson processes. In a block modelling perspective, nodes belong to hidden clusters (whose number is unknown) and the intensity functions of the counting processes only depend on the clusters of nodes. In order to make inference tractable we move to discrete time by partitioning the entire time horizon in which interactions are observed in fixed-length time sub-intervals. First, we derive an exact integrated classification likelihood criterion and maximize it relying on a greedy search a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02780","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:40:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zf4QMAoj5J2h3/Jiq+4thET4K1Y6gNJfCf3a/RLqdT8KotQkx8rT3uoTsx9NE/VIjX51YNwSTnRnP/X9/ygRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:27:13.030649Z"},"content_sha256":"9e558595a78b498f09751c39c1e2cb5aad063bbada83473e669819f5b48ec001","schema_version":"1.0","event_id":"sha256:9e558595a78b498f09751c39c1e2cb5aad063bbada83473e669819f5b48ec001"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZVLWY74KGMGELUCAGGISZZ4RNN/bundle.json","state_url":"https://pith.science/pith/ZVLWY74KGMGELUCAGGISZZ4RNN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZVLWY74KGMGELUCAGGISZZ4RNN/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-05T01:27:13Z","links":{"resolver":"https://pith.science/pith/ZVLWY74KGMGELUCAGGISZZ4RNN","bundle":"https://pith.science/pith/ZVLWY74KGMGELUCAGGISZZ4RNN/bundle.json","state":"https://pith.science/pith/ZVLWY74KGMGELUCAGGISZZ4RNN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZVLWY74KGMGELUCAGGISZZ4RNN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZVLWY74KGMGELUCAGGISZZ4RNN","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":"13e136cc9344cc5db8423f3e728aae94032a262721182a2dfacde4845579fd08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-10T09:44:50Z","title_canon_sha256":"384fe2730f702c0de7cb11baf081eda73ae89b4eaa67d3cfda31dd05c5872fec"},"schema_version":"1.0","source":{"id":"1707.02780","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02780","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02780v1","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02780","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"pith_short_12","alias_value":"ZVLWY74KGMGE","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZVLWY74KGMGELUCA","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZVLWY74K","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:9e558595a78b498f09751c39c1e2cb5aad063bbada83473e669819f5b48ec001","target":"graph","created_at":"2026-05-18T00:40:35Z","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 develop a model in which interactions between nodes of a dynamic network are counted by non homogeneous Poisson processes. In a block modelling perspective, nodes belong to hidden clusters (whose number is unknown) and the intensity functions of the counting processes only depend on the clusters of nodes. In order to make inference tractable we move to discrete time by partitioning the entire time horizon in which interactions are observed in fixed-length time sub-intervals. First, we derive an exact integrated classification likelihood criterion and maximize it relying on a greedy search a","authors_text":"Fabrice Rossi (SAMM), Marco Corneli (SAMM), Pierre Latouche (SAMM)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-10T09:44:50Z","title":"Block modelling in dynamic networks with non-homogeneous Poisson processes and exact ICL"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02780","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:79f1a88af3e8ac27887586316a15fc9c56a1a0e8857586e8d1bd3b5ac6237981","target":"record","created_at":"2026-05-18T00:40:35Z","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":"13e136cc9344cc5db8423f3e728aae94032a262721182a2dfacde4845579fd08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-10T09:44:50Z","title_canon_sha256":"384fe2730f702c0de7cb11baf081eda73ae89b4eaa67d3cfda31dd05c5872fec"},"schema_version":"1.0","source":{"id":"1707.02780","kind":"arxiv","version":1}},"canonical_sha256":"cd576c7f8a330c45d04031912ce7916b7453206284df5d86090caf396497a12b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd576c7f8a330c45d04031912ce7916b7453206284df5d86090caf396497a12b","first_computed_at":"2026-05-18T00:40:35.785909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:35.785909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c09Iqra9e0lvMdNpmfbIC27BNs9aP68/BHmMhqsNNMJT+CVhxUzwNKGGIBMHiaasPvJoirrgQGMaFSI4gRVrAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:35.786457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02780","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79f1a88af3e8ac27887586316a15fc9c56a1a0e8857586e8d1bd3b5ac6237981","sha256:9e558595a78b498f09751c39c1e2cb5aad063bbada83473e669819f5b48ec001"],"state_sha256":"b0c07a81ae14fbd7daff472ddbb7f1190e9b2ec32dff325d9756c1beac3c7224"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"snH6G4qNxKgwUiFtHaTIuuP3Vxr6aJXem74MU5nWnmnWZvue6xP2pwAHP9DHAuacRRjerCp9EU9ZX8xEW3VHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:27:13.033000Z","bundle_sha256":"3b73b87f0c637928fdafc1a1768efb81383de38c6d8e3fd2516f9c032f7096ae"}}