{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DVQGPLQJXM7ITHF43UGWLGIOOS","short_pith_number":"pith:DVQGPLQJ","canonical_record":{"source":{"id":"1707.08418","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-26T13:04:42Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"194c55f22325b599ec0d12b0d991c938c8ba1cb12b5320d5457b2e11629cdc8d","abstract_canon_sha256":"72907e2532f59234a36f8407136aad24a66980fea303ab7ba665df1cf18905c9"},"schema_version":"1.0"},"canonical_sha256":"1d6067ae09bb3e899cbcdd0d65990e74ad230f29ace795ecacecc7384339c175","source":{"kind":"arxiv","id":"1707.08418","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08418","created_at":"2026-05-18T00:36:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08418v2","created_at":"2026-05-18T00:36:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08418","created_at":"2026-05-18T00:36:02Z"},{"alias_kind":"pith_short_12","alias_value":"DVQGPLQJXM7I","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DVQGPLQJXM7ITHF4","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DVQGPLQJ","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DVQGPLQJXM7ITHF43UGWLGIOOS","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08418","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-26T13:04:42Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"194c55f22325b599ec0d12b0d991c938c8ba1cb12b5320d5457b2e11629cdc8d","abstract_canon_sha256":"72907e2532f59234a36f8407136aad24a66980fea303ab7ba665df1cf18905c9"},"schema_version":"1.0"},"canonical_sha256":"1d6067ae09bb3e899cbcdd0d65990e74ad230f29ace795ecacecc7384339c175","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:02.853242Z","signature_b64":"+/qmmHIz+77EFB2P5k3PxPc3ZK/AfVknEocysQgxQb0Nne+f79Fcc8wTVbhUIpeaYpP9tNmPCSaJWubXi+YjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d6067ae09bb3e899cbcdd0d65990e74ad230f29ace795ecacecc7384339c175","last_reissued_at":"2026-05-18T00:36:02.852721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:02.852721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08418","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:36:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0r8wpHdrH8TFllwZX7R3oRA49tDUb4gAhnEfpcV+XObutg8n1l04jU51hpBrU2R+JI+ypddAmQe024vltzkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:05:31.370897Z"},"content_sha256":"550aaf57447372f3893664159129c3c525638aeff13f4923f43d142d36d5d7dc","schema_version":"1.0","event_id":"sha256:550aaf57447372f3893664159129c3c525638aeff13f4923f43d142d36d5d7dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DVQGPLQJXM7ITHF43UGWLGIOOS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Advantage of Evidential Attributes in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.AI","authors_text":"Arnaud Martin (DRUID), Boutheina Ben Yaghlane (LARODEC), DRUID), Kuang Zhou (NPU), Mouloud Kharoune (DRUID), Salma Ben Dhaou (LARODEC","submitted_at":"2017-07-26T13:04:42Z","abstract_excerpt":"Nowadays, there are many approaches designed for the task of detecting communities in social networks. Among them, some methods only consider the topological graph structure, while others take use of both the graph structure and the node attributes. In real-world networks, there are many uncertain and noisy attributes in the graph. In this paper, we will present how we detect communities in graphs with uncertain attributes in the first step. The numerical, probabilistic as well as evidential attributes are generated according to the graph structure. In the second step, some noise will be added"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08418","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:36:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q3Bex8XJjQIX6LUJ2iC/uZg3L8P+991CakGOvqiWktrkdOPvIggbC1l6fXirjY1VOFS+eR8V1EXXIXP6HHKWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:05:31.371288Z"},"content_sha256":"f4974e563933ccb97d731740984b8f1ced829077e53397718a2bf256c1f2eff4","schema_version":"1.0","event_id":"sha256:f4974e563933ccb97d731740984b8f1ced829077e53397718a2bf256c1f2eff4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVQGPLQJXM7ITHF43UGWLGIOOS/bundle.json","state_url":"https://pith.science/pith/DVQGPLQJXM7ITHF43UGWLGIOOS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVQGPLQJXM7ITHF43UGWLGIOOS/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-30T23:05:31Z","links":{"resolver":"https://pith.science/pith/DVQGPLQJXM7ITHF43UGWLGIOOS","bundle":"https://pith.science/pith/DVQGPLQJXM7ITHF43UGWLGIOOS/bundle.json","state":"https://pith.science/pith/DVQGPLQJXM7ITHF43UGWLGIOOS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVQGPLQJXM7ITHF43UGWLGIOOS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DVQGPLQJXM7ITHF43UGWLGIOOS","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":"72907e2532f59234a36f8407136aad24a66980fea303ab7ba665df1cf18905c9","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-26T13:04:42Z","title_canon_sha256":"194c55f22325b599ec0d12b0d991c938c8ba1cb12b5320d5457b2e11629cdc8d"},"schema_version":"1.0","source":{"id":"1707.08418","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08418","created_at":"2026-05-18T00:36:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08418v2","created_at":"2026-05-18T00:36:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08418","created_at":"2026-05-18T00:36:02Z"},{"alias_kind":"pith_short_12","alias_value":"DVQGPLQJXM7I","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DVQGPLQJXM7ITHF4","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DVQGPLQJ","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:f4974e563933ccb97d731740984b8f1ced829077e53397718a2bf256c1f2eff4","target":"graph","created_at":"2026-05-18T00:36:02Z","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":"Nowadays, there are many approaches designed for the task of detecting communities in social networks. Among them, some methods only consider the topological graph structure, while others take use of both the graph structure and the node attributes. In real-world networks, there are many uncertain and noisy attributes in the graph. In this paper, we will present how we detect communities in graphs with uncertain attributes in the first step. The numerical, probabilistic as well as evidential attributes are generated according to the graph structure. In the second step, some noise will be added","authors_text":"Arnaud Martin (DRUID), Boutheina Ben Yaghlane (LARODEC), DRUID), Kuang Zhou (NPU), Mouloud Kharoune (DRUID), Salma Ben Dhaou (LARODEC","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-26T13:04:42Z","title":"The Advantage of Evidential Attributes in Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08418","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:550aaf57447372f3893664159129c3c525638aeff13f4923f43d142d36d5d7dc","target":"record","created_at":"2026-05-18T00:36:02Z","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":"72907e2532f59234a36f8407136aad24a66980fea303ab7ba665df1cf18905c9","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-26T13:04:42Z","title_canon_sha256":"194c55f22325b599ec0d12b0d991c938c8ba1cb12b5320d5457b2e11629cdc8d"},"schema_version":"1.0","source":{"id":"1707.08418","kind":"arxiv","version":2}},"canonical_sha256":"1d6067ae09bb3e899cbcdd0d65990e74ad230f29ace795ecacecc7384339c175","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d6067ae09bb3e899cbcdd0d65990e74ad230f29ace795ecacecc7384339c175","first_computed_at":"2026-05-18T00:36:02.852721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:02.852721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+/qmmHIz+77EFB2P5k3PxPc3ZK/AfVknEocysQgxQb0Nne+f79Fcc8wTVbhUIpeaYpP9tNmPCSaJWubXi+YjCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:02.853242Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08418","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:550aaf57447372f3893664159129c3c525638aeff13f4923f43d142d36d5d7dc","sha256:f4974e563933ccb97d731740984b8f1ced829077e53397718a2bf256c1f2eff4"],"state_sha256":"7fb3ea7ac1a7682afa9a6e9a1880101844909f857a459aa38dbd2e4edd216982"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"193DynisVAmJnKiVBLAqD1mc2cuzZfKTqr4FEMLIxgTXyXnHOTIibaOXLK2zCJMR+6ToqyOEM2YFyhPK3brMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:05:31.373374Z","bundle_sha256":"9314610db657fc2c26e6f2de4c92a2fd8d67a9ba943c296b874b8423f47df456"}}