{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:R7OUJVZJR3GBRJQV2NGMX26JUT","short_pith_number":"pith:R7OUJVZJ","canonical_record":{"source":{"id":"1606.08927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-06-29T01:04:29Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"0ebcac9c311db9fd34c828d13460debeef02dbcd63079c9cadce98c3de65a6f8","abstract_canon_sha256":"7c694aeb37155048e3533c3ce1f1678bf529a88e4e2cd9ced952010c4b4c7b08"},"schema_version":"1.0"},"canonical_sha256":"8fdd44d7298ecc18a615d34ccbebc9a4e2cf8b261bf321b9d4846605968785c5","source":{"kind":"arxiv","id":"1606.08927","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08927","created_at":"2026-05-18T01:11:42Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08927v1","created_at":"2026-05-18T01:11:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08927","created_at":"2026-05-18T01:11:42Z"},{"alias_kind":"pith_short_12","alias_value":"R7OUJVZJR3GB","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R7OUJVZJR3GBRJQV","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R7OUJVZJ","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:R7OUJVZJR3GBRJQV2NGMX26JUT","target":"record","payload":{"canonical_record":{"source":{"id":"1606.08927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-06-29T01:04:29Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"0ebcac9c311db9fd34c828d13460debeef02dbcd63079c9cadce98c3de65a6f8","abstract_canon_sha256":"7c694aeb37155048e3533c3ce1f1678bf529a88e4e2cd9ced952010c4b4c7b08"},"schema_version":"1.0"},"canonical_sha256":"8fdd44d7298ecc18a615d34ccbebc9a4e2cf8b261bf321b9d4846605968785c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:42.056256Z","signature_b64":"NmVxb73zotMunazscjqTA23qow3eLCRyHmdUqabCRyBJXcAHs/24Xiu/RIh0GPlfIqIGgJNRifJCUC8/jSicDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fdd44d7298ecc18a615d34ccbebc9a4e2cf8b261bf321b9d4846605968785c5","last_reissued_at":"2026-05-18T01:11:42.055906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:42.055906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.08927","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-18T01:11:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bSJTezWWnzpsLbLpNjX8NA2Bj2smpiXUrW5q0Y8nORacUuwtyyDneJX3fnHWMtUnJDnD0BxXnZ7+bhxPIQhUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:41:29.463887Z"},"content_sha256":"4f2fd288358e555bb84cb842c607474a5b00a1a255e5042963bb052c94cf27b6","schema_version":"1.0","event_id":"sha256:4f2fd288358e555bb84cb842c607474a5b00a1a255e5042963bb052c94cf27b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:R7OUJVZJR3GBRJQV2NGMX26JUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Least Cost Influence Maximization Across Multiple Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Dung T. Nguyen, Huiling Zhang, Huiyuan Zhang, My T. Thai, Soham Das","submitted_at":"2016-06-29T01:04:29Z","abstract_excerpt":"Recently in Online Social Networks (OSNs), the Least Cost Influence (LCI) problem has become one of the central research topics. It aims at identifying a minimum number of seed users who can trigger a wide cascade of information propagation. Most of existing literature investigated the LCI problem only based on an individual network. However, nowadays users often join several OSNs such that information could be spread across different networks simultaneously. Therefore, in order to obtain the best set of seed users, it is crucial to consider the role of overlapping users under this circumstanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08927","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-18T01:11:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wT3UBNIhP0eLpH97LWUDjsU34dq803d2kIn3RniR4JTaV1bFpQsSzo2fBt08W2L5YguXN4U/sHF3UOgNb/sxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:41:29.464244Z"},"content_sha256":"fe99dcb069f94bf3adaee7b96e533ae8f75031f2e9a8198fb7f0f19c4866f1f3","schema_version":"1.0","event_id":"sha256:fe99dcb069f94bf3adaee7b96e533ae8f75031f2e9a8198fb7f0f19c4866f1f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7OUJVZJR3GBRJQV2NGMX26JUT/bundle.json","state_url":"https://pith.science/pith/R7OUJVZJR3GBRJQV2NGMX26JUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7OUJVZJR3GBRJQV2NGMX26JUT/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-03T20:41:29Z","links":{"resolver":"https://pith.science/pith/R7OUJVZJR3GBRJQV2NGMX26JUT","bundle":"https://pith.science/pith/R7OUJVZJR3GBRJQV2NGMX26JUT/bundle.json","state":"https://pith.science/pith/R7OUJVZJR3GBRJQV2NGMX26JUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7OUJVZJR3GBRJQV2NGMX26JUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R7OUJVZJR3GBRJQV2NGMX26JUT","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":"7c694aeb37155048e3533c3ce1f1678bf529a88e4e2cd9ced952010c4b4c7b08","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-06-29T01:04:29Z","title_canon_sha256":"0ebcac9c311db9fd34c828d13460debeef02dbcd63079c9cadce98c3de65a6f8"},"schema_version":"1.0","source":{"id":"1606.08927","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08927","created_at":"2026-05-18T01:11:42Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08927v1","created_at":"2026-05-18T01:11:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08927","created_at":"2026-05-18T01:11:42Z"},{"alias_kind":"pith_short_12","alias_value":"R7OUJVZJR3GB","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R7OUJVZJR3GBRJQV","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R7OUJVZJ","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:fe99dcb069f94bf3adaee7b96e533ae8f75031f2e9a8198fb7f0f19c4866f1f3","target":"graph","created_at":"2026-05-18T01:11:42Z","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":"Recently in Online Social Networks (OSNs), the Least Cost Influence (LCI) problem has become one of the central research topics. It aims at identifying a minimum number of seed users who can trigger a wide cascade of information propagation. Most of existing literature investigated the LCI problem only based on an individual network. However, nowadays users often join several OSNs such that information could be spread across different networks simultaneously. Therefore, in order to obtain the best set of seed users, it is crucial to consider the role of overlapping users under this circumstanc","authors_text":"Dung T. Nguyen, Huiling Zhang, Huiyuan Zhang, My T. Thai, Soham Das","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-06-29T01:04:29Z","title":"Least Cost Influence Maximization Across Multiple Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08927","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:4f2fd288358e555bb84cb842c607474a5b00a1a255e5042963bb052c94cf27b6","target":"record","created_at":"2026-05-18T01:11:42Z","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":"7c694aeb37155048e3533c3ce1f1678bf529a88e4e2cd9ced952010c4b4c7b08","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-06-29T01:04:29Z","title_canon_sha256":"0ebcac9c311db9fd34c828d13460debeef02dbcd63079c9cadce98c3de65a6f8"},"schema_version":"1.0","source":{"id":"1606.08927","kind":"arxiv","version":1}},"canonical_sha256":"8fdd44d7298ecc18a615d34ccbebc9a4e2cf8b261bf321b9d4846605968785c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fdd44d7298ecc18a615d34ccbebc9a4e2cf8b261bf321b9d4846605968785c5","first_computed_at":"2026-05-18T01:11:42.055906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:42.055906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NmVxb73zotMunazscjqTA23qow3eLCRyHmdUqabCRyBJXcAHs/24Xiu/RIh0GPlfIqIGgJNRifJCUC8/jSicDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:42.056256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.08927","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f2fd288358e555bb84cb842c607474a5b00a1a255e5042963bb052c94cf27b6","sha256:fe99dcb069f94bf3adaee7b96e533ae8f75031f2e9a8198fb7f0f19c4866f1f3"],"state_sha256":"2f349c738e5a327d20c6dea7f1933d688756bb7de52a6d3f74eb9dd7c141b094"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XNpklvEgW7xtHfxkleQUvZAG5k016r0Y4Dl9xOqRLPCsHjoeaUCDX0/mBjHNl9HEp/W8B12+ZpHAh3ulAK76BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:41:29.466305Z","bundle_sha256":"cb4fc24056a7ee37a00ce6c839ae0c22e40d30676e62a7258fd31406dc12413e"}}