{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:43ISKW62M7O72XIRHJFUWAPVIU","short_pith_number":"pith:43ISKW62","canonical_record":{"source":{"id":"2301.10646","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2023-01-25T15:33:09Z","cross_cats_sorted":[],"title_canon_sha256":"31e146a468ba691f6085ba82659238a2d83c46e5c5b2f0bdab0b25aa621fecc9","abstract_canon_sha256":"0f4c660dc2253c56173c0b801cbf31c4eef19e21ae5e017db17fc8b2e0379204"},"schema_version":"1.0"},"canonical_sha256":"e6d1255bda67ddfd5d113a4b4b01f5451877b4a0ee7b536910b601b09d8d33d4","source":{"kind":"arxiv","id":"2301.10646","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.10646","created_at":"2026-07-05T05:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"2301.10646v1","created_at":"2026-07-05T05:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.10646","created_at":"2026-07-05T05:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"43ISKW62M7O7","created_at":"2026-07-05T05:38:22Z"},{"alias_kind":"pith_short_16","alias_value":"43ISKW62M7O72XIR","created_at":"2026-07-05T05:38:22Z"},{"alias_kind":"pith_short_8","alias_value":"43ISKW62","created_at":"2026-07-05T05:38:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:43ISKW62M7O72XIRHJFUWAPVIU","target":"record","payload":{"canonical_record":{"source":{"id":"2301.10646","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2023-01-25T15:33:09Z","cross_cats_sorted":[],"title_canon_sha256":"31e146a468ba691f6085ba82659238a2d83c46e5c5b2f0bdab0b25aa621fecc9","abstract_canon_sha256":"0f4c660dc2253c56173c0b801cbf31c4eef19e21ae5e017db17fc8b2e0379204"},"schema_version":"1.0"},"canonical_sha256":"e6d1255bda67ddfd5d113a4b4b01f5451877b4a0ee7b536910b601b09d8d33d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:22.722108Z","signature_b64":"5q1IDQrWEoYYK2LAzRpVMZ9WA0r/2haoPIrzrpEK/HXlFLjxfF8arz/KKTtt6dpbhR8jSdn6bdKBsTutKtkkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6d1255bda67ddfd5d113a4b4b01f5451877b4a0ee7b536910b601b09d8d33d4","last_reissued_at":"2026-07-05T05:38:22.721719Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:22.721719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.10646","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-07-05T05:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Ifp6NXz05Uemmy5S/8uB+quMbCXHWvyLdJHKPbo5mrS7SIZMYnozShbHZKgybkNva8rzLALPu1ZpqyUb8noDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:06:22.552848Z"},"content_sha256":"5a72354a677c76530b9dd71ee80b9e3849043cacc15058c2249a63966c000967","schema_version":"1.0","event_id":"sha256:5a72354a677c76530b9dd71ee80b9e3849043cacc15058c2249a63966c000967"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:43ISKW62M7O72XIRHJFUWAPVIU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Expectation-Maximisation for inference of social graphs explaining online user-user interactions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Anastasios Giovanidis, Effrosyni Papanastasiou","submitted_at":"2023-01-25T15:33:09Z","abstract_excerpt":"Current network inference algorithms fail to generate graphs with edges that can explain whole sequences of node interactions in a given dataset or trace. To quantify how well an inferred graph can explain a trace, we introduce feasibility, a novel quality criterion, and suggest that it is linked to the result's accuracy. In addition, we propose CEM-*, a network inference method that guarantees 100% feasibility given online social media traces, which is a non-trivial extension of the Expectation-Maximization algorithm developed by Newman (2018). We propose a set of linear optimization updates "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.10646","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/2301.10646/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KOkfKrsCmQNOAVO8etr+kTS1dEtKcTYsP3nfHliF8WuKU5BSNZTHrmOompE+MDh0IWB2qsMPQV9vYsCsEZvRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:06:22.553816Z"},"content_sha256":"66148f04448ec9c60e777942307b91c8d275fd61dca93ecb6f76b3af7dbf8b19","schema_version":"1.0","event_id":"sha256:66148f04448ec9c60e777942307b91c8d275fd61dca93ecb6f76b3af7dbf8b19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43ISKW62M7O72XIRHJFUWAPVIU/bundle.json","state_url":"https://pith.science/pith/43ISKW62M7O72XIRHJFUWAPVIU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43ISKW62M7O72XIRHJFUWAPVIU/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-08-18T17:06:22Z","links":{"resolver":"https://pith.science/pith/43ISKW62M7O72XIRHJFUWAPVIU","bundle":"https://pith.science/pith/43ISKW62M7O72XIRHJFUWAPVIU/bundle.json","state":"https://pith.science/pith/43ISKW62M7O72XIRHJFUWAPVIU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43ISKW62M7O72XIRHJFUWAPVIU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:43ISKW62M7O72XIRHJFUWAPVIU","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":"0f4c660dc2253c56173c0b801cbf31c4eef19e21ae5e017db17fc8b2e0379204","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2023-01-25T15:33:09Z","title_canon_sha256":"31e146a468ba691f6085ba82659238a2d83c46e5c5b2f0bdab0b25aa621fecc9"},"schema_version":"1.0","source":{"id":"2301.10646","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.10646","created_at":"2026-07-05T05:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"2301.10646v1","created_at":"2026-07-05T05:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.10646","created_at":"2026-07-05T05:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"43ISKW62M7O7","created_at":"2026-07-05T05:38:22Z"},{"alias_kind":"pith_short_16","alias_value":"43ISKW62M7O72XIR","created_at":"2026-07-05T05:38:22Z"},{"alias_kind":"pith_short_8","alias_value":"43ISKW62","created_at":"2026-07-05T05:38:22Z"}],"graph_snapshots":[{"event_id":"sha256:66148f04448ec9c60e777942307b91c8d275fd61dca93ecb6f76b3af7dbf8b19","target":"graph","created_at":"2026-07-05T05:38:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.10646/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Current network inference algorithms fail to generate graphs with edges that can explain whole sequences of node interactions in a given dataset or trace. To quantify how well an inferred graph can explain a trace, we introduce feasibility, a novel quality criterion, and suggest that it is linked to the result's accuracy. In addition, we propose CEM-*, a network inference method that guarantees 100% feasibility given online social media traces, which is a non-trivial extension of the Expectation-Maximization algorithm developed by Newman (2018). We propose a set of linear optimization updates ","authors_text":"Anastasios Giovanidis, Effrosyni Papanastasiou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2023-01-25T15:33:09Z","title":"Constrained Expectation-Maximisation for inference of social graphs explaining online user-user interactions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.10646","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:5a72354a677c76530b9dd71ee80b9e3849043cacc15058c2249a63966c000967","target":"record","created_at":"2026-07-05T05:38:22Z","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":"0f4c660dc2253c56173c0b801cbf31c4eef19e21ae5e017db17fc8b2e0379204","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2023-01-25T15:33:09Z","title_canon_sha256":"31e146a468ba691f6085ba82659238a2d83c46e5c5b2f0bdab0b25aa621fecc9"},"schema_version":"1.0","source":{"id":"2301.10646","kind":"arxiv","version":1}},"canonical_sha256":"e6d1255bda67ddfd5d113a4b4b01f5451877b4a0ee7b536910b601b09d8d33d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6d1255bda67ddfd5d113a4b4b01f5451877b4a0ee7b536910b601b09d8d33d4","first_computed_at":"2026-07-05T05:38:22.721719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:38:22.721719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5q1IDQrWEoYYK2LAzRpVMZ9WA0r/2haoPIrzrpEK/HXlFLjxfF8arz/KKTtt6dpbhR8jSdn6bdKBsTutKtkkAw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:38:22.722108Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.10646","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a72354a677c76530b9dd71ee80b9e3849043cacc15058c2249a63966c000967","sha256:66148f04448ec9c60e777942307b91c8d275fd61dca93ecb6f76b3af7dbf8b19"],"state_sha256":"a7c503cb4adc21ce64563f800cc1187118a9b30fae6b27d7f224ccaa061a9be4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CdwO805dDUtxlFdtKP88aoUcu+fWRUGbbPVZpAZQbmsCzulqUVyPc+McdsKVFASzckJBFGsZ7KX/kv5fnKqRAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T17:06:22.559325Z","bundle_sha256":"955b388d968d7e0296e22684328ff4490ca31e67400ad24423f36464a65286b4"}}