{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:WRHU6RT6JXZC47F6D7RHFQKAL6","short_pith_number":"pith:WRHU6RT6","canonical_record":{"source":{"id":"2206.01394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2022-06-03T05:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"2eb5787d89fe93636b66c7aa9f354da23b71b5c85538bb080613894c572e72ae","abstract_canon_sha256":"afaa25098a67a6f527b0f5ebb9246b847142670ee3cf075e13449048b2ad4ac3"},"schema_version":"1.0"},"canonical_sha256":"b44f4f467e4df22e7cbe1fe272c1405f8e45ed11161a563c7f5ed67d4b0539b0","source":{"kind":"arxiv","id":"2206.01394","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.01394","created_at":"2026-07-05T04:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"2206.01394v1","created_at":"2026-07-05T04:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.01394","created_at":"2026-07-05T04:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"WRHU6RT6JXZC","created_at":"2026-07-05T04:28:47Z"},{"alias_kind":"pith_short_16","alias_value":"WRHU6RT6JXZC47F6","created_at":"2026-07-05T04:28:47Z"},{"alias_kind":"pith_short_8","alias_value":"WRHU6RT6","created_at":"2026-07-05T04:28:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:WRHU6RT6JXZC47F6D7RHFQKAL6","target":"record","payload":{"canonical_record":{"source":{"id":"2206.01394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2022-06-03T05:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"2eb5787d89fe93636b66c7aa9f354da23b71b5c85538bb080613894c572e72ae","abstract_canon_sha256":"afaa25098a67a6f527b0f5ebb9246b847142670ee3cf075e13449048b2ad4ac3"},"schema_version":"1.0"},"canonical_sha256":"b44f4f467e4df22e7cbe1fe272c1405f8e45ed11161a563c7f5ed67d4b0539b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:47.172967Z","signature_b64":"Sb3gg5jlFpElhmp3LX7CWWEp0MLLRVHHvyTDEK9TnKsrwu/OV+bRYg3QyT0CHIfgGeOBXZmifu5UoJwnKnvZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b44f4f467e4df22e7cbe1fe272c1405f8e45ed11161a563c7f5ed67d4b0539b0","last_reissued_at":"2026-07-05T04:28:47.172484Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:47.172484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.01394","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-07-05T04:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tnNqW8+r2F/1ZCwdYMemy8tBCTRTvW7pWJCjDLuM9MD99KZL5lwG02RqT3uQTMX6lhT7JILIB8qNAPb8XyAUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T15:11:48.296009Z"},"content_sha256":"03ee5f2da20da82be68dfaa1ebccbef023dda99228bce4f60e409877d36cbc32","schema_version":"1.0","event_id":"sha256:03ee5f2da20da82be68dfaa1ebccbef023dda99228bce4f60e409877d36cbc32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:WRHU6RT6JXZC47F6D7RHFQKAL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Influence Maximization in Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Chuang Liu, Ming Xie, Xiu-Xiu Zhan, Zi-Ke Zhang","submitted_at":"2022-06-03T05:06:31Z","abstract_excerpt":"Influence maximization in complex networks, i.e., maximizing the size of influenced nodes via selecting K seed nodes for a given spreading process, has attracted great attention in recent years. However, the influence maximization problem in hypergraphs, in which the hyperedges are leveraged to represent the interactions among more than two nodes, is still an open question. In this paper, we propose an adaptive degree-based heuristic algorithm, i.e., Heuristic Degree Discount (HDD), which iteratively selects nodes with low influence overlap as seeds, to solve the influence maximization problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.01394","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.01394/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GymqSsEHdVWKx4JeACm/XPHuZVyCDoNyKqYhBSr7ywxMkE24KjltlX/Mo6SnZo45ne9nvnoCM8+DPlVfMO77CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T15:11:48.297092Z"},"content_sha256":"1cbf12d3de773a49eee5a10f6dac12079a5ef4bb245e1d2f9a6ae83b806c4fa3","schema_version":"1.0","event_id":"sha256:1cbf12d3de773a49eee5a10f6dac12079a5ef4bb245e1d2f9a6ae83b806c4fa3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRHU6RT6JXZC47F6D7RHFQKAL6/bundle.json","state_url":"https://pith.science/pith/WRHU6RT6JXZC47F6D7RHFQKAL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRHU6RT6JXZC47F6D7RHFQKAL6/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-08-12T15:11:48Z","links":{"resolver":"https://pith.science/pith/WRHU6RT6JXZC47F6D7RHFQKAL6","bundle":"https://pith.science/pith/WRHU6RT6JXZC47F6D7RHFQKAL6/bundle.json","state":"https://pith.science/pith/WRHU6RT6JXZC47F6D7RHFQKAL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRHU6RT6JXZC47F6D7RHFQKAL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:WRHU6RT6JXZC47F6D7RHFQKAL6","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":"afaa25098a67a6f527b0f5ebb9246b847142670ee3cf075e13449048b2ad4ac3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2022-06-03T05:06:31Z","title_canon_sha256":"2eb5787d89fe93636b66c7aa9f354da23b71b5c85538bb080613894c572e72ae"},"schema_version":"1.0","source":{"id":"2206.01394","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.01394","created_at":"2026-07-05T04:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"2206.01394v1","created_at":"2026-07-05T04:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.01394","created_at":"2026-07-05T04:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"WRHU6RT6JXZC","created_at":"2026-07-05T04:28:47Z"},{"alias_kind":"pith_short_16","alias_value":"WRHU6RT6JXZC47F6","created_at":"2026-07-05T04:28:47Z"},{"alias_kind":"pith_short_8","alias_value":"WRHU6RT6","created_at":"2026-07-05T04:28:47Z"}],"graph_snapshots":[{"event_id":"sha256:1cbf12d3de773a49eee5a10f6dac12079a5ef4bb245e1d2f9a6ae83b806c4fa3","target":"graph","created_at":"2026-07-05T04:28:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2206.01394/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Influence maximization in complex networks, i.e., maximizing the size of influenced nodes via selecting K seed nodes for a given spreading process, has attracted great attention in recent years. However, the influence maximization problem in hypergraphs, in which the hyperedges are leveraged to represent the interactions among more than two nodes, is still an open question. In this paper, we propose an adaptive degree-based heuristic algorithm, i.e., Heuristic Degree Discount (HDD), which iteratively selects nodes with low influence overlap as seeds, to solve the influence maximization problem","authors_text":"Chuang Liu, Ming Xie, Xiu-Xiu Zhan, Zi-Ke Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2022-06-03T05:06:31Z","title":"Influence Maximization in Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.01394","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:03ee5f2da20da82be68dfaa1ebccbef023dda99228bce4f60e409877d36cbc32","target":"record","created_at":"2026-07-05T04:28:47Z","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":"afaa25098a67a6f527b0f5ebb9246b847142670ee3cf075e13449048b2ad4ac3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2022-06-03T05:06:31Z","title_canon_sha256":"2eb5787d89fe93636b66c7aa9f354da23b71b5c85538bb080613894c572e72ae"},"schema_version":"1.0","source":{"id":"2206.01394","kind":"arxiv","version":1}},"canonical_sha256":"b44f4f467e4df22e7cbe1fe272c1405f8e45ed11161a563c7f5ed67d4b0539b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b44f4f467e4df22e7cbe1fe272c1405f8e45ed11161a563c7f5ed67d4b0539b0","first_computed_at":"2026-07-05T04:28:47.172484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:28:47.172484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sb3gg5jlFpElhmp3LX7CWWEp0MLLRVHHvyTDEK9TnKsrwu/OV+bRYg3QyT0CHIfgGeOBXZmifu5UoJwnKnvZDg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:28:47.172967Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.01394","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03ee5f2da20da82be68dfaa1ebccbef023dda99228bce4f60e409877d36cbc32","sha256:1cbf12d3de773a49eee5a10f6dac12079a5ef4bb245e1d2f9a6ae83b806c4fa3"],"state_sha256":"b916b3834335950ccf5f84581bd5e601dbf498969a8db366509d84c34aef7e01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"37aVUxXttRG//4/Hx57heT2wnI3I3R5QW0YuedkGdNbsg95fr7oPn3R4lDpeVm6YWUnWso84a0J5dJ8jxXIkCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T15:11:48.304177Z","bundle_sha256":"26ab011570bab89e207eec7a681359393433272594d8da95c4f8c6e075d13409"}}