{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XO6OXPRR6AK2B35PNL33JERYQD","short_pith_number":"pith:XO6OXPRR","canonical_record":{"source":{"id":"1407.4760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-17T18:19:49Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"c59b63c4d30ed5a7e43f6ef207958ce2061719537494b1acc8dc2632ecf0137f","abstract_canon_sha256":"5ac47d3e307ddfb1ddece85821ddb2c8ff226bfb9658fabab2dd64951c63007c"},"schema_version":"1.0"},"canonical_sha256":"bbbcebbe31f015a0efaf6af7b4923880dca181891e706ecb23a6dc3b7c6245bb","source":{"kind":"arxiv","id":"1407.4760","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4760","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4760v1","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4760","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"pith_short_12","alias_value":"XO6OXPRR6AK2","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XO6OXPRR6AK2B35P","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XO6OXPRR","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XO6OXPRR6AK2B35PNL33JERYQD","target":"record","payload":{"canonical_record":{"source":{"id":"1407.4760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-17T18:19:49Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"c59b63c4d30ed5a7e43f6ef207958ce2061719537494b1acc8dc2632ecf0137f","abstract_canon_sha256":"5ac47d3e307ddfb1ddece85821ddb2c8ff226bfb9658fabab2dd64951c63007c"},"schema_version":"1.0"},"canonical_sha256":"bbbcebbe31f015a0efaf6af7b4923880dca181891e706ecb23a6dc3b7c6245bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:23.432576Z","signature_b64":"rnh08BfB3riJns9US9zvJoGN1WgmHl4lUHoHUPOjdhnUCe7rbjT6Y567ZHjhf9Rw/7UDatRnL6ilLntyPMOlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbbcebbe31f015a0efaf6af7b4923880dca181891e706ecb23a6dc3b7c6245bb","last_reissued_at":"2026-05-18T02:47:23.432206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:23.432206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.4760","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-05-18T02:47:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6CQZXjUZ3xunZZ0UFH/XeVhIGhx303uMvPBecdg5JaCJgIFiBRPraCI8+VmY30ldX8BSCH1X1rgPSGE6kRo6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:56:17.538227Z"},"content_sha256":"4fb7c5566f6eb5f590b2a3aa4a3636510751aedc0491f1e495a7bc3a66ea4ee8","schema_version":"1.0","event_id":"sha256:4fb7c5566f6eb5f590b2a3aa4a3636510751aedc0491f1e495a7bc3a66ea4ee8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XO6OXPRR6AK2B35PNL33JERYQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"What Makes a Good Plan? An Efficient Planning Approach to Control Diffusion Processes in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"math.OC","authors_text":"Argyris Kalogeratos, Kevin Scaman, Nicolas Vayatis","submitted_at":"2014-07-17T18:19:49Z","abstract_excerpt":"In this paper, we analyze the quality of a large class of simple dynamic resource allocation (DRA) strategies which we name priority planning. Their aim is to control an undesired diffusion process by distributing resources to the contagious nodes of the network according to a predefined priority-order. In our analysis, we reduce the DRA problem to the linear arrangement of the nodes of the network. Under this perspective, we shed light on the role of a fundamental characteristic of this arrangement, the maximum cutwidth, for assessing the quality of any priority planning strategy. Our theoret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4760","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"},"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:47:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rr+oxnC5ODL/J6d2UbTFfu7sV8wngH0OiG2Q1zfMfCf+vBK/KVDXb0fnqhGRb9eBf/YFN5UxjwPAwEBgKBD9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:56:17.538654Z"},"content_sha256":"d0b7c2f1123b1b5dbfbad734a5700655483520a6345fc67b5828f6485372721c","schema_version":"1.0","event_id":"sha256:d0b7c2f1123b1b5dbfbad734a5700655483520a6345fc67b5828f6485372721c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XO6OXPRR6AK2B35PNL33JERYQD/bundle.json","state_url":"https://pith.science/pith/XO6OXPRR6AK2B35PNL33JERYQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XO6OXPRR6AK2B35PNL33JERYQD/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-28T00:56:17Z","links":{"resolver":"https://pith.science/pith/XO6OXPRR6AK2B35PNL33JERYQD","bundle":"https://pith.science/pith/XO6OXPRR6AK2B35PNL33JERYQD/bundle.json","state":"https://pith.science/pith/XO6OXPRR6AK2B35PNL33JERYQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XO6OXPRR6AK2B35PNL33JERYQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XO6OXPRR6AK2B35PNL33JERYQD","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":"5ac47d3e307ddfb1ddece85821ddb2c8ff226bfb9658fabab2dd64951c63007c","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-17T18:19:49Z","title_canon_sha256":"c59b63c4d30ed5a7e43f6ef207958ce2061719537494b1acc8dc2632ecf0137f"},"schema_version":"1.0","source":{"id":"1407.4760","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4760","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4760v1","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4760","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"pith_short_12","alias_value":"XO6OXPRR6AK2","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XO6OXPRR6AK2B35P","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XO6OXPRR","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:d0b7c2f1123b1b5dbfbad734a5700655483520a6345fc67b5828f6485372721c","target":"graph","created_at":"2026-05-18T02:47:23Z","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":"In this paper, we analyze the quality of a large class of simple dynamic resource allocation (DRA) strategies which we name priority planning. Their aim is to control an undesired diffusion process by distributing resources to the contagious nodes of the network according to a predefined priority-order. In our analysis, we reduce the DRA problem to the linear arrangement of the nodes of the network. Under this perspective, we shed light on the role of a fundamental characteristic of this arrangement, the maximum cutwidth, for assessing the quality of any priority planning strategy. Our theoret","authors_text":"Argyris Kalogeratos, Kevin Scaman, Nicolas Vayatis","cross_cats":["cs.SI","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-17T18:19:49Z","title":"What Makes a Good Plan? An Efficient Planning Approach to Control Diffusion Processes in Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4760","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:4fb7c5566f6eb5f590b2a3aa4a3636510751aedc0491f1e495a7bc3a66ea4ee8","target":"record","created_at":"2026-05-18T02:47:23Z","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":"5ac47d3e307ddfb1ddece85821ddb2c8ff226bfb9658fabab2dd64951c63007c","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-17T18:19:49Z","title_canon_sha256":"c59b63c4d30ed5a7e43f6ef207958ce2061719537494b1acc8dc2632ecf0137f"},"schema_version":"1.0","source":{"id":"1407.4760","kind":"arxiv","version":1}},"canonical_sha256":"bbbcebbe31f015a0efaf6af7b4923880dca181891e706ecb23a6dc3b7c6245bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbbcebbe31f015a0efaf6af7b4923880dca181891e706ecb23a6dc3b7c6245bb","first_computed_at":"2026-05-18T02:47:23.432206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:23.432206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rnh08BfB3riJns9US9zvJoGN1WgmHl4lUHoHUPOjdhnUCe7rbjT6Y567ZHjhf9Rw/7UDatRnL6ilLntyPMOlDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:23.432576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4760","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fb7c5566f6eb5f590b2a3aa4a3636510751aedc0491f1e495a7bc3a66ea4ee8","sha256:d0b7c2f1123b1b5dbfbad734a5700655483520a6345fc67b5828f6485372721c"],"state_sha256":"a2d8b3477de93f3e6acb4165e1d14894470d27db0e77066e9d49b003267a6cf8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rd+TQfQya/Fng39e79yoW/jhSiQ9bacVBnHXE8IVz6hp+lDsCkWT1Stfw9uZuUfw/aUx5ReNPyzoeag1y18ACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:56:17.540893Z","bundle_sha256":"5b2fb7e11c0836da7f95cdf68455587c800506fcb2002cc3fd7b9e74f5257c6a"}}