{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GCCLVU3VY4B5GYADQEIWJRUSMF","short_pith_number":"pith:GCCLVU3V","schema_version":"1.0","canonical_sha256":"3084bad375c703d36003811164c6926143c4b9827f46231894578625b29cd2ca","source":{"kind":"arxiv","id":"1302.5455","version":2},"attestation_state":"computed","paper":{"title":"Seeding Influential Nodes in Non-Submodular Models of Information Diffusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Ameya Hate, Elliot Anshelevich, Malik Magdon-Ismail","submitted_at":"2013-02-22T00:10:55Z","abstract_excerpt":"We consider the model of information diffusion in social networks from \\cite{Hui2010a} which incorporates trust (weighted links) between actors, and allows actors to actively participate in the spreading process, specifically through the ability to query friends for additional information. This model captures how social agents transmit and act upon information more realistically as compared to the simpler threshold and cascade models. However, it is more difficult to analyze, in particular with respect to seeding strategies. We present efficient, scalable algorithms for determining good seed s"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1302.5455","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-02-22T00:10:55Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"43b8e902b84310760e9fc206a3b6786ad39356effa81b166403fac36e7b0fae9","abstract_canon_sha256":"28412e7271fa5ab86764e9d9a4d4b8198705becc47671479ba0c90378f51c4f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:31.011194Z","signature_b64":"ykhImt3I+qX2o4EcfAx4Ad+gQLK0cLsvVXMm+YdvhPWv4BpGMFSUIrCt9Nnn2UHbr4Y05e565jw9ULKBRaqcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3084bad375c703d36003811164c6926143c4b9827f46231894578625b29cd2ca","last_reissued_at":"2026-05-18T03:32:31.010439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:31.010439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Seeding Influential Nodes in Non-Submodular Models of Information Diffusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Ameya Hate, Elliot Anshelevich, Malik Magdon-Ismail","submitted_at":"2013-02-22T00:10:55Z","abstract_excerpt":"We consider the model of information diffusion in social networks from \\cite{Hui2010a} which incorporates trust (weighted links) between actors, and allows actors to actively participate in the spreading process, specifically through the ability to query friends for additional information. This model captures how social agents transmit and act upon information more realistically as compared to the simpler threshold and cascade models. However, it is more difficult to analyze, in particular with respect to seeding strategies. We present efficient, scalable algorithms for determining good seed s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5455","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.5455","created_at":"2026-05-18T03:32:31.010568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.5455v2","created_at":"2026-05-18T03:32:31.010568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5455","created_at":"2026-05-18T03:32:31.010568+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCCLVU3VY4B5","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCCLVU3VY4B5GYAD","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCCLVU3V","created_at":"2026-05-18T12:27:45.050594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GCCLVU3VY4B5GYADQEIWJRUSMF","json":"https://pith.science/pith/GCCLVU3VY4B5GYADQEIWJRUSMF.json","graph_json":"https://pith.science/api/pith-number/GCCLVU3VY4B5GYADQEIWJRUSMF/graph.json","events_json":"https://pith.science/api/pith-number/GCCLVU3VY4B5GYADQEIWJRUSMF/events.json","paper":"https://pith.science/paper/GCCLVU3V"},"agent_actions":{"view_html":"https://pith.science/pith/GCCLVU3VY4B5GYADQEIWJRUSMF","download_json":"https://pith.science/pith/GCCLVU3VY4B5GYADQEIWJRUSMF.json","view_paper":"https://pith.science/paper/GCCLVU3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.5455&json=true","fetch_graph":"https://pith.science/api/pith-number/GCCLVU3VY4B5GYADQEIWJRUSMF/graph.json","fetch_events":"https://pith.science/api/pith-number/GCCLVU3VY4B5GYADQEIWJRUSMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCCLVU3VY4B5GYADQEIWJRUSMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCCLVU3VY4B5GYADQEIWJRUSMF/action/storage_attestation","attest_author":"https://pith.science/pith/GCCLVU3VY4B5GYADQEIWJRUSMF/action/author_attestation","sign_citation":"https://pith.science/pith/GCCLVU3VY4B5GYADQEIWJRUSMF/action/citation_signature","submit_replication":"https://pith.science/pith/GCCLVU3VY4B5GYADQEIWJRUSMF/action/replication_record"}},"created_at":"2026-05-18T03:32:31.010568+00:00","updated_at":"2026-05-18T03:32:31.010568+00:00"}