{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KWKKC3S4TS2MQGB2XRK5QUSAM6","short_pith_number":"pith:KWKKC3S4","canonical_record":{"source":{"id":"1212.4779","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-12-19T18:21:23Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"2255515023e8d7d43f4f070d71160d662ffe3b9e770ccd89a3ff53936dc1aff1","abstract_canon_sha256":"9da81b1208c617250cc207b188fdfd8dfd672f80d62bdb19d63218ffe69dcc1d"},"schema_version":"1.0"},"canonical_sha256":"5594a16e5c9cb4c8183abc55d8524067a301b1080c0da924bfd810b98e321235","source":{"kind":"arxiv","id":"1212.4779","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4779","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4779v3","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4779","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"KWKKC3S4TS2M","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KWKKC3S4TS2MQGB2","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KWKKC3S4","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KWKKC3S4TS2MQGB2XRK5QUSAM6","target":"record","payload":{"canonical_record":{"source":{"id":"1212.4779","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-12-19T18:21:23Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"2255515023e8d7d43f4f070d71160d662ffe3b9e770ccd89a3ff53936dc1aff1","abstract_canon_sha256":"9da81b1208c617250cc207b188fdfd8dfd672f80d62bdb19d63218ffe69dcc1d"},"schema_version":"1.0"},"canonical_sha256":"5594a16e5c9cb4c8183abc55d8524067a301b1080c0da924bfd810b98e321235","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:57.525530Z","signature_b64":"got05TPddO22ODqKpNIcaWmr/N+SbGlKxu5Asws01jH+kzdp25mnvOAoKkJtg3vwCS3/Yd4iOBICorlqfiuyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5594a16e5c9cb4c8183abc55d8524067a301b1080c0da924bfd810b98e321235","last_reissued_at":"2026-05-18T02:58:57.524803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:57.524803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.4779","source_version":3,"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-18T02:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WwwvP5FDrH+X3Zv0KLkXb4X1dTaolg1XmhSR5EgDX/z3GFvVzdiB9RIzuleaOd+QgwRJb4xQ6Ms//9DVqB9/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:48:38.928808Z"},"content_sha256":"2a078eb448e9f110d6e396575323f255bd0798608545852ab92338f7a4e75a76","schema_version":"1.0","event_id":"sha256:2a078eb448e9f110d6e396575323f255bd0798608545852ab92338f7a4e75a76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KWKKC3S4TS2MQGB2XRK5QUSAM6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"StaticGreedy: solving the scalability-accuracy dilemma in influence maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Guoqing Zhang, Huawei Shen, Junming Huang, Suqi Cheng, Xueqi Cheng","submitted_at":"2012-12-19T18:21:23Z","abstract_excerpt":"Influence maximization, defined as a problem of finding a set of seed nodes to trigger a maximized spread of influence, is crucial to viral marketing on social networks. For practical viral marketing on large scale social networks, it is required that influence maximization algorithms should have both guaranteed accuracy and high scalability. However, existing algorithms suffer a scalability-accuracy dilemma: conventional greedy algorithms guarantee the accuracy with expensive computation, while the scalable heuristic algorithms suffer from unstable accuracy.\n  In this paper, we focus on solvi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4779","kind":"arxiv","version":3},"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-18T02:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DY28gi3EQ688a8MccFMtzc0U/eT/s/KxzruKJm8jOZ+1Gpdar5vDBKgYlVT+KuUAygUYECHsH11Vc1BtKaQtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:48:38.929177Z"},"content_sha256":"a6290db5ac4ce4a8d5479663e86514ee7fd5eea334261fa3edb45783f3a4794f","schema_version":"1.0","event_id":"sha256:a6290db5ac4ce4a8d5479663e86514ee7fd5eea334261fa3edb45783f3a4794f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWKKC3S4TS2MQGB2XRK5QUSAM6/bundle.json","state_url":"https://pith.science/pith/KWKKC3S4TS2MQGB2XRK5QUSAM6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWKKC3S4TS2MQGB2XRK5QUSAM6/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-27T22:48:38Z","links":{"resolver":"https://pith.science/pith/KWKKC3S4TS2MQGB2XRK5QUSAM6","bundle":"https://pith.science/pith/KWKKC3S4TS2MQGB2XRK5QUSAM6/bundle.json","state":"https://pith.science/pith/KWKKC3S4TS2MQGB2XRK5QUSAM6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWKKC3S4TS2MQGB2XRK5QUSAM6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KWKKC3S4TS2MQGB2XRK5QUSAM6","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":"9da81b1208c617250cc207b188fdfd8dfd672f80d62bdb19d63218ffe69dcc1d","cross_cats_sorted":["cs.DS","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-12-19T18:21:23Z","title_canon_sha256":"2255515023e8d7d43f4f070d71160d662ffe3b9e770ccd89a3ff53936dc1aff1"},"schema_version":"1.0","source":{"id":"1212.4779","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4779","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4779v3","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4779","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"KWKKC3S4TS2M","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KWKKC3S4TS2MQGB2","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KWKKC3S4","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:a6290db5ac4ce4a8d5479663e86514ee7fd5eea334261fa3edb45783f3a4794f","target":"graph","created_at":"2026-05-18T02:58:57Z","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":"Influence maximization, defined as a problem of finding a set of seed nodes to trigger a maximized spread of influence, is crucial to viral marketing on social networks. For practical viral marketing on large scale social networks, it is required that influence maximization algorithms should have both guaranteed accuracy and high scalability. However, existing algorithms suffer a scalability-accuracy dilemma: conventional greedy algorithms guarantee the accuracy with expensive computation, while the scalable heuristic algorithms suffer from unstable accuracy.\n  In this paper, we focus on solvi","authors_text":"Guoqing Zhang, Huawei Shen, Junming Huang, Suqi Cheng, Xueqi Cheng","cross_cats":["cs.DS","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-12-19T18:21:23Z","title":"StaticGreedy: solving the scalability-accuracy dilemma in influence maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4779","kind":"arxiv","version":3},"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:2a078eb448e9f110d6e396575323f255bd0798608545852ab92338f7a4e75a76","target":"record","created_at":"2026-05-18T02:58:57Z","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":"9da81b1208c617250cc207b188fdfd8dfd672f80d62bdb19d63218ffe69dcc1d","cross_cats_sorted":["cs.DS","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-12-19T18:21:23Z","title_canon_sha256":"2255515023e8d7d43f4f070d71160d662ffe3b9e770ccd89a3ff53936dc1aff1"},"schema_version":"1.0","source":{"id":"1212.4779","kind":"arxiv","version":3}},"canonical_sha256":"5594a16e5c9cb4c8183abc55d8524067a301b1080c0da924bfd810b98e321235","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5594a16e5c9cb4c8183abc55d8524067a301b1080c0da924bfd810b98e321235","first_computed_at":"2026-05-18T02:58:57.524803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:57.524803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"got05TPddO22ODqKpNIcaWmr/N+SbGlKxu5Asws01jH+kzdp25mnvOAoKkJtg3vwCS3/Yd4iOBICorlqfiuyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:57.525530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.4779","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a078eb448e9f110d6e396575323f255bd0798608545852ab92338f7a4e75a76","sha256:a6290db5ac4ce4a8d5479663e86514ee7fd5eea334261fa3edb45783f3a4794f"],"state_sha256":"960350314ef340949c4b081f7f7cb1c02390ed13ef08ea416f1b579a2655fc7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9jjGpa/drcRzJRWwsgwT52AkZiuWvzzraVvfqzZF10Za+HWmU+e2MC7PO+rlT6cBiXyvcFku+Ag1/llbYR+pDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:48:38.931794Z","bundle_sha256":"a885e4f588f52476b6e063a5959a129c77979c262886b5d1b4d20ca6be30199e"}}