{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TK2QXZTZJWTZHKPZTAO6552CIS","short_pith_number":"pith:TK2QXZTZ","canonical_record":{"source":{"id":"1706.00941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-03T12:23:28Z","cross_cats_sorted":[],"title_canon_sha256":"5dbb4555958ce9f4de2b47133ece165d735c9d5090f7560e90a4280b4561f804","abstract_canon_sha256":"313e93154412a1d200c8e492493b2bd1ad253e72a9cb583b406d465d51dfecfc"},"schema_version":"1.0"},"canonical_sha256":"9ab50be6794da793a9f9981deef742448fb081d28e90a4f2d561efd24fe21354","source":{"kind":"arxiv","id":"1706.00941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00941","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00941v1","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00941","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"TK2QXZTZJWTZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TK2QXZTZJWTZHKPZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TK2QXZTZ","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TK2QXZTZJWTZHKPZTAO6552CIS","target":"record","payload":{"canonical_record":{"source":{"id":"1706.00941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-03T12:23:28Z","cross_cats_sorted":[],"title_canon_sha256":"5dbb4555958ce9f4de2b47133ece165d735c9d5090f7560e90a4280b4561f804","abstract_canon_sha256":"313e93154412a1d200c8e492493b2bd1ad253e72a9cb583b406d465d51dfecfc"},"schema_version":"1.0"},"canonical_sha256":"9ab50be6794da793a9f9981deef742448fb081d28e90a4f2d561efd24fe21354","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:07.333406Z","signature_b64":"YH/BSoj9Q/Nw1HCOnBxOq+P+NeRKmO1fjUxkRn0xmXCJZDyM0HO54M58GpcRucHFtTz/ZZzwQzs9zdj6+ZrmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ab50be6794da793a9f9981deef742448fb081d28e90a4f2d561efd24fe21354","last_reissued_at":"2026-05-18T00:43:07.332642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:07.332642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.00941","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:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQgZJqh9jNfEZuFQ3pXza3PQreWzgfZIH/JBknzoaQtUoBggVCRikI0NllwBlvLTxYxxyjPrxJW+S+BG0Lh3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T01:54:34.430727Z"},"content_sha256":"7b6ef3089ca331c9c855e313f4e71117c69e1736bc5b45d4c778de96dd99c630","schema_version":"1.0","event_id":"sha256:7b6ef3089ca331c9c855e313f4e71117c69e1736bc5b45d4c778de96dd99c630"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TK2QXZTZJWTZHKPZTAO6552CIS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DANI: A Fast Diffusion Aware Network Inference Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Arezoo Rajabi, Hamid R. Rabiee, Maryam Ramezani, Maryam Tahani","submitted_at":"2017-06-03T12:23:28Z","abstract_excerpt":"The fast growth of social networks and their privacy requirements in recent years, has lead to increasing difficulty in obtaining complete topology of these networks. However, diffusion information over these networks is available and many algorithms have been proposed to infer the underlying networks by using this information. The previously proposed algorithms only focus on inferring more links and do not pay attention to the important characteristics of the underlying social networks In this paper, we propose a novel algorithm, called DANI, to infer the underlying network structure while pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00941","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:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UcYkh6jkxqw8akzZQKgulT+n8Q0+Wyk/l18ENDiQZyrpLhRWNPxZJhtcjYMZeqOzc7u5nkC9gn5ZKmf4lxepAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T01:54:34.431065Z"},"content_sha256":"ce4d7feead4e1a7b3f6f6131ddceacc4446cd89118a631aeade966adeb9cdcae","schema_version":"1.0","event_id":"sha256:ce4d7feead4e1a7b3f6f6131ddceacc4446cd89118a631aeade966adeb9cdcae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TK2QXZTZJWTZHKPZTAO6552CIS/bundle.json","state_url":"https://pith.science/pith/TK2QXZTZJWTZHKPZTAO6552CIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TK2QXZTZJWTZHKPZTAO6552CIS/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-28T01:54:34Z","links":{"resolver":"https://pith.science/pith/TK2QXZTZJWTZHKPZTAO6552CIS","bundle":"https://pith.science/pith/TK2QXZTZJWTZHKPZTAO6552CIS/bundle.json","state":"https://pith.science/pith/TK2QXZTZJWTZHKPZTAO6552CIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TK2QXZTZJWTZHKPZTAO6552CIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TK2QXZTZJWTZHKPZTAO6552CIS","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":"313e93154412a1d200c8e492493b2bd1ad253e72a9cb583b406d465d51dfecfc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-03T12:23:28Z","title_canon_sha256":"5dbb4555958ce9f4de2b47133ece165d735c9d5090f7560e90a4280b4561f804"},"schema_version":"1.0","source":{"id":"1706.00941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00941","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00941v1","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00941","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"TK2QXZTZJWTZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TK2QXZTZJWTZHKPZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TK2QXZTZ","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:ce4d7feead4e1a7b3f6f6131ddceacc4446cd89118a631aeade966adeb9cdcae","target":"graph","created_at":"2026-05-18T00:43:07Z","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":"The fast growth of social networks and their privacy requirements in recent years, has lead to increasing difficulty in obtaining complete topology of these networks. However, diffusion information over these networks is available and many algorithms have been proposed to infer the underlying networks by using this information. The previously proposed algorithms only focus on inferring more links and do not pay attention to the important characteristics of the underlying social networks In this paper, we propose a novel algorithm, called DANI, to infer the underlying network structure while pr","authors_text":"Arezoo Rajabi, Hamid R. Rabiee, Maryam Ramezani, Maryam Tahani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-03T12:23:28Z","title":"DANI: A Fast Diffusion Aware Network Inference Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00941","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:7b6ef3089ca331c9c855e313f4e71117c69e1736bc5b45d4c778de96dd99c630","target":"record","created_at":"2026-05-18T00:43:07Z","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":"313e93154412a1d200c8e492493b2bd1ad253e72a9cb583b406d465d51dfecfc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-03T12:23:28Z","title_canon_sha256":"5dbb4555958ce9f4de2b47133ece165d735c9d5090f7560e90a4280b4561f804"},"schema_version":"1.0","source":{"id":"1706.00941","kind":"arxiv","version":1}},"canonical_sha256":"9ab50be6794da793a9f9981deef742448fb081d28e90a4f2d561efd24fe21354","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ab50be6794da793a9f9981deef742448fb081d28e90a4f2d561efd24fe21354","first_computed_at":"2026-05-18T00:43:07.332642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:07.332642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YH/BSoj9Q/Nw1HCOnBxOq+P+NeRKmO1fjUxkRn0xmXCJZDyM0HO54M58GpcRucHFtTz/ZZzwQzs9zdj6+ZrmCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:07.333406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.00941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b6ef3089ca331c9c855e313f4e71117c69e1736bc5b45d4c778de96dd99c630","sha256:ce4d7feead4e1a7b3f6f6131ddceacc4446cd89118a631aeade966adeb9cdcae"],"state_sha256":"f0839b4a5b03961f3327a52bfeb3a97a78d16c1a9bfad8d5949e4ae3f974de88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sHfte4nms3zLAjDwLUM+lzD3Uo3U80rJ8OYAVuaQkgvSQeFUypJnYyvGVF5y1EemhiwUH1qaffnwY6TX0mULDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T01:54:34.432976Z","bundle_sha256":"c54ee2db6941f7f1989708459a5fcaeedcdf11c5cf8906053a95049cda323994"}}