{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RGGGTCYPZJEJNP2P2WIFOXTZZP","short_pith_number":"pith:RGGGTCYP","schema_version":"1.0","canonical_sha256":"898c698b0fca4896bf4fd590575e79cbfc784e1960f78732de9f79245dbfa435","source":{"kind":"arxiv","id":"2412.20936","version":2},"attestation_state":"computed","paper":{"title":"Influence Maximization in Temporal Networks with Persistent and Reactive Behaviors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"cs.SI","authors_text":"Aaqib Zahoor, Iqra Altaf Gillani, Janib ul Bashir","submitted_at":"2024-12-30T13:27:00Z","abstract_excerpt":"Influence maximization in temporal social networks presents unique challenges due to the dynamic interactions that evolve over time. Traditional diffusion models often fall short in capturing the real-world complexities of active-inactive transitions among nodes, obscuring the true behavior of influence spread. In dynamic networks, nodes do not simply transition to an active state once; rather, they can oscillate between active and inactive states, with the potential for reactivation and reinforcement over time. This reactivation allows previously influenced nodes to regain influence potency, "},"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":"2412.20936","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-12-30T13:27:00Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"35bc9db25c0dff13a9d1d77927a5bcf4a6f0f439018524568a0f5b8f240b8d7c","abstract_canon_sha256":"061e5d3161d2fbae942bf28d735e46d59193e15118f800e909523395a94c615a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:41:37.830622Z","signature_b64":"4fHb8SkhIh9cGOkB+VCmBRgw8zd1PMTwS0NCNHlG2JVu7QhXC+cn9fa+BWxHKckUWBIYGj84IAvOqac3PTgECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"898c698b0fca4896bf4fd590575e79cbfc784e1960f78732de9f79245dbfa435","last_reissued_at":"2026-07-05T11:41:37.830156Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:41:37.830156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Influence Maximization in Temporal Networks with Persistent and Reactive Behaviors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"cs.SI","authors_text":"Aaqib Zahoor, Iqra Altaf Gillani, Janib ul Bashir","submitted_at":"2024-12-30T13:27:00Z","abstract_excerpt":"Influence maximization in temporal social networks presents unique challenges due to the dynamic interactions that evolve over time. Traditional diffusion models often fall short in capturing the real-world complexities of active-inactive transitions among nodes, obscuring the true behavior of influence spread. In dynamic networks, nodes do not simply transition to an active state once; rather, they can oscillate between active and inactive states, with the potential for reactivation and reinforcement over time. This reactivation allows previously influenced nodes to regain influence potency, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.20936","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.20936/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.20936","created_at":"2026-07-05T11:41:37.830210+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.20936v2","created_at":"2026-07-05T11:41:37.830210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.20936","created_at":"2026-07-05T11:41:37.830210+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGGGTCYPZJEJ","created_at":"2026-07-05T11:41:37.830210+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGGGTCYPZJEJNP2P","created_at":"2026-07-05T11:41:37.830210+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGGGTCYP","created_at":"2026-07-05T11:41:37.830210+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.22589","citing_title":"Diffusion Models for Influence Maximization on Temporal Networks: A Guide to Make the Best Choice","ref_index":144,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RGGGTCYPZJEJNP2P2WIFOXTZZP","json":"https://pith.science/pith/RGGGTCYPZJEJNP2P2WIFOXTZZP.json","graph_json":"https://pith.science/api/pith-number/RGGGTCYPZJEJNP2P2WIFOXTZZP/graph.json","events_json":"https://pith.science/api/pith-number/RGGGTCYPZJEJNP2P2WIFOXTZZP/events.json","paper":"https://pith.science/paper/RGGGTCYP"},"agent_actions":{"view_html":"https://pith.science/pith/RGGGTCYPZJEJNP2P2WIFOXTZZP","download_json":"https://pith.science/pith/RGGGTCYPZJEJNP2P2WIFOXTZZP.json","view_paper":"https://pith.science/paper/RGGGTCYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.20936&json=true","fetch_graph":"https://pith.science/api/pith-number/RGGGTCYPZJEJNP2P2WIFOXTZZP/graph.json","fetch_events":"https://pith.science/api/pith-number/RGGGTCYPZJEJNP2P2WIFOXTZZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGGGTCYPZJEJNP2P2WIFOXTZZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGGGTCYPZJEJNP2P2WIFOXTZZP/action/storage_attestation","attest_author":"https://pith.science/pith/RGGGTCYPZJEJNP2P2WIFOXTZZP/action/author_attestation","sign_citation":"https://pith.science/pith/RGGGTCYPZJEJNP2P2WIFOXTZZP/action/citation_signature","submit_replication":"https://pith.science/pith/RGGGTCYPZJEJNP2P2WIFOXTZZP/action/replication_record"}},"created_at":"2026-07-05T11:41:37.830210+00:00","updated_at":"2026-07-05T11:41:37.830210+00:00"}