{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VJ57YQLASNO52G2YIXEWL2HHKA","short_pith_number":"pith:VJ57YQLA","canonical_record":{"source":{"id":"1802.04036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T13:38:54Z","cross_cats_sorted":["cs.SI","math.OC"],"title_canon_sha256":"09206a7369478b77c4e4012788ed83a53f7e7f5126428979ca5995f2952534c5","abstract_canon_sha256":"45e7198c7ae3232a5c58ac9546c283a490924907901d46a5326bd3f8a4a18061"},"schema_version":"1.0"},"canonical_sha256":"aa7bfc4160935ddd1b5845c965e8e75003a09a55eef27e2223bfc491e419225f","source":{"kind":"arxiv","id":"1802.04036","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04036","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04036v1","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04036","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"VJ57YQLASNO5","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VJ57YQLASNO52G2Y","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VJ57YQLA","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VJ57YQLASNO52G2YIXEWL2HHKA","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T13:38:54Z","cross_cats_sorted":["cs.SI","math.OC"],"title_canon_sha256":"09206a7369478b77c4e4012788ed83a53f7e7f5126428979ca5995f2952534c5","abstract_canon_sha256":"45e7198c7ae3232a5c58ac9546c283a490924907901d46a5326bd3f8a4a18061"},"schema_version":"1.0"},"canonical_sha256":"aa7bfc4160935ddd1b5845c965e8e75003a09a55eef27e2223bfc491e419225f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:49.646466Z","signature_b64":"8OKlNGhvg6U5oleITQWoeehVuQHCK2yNNsjdPwzf9IBECqXVQEFJgdj2qJn/ExzywrU+esMXUFte12aFlmOVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa7bfc4160935ddd1b5845c965e8e75003a09a55eef27e2223bfc491e419225f","last_reissued_at":"2026-05-18T00:23:49.645858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:49.645858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04036","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:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qFiORlB5H1y6mzQ4X2+7Np1ae91DsSp09mcSVbnbOyngEWwYa0wJmERq3F7Jl1poimw/EPCBAoVLxvjEubsQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:39:56.348296Z"},"content_sha256":"66eeea3fd712449ce54d127464a5d4639767dd05ae5cdd507b98b386006a4c91","schema_version":"1.0","event_id":"sha256:66eeea3fd712449ce54d127464a5d4639767dd05ae5cdd507b98b386006a4c91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VJ57YQLASNO52G2YIXEWL2HHKA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inferring the time-varying functional connectivity of large-scale computer networks from emitted events","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.OC"],"primary_cat":"cs.LG","authors_text":"Antoine Messager, George Parisis, Istvan Z Kiss, Luc Berthouze, Phil Tee, Robert Harper","submitted_at":"2018-02-12T13:38:54Z","abstract_excerpt":"We consider the problem of inferring the functional connectivity of a large-scale computer network from sparse time series of events emitted by its nodes. We do so under the following three domain-specific constraints: (a) non-stationarity of the functional connectivity due to unknown temporal changes in the network, (b) sparsity of the time-series of events that limits the effectiveness of classical correlation-based analysis, and (c) lack of an explicit model describing how events propagate through the network. Under the assumption that the probability of two nodes being functionally connect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04036","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:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ixj5Eeq47MM+StS7YmOgx02qWQAU4EfzDMFsyOQ3r2hdv3FVnOjDu3IRgkiCdCgm65iIQpB9eZmcNwH2C5l6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:39:56.348671Z"},"content_sha256":"b1556bc9d8520c1ab499b73227cf3ca5d08c322cf7e7096fa9c9613eff5ad9db","schema_version":"1.0","event_id":"sha256:b1556bc9d8520c1ab499b73227cf3ca5d08c322cf7e7096fa9c9613eff5ad9db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJ57YQLASNO52G2YIXEWL2HHKA/bundle.json","state_url":"https://pith.science/pith/VJ57YQLASNO52G2YIXEWL2HHKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJ57YQLASNO52G2YIXEWL2HHKA/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-25T10:39:56Z","links":{"resolver":"https://pith.science/pith/VJ57YQLASNO52G2YIXEWL2HHKA","bundle":"https://pith.science/pith/VJ57YQLASNO52G2YIXEWL2HHKA/bundle.json","state":"https://pith.science/pith/VJ57YQLASNO52G2YIXEWL2HHKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJ57YQLASNO52G2YIXEWL2HHKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VJ57YQLASNO52G2YIXEWL2HHKA","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":"45e7198c7ae3232a5c58ac9546c283a490924907901d46a5326bd3f8a4a18061","cross_cats_sorted":["cs.SI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T13:38:54Z","title_canon_sha256":"09206a7369478b77c4e4012788ed83a53f7e7f5126428979ca5995f2952534c5"},"schema_version":"1.0","source":{"id":"1802.04036","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04036","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04036v1","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04036","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"VJ57YQLASNO5","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VJ57YQLASNO52G2Y","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VJ57YQLA","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:b1556bc9d8520c1ab499b73227cf3ca5d08c322cf7e7096fa9c9613eff5ad9db","target":"graph","created_at":"2026-05-18T00:23:49Z","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 consider the problem of inferring the functional connectivity of a large-scale computer network from sparse time series of events emitted by its nodes. We do so under the following three domain-specific constraints: (a) non-stationarity of the functional connectivity due to unknown temporal changes in the network, (b) sparsity of the time-series of events that limits the effectiveness of classical correlation-based analysis, and (c) lack of an explicit model describing how events propagate through the network. Under the assumption that the probability of two nodes being functionally connect","authors_text":"Antoine Messager, George Parisis, Istvan Z Kiss, Luc Berthouze, Phil Tee, Robert Harper","cross_cats":["cs.SI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T13:38:54Z","title":"Inferring the time-varying functional connectivity of large-scale computer networks from emitted events"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04036","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:66eeea3fd712449ce54d127464a5d4639767dd05ae5cdd507b98b386006a4c91","target":"record","created_at":"2026-05-18T00:23:49Z","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":"45e7198c7ae3232a5c58ac9546c283a490924907901d46a5326bd3f8a4a18061","cross_cats_sorted":["cs.SI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T13:38:54Z","title_canon_sha256":"09206a7369478b77c4e4012788ed83a53f7e7f5126428979ca5995f2952534c5"},"schema_version":"1.0","source":{"id":"1802.04036","kind":"arxiv","version":1}},"canonical_sha256":"aa7bfc4160935ddd1b5845c965e8e75003a09a55eef27e2223bfc491e419225f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa7bfc4160935ddd1b5845c965e8e75003a09a55eef27e2223bfc491e419225f","first_computed_at":"2026-05-18T00:23:49.645858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:49.645858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8OKlNGhvg6U5oleITQWoeehVuQHCK2yNNsjdPwzf9IBECqXVQEFJgdj2qJn/ExzywrU+esMXUFte12aFlmOVAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:49.646466Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04036","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66eeea3fd712449ce54d127464a5d4639767dd05ae5cdd507b98b386006a4c91","sha256:b1556bc9d8520c1ab499b73227cf3ca5d08c322cf7e7096fa9c9613eff5ad9db"],"state_sha256":"584cfbcfa954702e6666adb0cd757d47786d3a1adae12dda2ca971eaa1590f0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"esL+jNyIadZfZQLCaYFE2nTvS6/1k7QaPJJZ9vb4IQ9+5lbpFY7HgP+xxSFu+kQ4c6HNjI8Vlkt5Gjy3SB+oDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:39:56.351115Z","bundle_sha256":"9efa3c03639a0f32da88d2658aadd98e5a3cd4f28ce0bbdb67728f8b3091066b"}}