{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KLPROIM6PFPY7YCFBSFDSGFP2B","short_pith_number":"pith:KLPROIM6","canonical_record":{"source":{"id":"1701.05395","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-19T12:44:17Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"d3146f55a851ff655dadd8416440839518071f4f13d2cf1360902d0949fdd29b","abstract_canon_sha256":"76b6ad2d27ef3076f7624d3acfce7697dd7688ea8023792342363fadd8fed4a4"},"schema_version":"1.0"},"canonical_sha256":"52df17219e795f8fe0450c8a3918afd0667d1fc9352b26d0f24e7b209f3556f4","source":{"kind":"arxiv","id":"1701.05395","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05395","created_at":"2026-05-18T00:16:45Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05395v4","created_at":"2026-05-18T00:16:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05395","created_at":"2026-05-18T00:16:45Z"},{"alias_kind":"pith_short_12","alias_value":"KLPROIM6PFPY","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KLPROIM6PFPY7YCF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KLPROIM6","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KLPROIM6PFPY7YCFBSFDSGFP2B","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05395","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-19T12:44:17Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"d3146f55a851ff655dadd8416440839518071f4f13d2cf1360902d0949fdd29b","abstract_canon_sha256":"76b6ad2d27ef3076f7624d3acfce7697dd7688ea8023792342363fadd8fed4a4"},"schema_version":"1.0"},"canonical_sha256":"52df17219e795f8fe0450c8a3918afd0667d1fc9352b26d0f24e7b209f3556f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:45.560157Z","signature_b64":"8/40KF8ZvJoT6heKJHnXPNDu458toQoGtM+ywN4LEeMiHWNHefh5TR8jJnUWoZvmftn0HdnW0jWLVqBlVzzIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52df17219e795f8fe0450c8a3918afd0667d1fc9352b26d0f24e7b209f3556f4","last_reissued_at":"2026-05-18T00:16:45.559332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:45.559332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05395","source_version":4,"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:16:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XRb+TDEet9P9Z+lCEeQWWVgvBr5FRfwL/zzyKcpXNoX/DUt0nVO3WjJCczq38trKsQVk9UNZBrvJ52qicuV/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:33:57.850690Z"},"content_sha256":"a659416282efbb3b55f3cb82d25ff4220d1a84a9d67424f441c7ee5a402d15dc","schema_version":"1.0","event_id":"sha256:a659416282efbb3b55f3cb82d25ff4220d1a84a9d67424f441c7ee5a402d15dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KLPROIM6PFPY7YCFBSFDSGFP2B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Information Flow Maximization in Probabilistic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Andreas Z\\\"ufle, Christian Frey, Matthias Renz, Tobias Emrich","submitted_at":"2017-01-19T12:44:17Z","abstract_excerpt":"Reliable propagation of information through large networks, e.g., communication networks, social networks or sensor networks is very important in many applications concerning marketing, social networks, and wireless sensor networks. However, social ties of friendship may be obsolete, and communication links may fail, inducing the notion of uncertainty in such networks. In this paper, we address the problem of optimizing information propagation in uncertain networks given a constrained budget of edges. We show that this problem requires to solve two NP-hard subproblems: the computation of expec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05395","kind":"arxiv","version":4},"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:16:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NohsjxpUBFvh9HOoXvFtTmNI/I4ZLsEYAEzbgCZgJhBpa3w2Hn3wURrGX/yG2pEG9xI67ddLOhjnbMuvW7TbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:33:57.851042Z"},"content_sha256":"0148fc291a65ec313925af597212ecfb1b3cfb8c2ded6708522ee0e0be8c321b","schema_version":"1.0","event_id":"sha256:0148fc291a65ec313925af597212ecfb1b3cfb8c2ded6708522ee0e0be8c321b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLPROIM6PFPY7YCFBSFDSGFP2B/bundle.json","state_url":"https://pith.science/pith/KLPROIM6PFPY7YCFBSFDSGFP2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLPROIM6PFPY7YCFBSFDSGFP2B/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-03T05:33:57Z","links":{"resolver":"https://pith.science/pith/KLPROIM6PFPY7YCFBSFDSGFP2B","bundle":"https://pith.science/pith/KLPROIM6PFPY7YCFBSFDSGFP2B/bundle.json","state":"https://pith.science/pith/KLPROIM6PFPY7YCFBSFDSGFP2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLPROIM6PFPY7YCFBSFDSGFP2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KLPROIM6PFPY7YCFBSFDSGFP2B","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":"76b6ad2d27ef3076f7624d3acfce7697dd7688ea8023792342363fadd8fed4a4","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-19T12:44:17Z","title_canon_sha256":"d3146f55a851ff655dadd8416440839518071f4f13d2cf1360902d0949fdd29b"},"schema_version":"1.0","source":{"id":"1701.05395","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05395","created_at":"2026-05-18T00:16:45Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05395v4","created_at":"2026-05-18T00:16:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05395","created_at":"2026-05-18T00:16:45Z"},{"alias_kind":"pith_short_12","alias_value":"KLPROIM6PFPY","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KLPROIM6PFPY7YCF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KLPROIM6","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:0148fc291a65ec313925af597212ecfb1b3cfb8c2ded6708522ee0e0be8c321b","target":"graph","created_at":"2026-05-18T00:16:45Z","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":"Reliable propagation of information through large networks, e.g., communication networks, social networks or sensor networks is very important in many applications concerning marketing, social networks, and wireless sensor networks. However, social ties of friendship may be obsolete, and communication links may fail, inducing the notion of uncertainty in such networks. In this paper, we address the problem of optimizing information propagation in uncertain networks given a constrained budget of edges. We show that this problem requires to solve two NP-hard subproblems: the computation of expec","authors_text":"Andreas Z\\\"ufle, Christian Frey, Matthias Renz, Tobias Emrich","cross_cats":["cs.SI","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-19T12:44:17Z","title":"Efficient Information Flow Maximization in Probabilistic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05395","kind":"arxiv","version":4},"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:a659416282efbb3b55f3cb82d25ff4220d1a84a9d67424f441c7ee5a402d15dc","target":"record","created_at":"2026-05-18T00:16:45Z","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":"76b6ad2d27ef3076f7624d3acfce7697dd7688ea8023792342363fadd8fed4a4","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-19T12:44:17Z","title_canon_sha256":"d3146f55a851ff655dadd8416440839518071f4f13d2cf1360902d0949fdd29b"},"schema_version":"1.0","source":{"id":"1701.05395","kind":"arxiv","version":4}},"canonical_sha256":"52df17219e795f8fe0450c8a3918afd0667d1fc9352b26d0f24e7b209f3556f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52df17219e795f8fe0450c8a3918afd0667d1fc9352b26d0f24e7b209f3556f4","first_computed_at":"2026-05-18T00:16:45.559332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:45.559332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8/40KF8ZvJoT6heKJHnXPNDu458toQoGtM+ywN4LEeMiHWNHefh5TR8jJnUWoZvmftn0HdnW0jWLVqBlVzzIDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:45.560157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05395","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a659416282efbb3b55f3cb82d25ff4220d1a84a9d67424f441c7ee5a402d15dc","sha256:0148fc291a65ec313925af597212ecfb1b3cfb8c2ded6708522ee0e0be8c321b"],"state_sha256":"8b11c9f9df26ce3a088f8fc23f45e0cc34cf92e3455f5fb5c7ea6267a26ff9ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LNS8hCy8RGzIBV/545EmVLdkZ7txm2xFvuGi70ic1G4IfmEStFrTx28hwTypekcIbtLBKQj95BOd7zfRKy1JCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:33:57.853008Z","bundle_sha256":"4add72135f1b0db8ea512ccff4661e2639bea474d8d1f9c4a448e945da9e6257"}}