{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XGQ73O67YPD7QSR3IGAW3IM3MO","short_pith_number":"pith:XGQ73O67","schema_version":"1.0","canonical_sha256":"b9a1fdbbdfc3c7f84a3b41816da19b63b40239be318bf1c107ae030801256695","source":{"kind":"arxiv","id":"1711.00791","version":1},"attestation_state":"computed","paper":{"title":"Spectral Methods for Immunization of Large Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DM","authors_text":"Imdadullah Khan, Juvaria Tariq, Mudassir Shabbir, Muhammad Ahmad","submitted_at":"2017-11-02T16:01:16Z","abstract_excerpt":"Given a network of nodes, minimizing the spread of a contagion using a limited budget is a well-studied problem with applications in network security, viral marketing, social networks, and public health. In real graphs, virus may infect a node which in turn infects its neighbor nodes and this may trigger an epidemic in the whole graph. The goal thus is to select the best k nodes (budget constraint) that are immunized (vaccinated, screened, filtered) so as the remaining graph is less prone to the epidemic. It is known that the problem is, in all practical models, computationally intractable eve"},"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":"1711.00791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-02T16:01:16Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"fa0a225dc31e9362e405a660df4a5d1361ae14938e7be143a420296f082f794f","abstract_canon_sha256":"2d35a47584352422baad82167bac027448f0bab3e49a968d103ea37c66ad7375"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:29.530364Z","signature_b64":"iWWgqWU0zdgRX2XF8F1eGJP6kQAUPPHyof1e9QZwoS0m1+f+tmhWdNap5M9z1qNOdSlVnrnRJxay8YhssDNCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9a1fdbbdfc3c7f84a3b41816da19b63b40239be318bf1c107ae030801256695","last_reissued_at":"2026-05-18T00:31:29.529848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:29.529848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Methods for Immunization of Large Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DM","authors_text":"Imdadullah Khan, Juvaria Tariq, Mudassir Shabbir, Muhammad Ahmad","submitted_at":"2017-11-02T16:01:16Z","abstract_excerpt":"Given a network of nodes, minimizing the spread of a contagion using a limited budget is a well-studied problem with applications in network security, viral marketing, social networks, and public health. In real graphs, virus may infect a node which in turn infects its neighbor nodes and this may trigger an epidemic in the whole graph. The goal thus is to select the best k nodes (budget constraint) that are immunized (vaccinated, screened, filtered) so as the remaining graph is less prone to the epidemic. It is known that the problem is, in all practical models, computationally intractable eve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00791","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":""},"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":"1711.00791","created_at":"2026-05-18T00:31:29.529916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00791v1","created_at":"2026-05-18T00:31:29.529916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00791","created_at":"2026-05-18T00:31:29.529916+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGQ73O67YPD7","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGQ73O67YPD7QSR3","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGQ73O67","created_at":"2026-05-18T12:31:53.515858+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/XGQ73O67YPD7QSR3IGAW3IM3MO","json":"https://pith.science/pith/XGQ73O67YPD7QSR3IGAW3IM3MO.json","graph_json":"https://pith.science/api/pith-number/XGQ73O67YPD7QSR3IGAW3IM3MO/graph.json","events_json":"https://pith.science/api/pith-number/XGQ73O67YPD7QSR3IGAW3IM3MO/events.json","paper":"https://pith.science/paper/XGQ73O67"},"agent_actions":{"view_html":"https://pith.science/pith/XGQ73O67YPD7QSR3IGAW3IM3MO","download_json":"https://pith.science/pith/XGQ73O67YPD7QSR3IGAW3IM3MO.json","view_paper":"https://pith.science/paper/XGQ73O67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00791&json=true","fetch_graph":"https://pith.science/api/pith-number/XGQ73O67YPD7QSR3IGAW3IM3MO/graph.json","fetch_events":"https://pith.science/api/pith-number/XGQ73O67YPD7QSR3IGAW3IM3MO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGQ73O67YPD7QSR3IGAW3IM3MO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGQ73O67YPD7QSR3IGAW3IM3MO/action/storage_attestation","attest_author":"https://pith.science/pith/XGQ73O67YPD7QSR3IGAW3IM3MO/action/author_attestation","sign_citation":"https://pith.science/pith/XGQ73O67YPD7QSR3IGAW3IM3MO/action/citation_signature","submit_replication":"https://pith.science/pith/XGQ73O67YPD7QSR3IGAW3IM3MO/action/replication_record"}},"created_at":"2026-05-18T00:31:29.529916+00:00","updated_at":"2026-05-18T00:31:29.529916+00:00"}