{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:NR3KVTFV74NWRZHAN2BKPLXA2H","short_pith_number":"pith:NR3KVTFV","canonical_record":{"source":{"id":"0911.2280","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-11-12T12:57:09Z","cross_cats_sorted":["cs.CC","cs.SI"],"title_canon_sha256":"9ca97ef9806701675c5f955455b006b21622f1c791dd59f86e45e38995651a58","abstract_canon_sha256":"fc6ddbb6abace8c8ec4421b85b81f6202babf0f11357e65bcfa9948942c61ff7"},"schema_version":"1.0"},"canonical_sha256":"6c76aaccb5ff1b68e4e06e82a7aee0d1f14eda9f253a961124dde504b5fc6f4b","source":{"kind":"arxiv","id":"0911.2280","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.2280","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"0911.2280v2","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.2280","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"NR3KVTFV74NW","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"NR3KVTFV74NWRZHA","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"NR3KVTFV","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:NR3KVTFV74NWRZHAN2BKPLXA2H","target":"record","payload":{"canonical_record":{"source":{"id":"0911.2280","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-11-12T12:57:09Z","cross_cats_sorted":["cs.CC","cs.SI"],"title_canon_sha256":"9ca97ef9806701675c5f955455b006b21622f1c791dd59f86e45e38995651a58","abstract_canon_sha256":"fc6ddbb6abace8c8ec4421b85b81f6202babf0f11357e65bcfa9948942c61ff7"},"schema_version":"1.0"},"canonical_sha256":"6c76aaccb5ff1b68e4e06e82a7aee0d1f14eda9f253a961124dde504b5fc6f4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:25.748786Z","signature_b64":"/yG6JK55hg2PBFqGDSvEt+tDuXlQvKdM4pwSB9O/dDv08wcKzRLF6pTPZQypocJxdDs7LxQPi0XMgDhSjdJJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c76aaccb5ff1b68e4e06e82a7aee0d1f14eda9f253a961124dde504b5fc6f4b","last_reissued_at":"2026-05-18T02:51:25.748138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:25.748138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.2280","source_version":2,"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:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f6djUlgrjDziJ6LPf8x0CmndUN0sPXdySFgOCZcubwVxp40N0QtJCXr2xAba6UwzuJ6O76CTNHdDmofdbDprCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:08:59.510565Z"},"content_sha256":"7255e67a0b8b7b9d2052c797d2cc461dbf50e0889d66a9266d6d1c5bfedc1d80","schema_version":"1.0","event_id":"sha256:7255e67a0b8b7b9d2052c797d2cc461dbf50e0889d66a9266d6d1c5bfedc1d80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:NR3KVTFV74NWRZHAN2BKPLXA2H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PageRank Optimization by Edge Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SI"],"primary_cat":"cs.DS","authors_text":"Bal\\'azs Csan\\'ad Cs\\'aji, Rapha\\\"el M. Jungers, Vincent D. Blondel","submitted_at":"2009-11-12T12:57:09Z","abstract_excerpt":"The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts - including ranking websites - and can be interpreted as the average portion of time spent at the node by an infinite random walk. We consider the problem of maximizing the PageRank of a node by selecting some of the edges from a set of edges that are under our control. By applying results from Markov decision theory, we show that an optimal solution to this problem can be found in polynomial time. Our core solution results in a linear programming for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.2280","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":""},"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:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LGZbOQoANqVRqBXFRpJOmHCioAdgPGEBFcE/RCX1VmehuXme4Kcqd0oNzmkFtEGExPkvhLst0wiTIza1IoEjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:08:59.510904Z"},"content_sha256":"b5a40cfe5686800f51a48e52705b3b3d3177cbb3ff89194f5712083c2f413be6","schema_version":"1.0","event_id":"sha256:b5a40cfe5686800f51a48e52705b3b3d3177cbb3ff89194f5712083c2f413be6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NR3KVTFV74NWRZHAN2BKPLXA2H/bundle.json","state_url":"https://pith.science/pith/NR3KVTFV74NWRZHAN2BKPLXA2H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NR3KVTFV74NWRZHAN2BKPLXA2H/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-27T04:08:59Z","links":{"resolver":"https://pith.science/pith/NR3KVTFV74NWRZHAN2BKPLXA2H","bundle":"https://pith.science/pith/NR3KVTFV74NWRZHAN2BKPLXA2H/bundle.json","state":"https://pith.science/pith/NR3KVTFV74NWRZHAN2BKPLXA2H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NR3KVTFV74NWRZHAN2BKPLXA2H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:NR3KVTFV74NWRZHAN2BKPLXA2H","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":"fc6ddbb6abace8c8ec4421b85b81f6202babf0f11357e65bcfa9948942c61ff7","cross_cats_sorted":["cs.CC","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-11-12T12:57:09Z","title_canon_sha256":"9ca97ef9806701675c5f955455b006b21622f1c791dd59f86e45e38995651a58"},"schema_version":"1.0","source":{"id":"0911.2280","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.2280","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"0911.2280v2","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.2280","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"NR3KVTFV74NW","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"NR3KVTFV74NWRZHA","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"NR3KVTFV","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:b5a40cfe5686800f51a48e52705b3b3d3177cbb3ff89194f5712083c2f413be6","target":"graph","created_at":"2026-05-18T02:51:25Z","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":"The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts - including ranking websites - and can be interpreted as the average portion of time spent at the node by an infinite random walk. We consider the problem of maximizing the PageRank of a node by selecting some of the edges from a set of edges that are under our control. By applying results from Markov decision theory, we show that an optimal solution to this problem can be found in polynomial time. Our core solution results in a linear programming for","authors_text":"Bal\\'azs Csan\\'ad Cs\\'aji, Rapha\\\"el M. Jungers, Vincent D. Blondel","cross_cats":["cs.CC","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-11-12T12:57:09Z","title":"PageRank Optimization by Edge Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.2280","kind":"arxiv","version":2},"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:7255e67a0b8b7b9d2052c797d2cc461dbf50e0889d66a9266d6d1c5bfedc1d80","target":"record","created_at":"2026-05-18T02:51:25Z","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":"fc6ddbb6abace8c8ec4421b85b81f6202babf0f11357e65bcfa9948942c61ff7","cross_cats_sorted":["cs.CC","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-11-12T12:57:09Z","title_canon_sha256":"9ca97ef9806701675c5f955455b006b21622f1c791dd59f86e45e38995651a58"},"schema_version":"1.0","source":{"id":"0911.2280","kind":"arxiv","version":2}},"canonical_sha256":"6c76aaccb5ff1b68e4e06e82a7aee0d1f14eda9f253a961124dde504b5fc6f4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c76aaccb5ff1b68e4e06e82a7aee0d1f14eda9f253a961124dde504b5fc6f4b","first_computed_at":"2026-05-18T02:51:25.748138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:25.748138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/yG6JK55hg2PBFqGDSvEt+tDuXlQvKdM4pwSB9O/dDv08wcKzRLF6pTPZQypocJxdDs7LxQPi0XMgDhSjdJJCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:25.748786Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.2280","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7255e67a0b8b7b9d2052c797d2cc461dbf50e0889d66a9266d6d1c5bfedc1d80","sha256:b5a40cfe5686800f51a48e52705b3b3d3177cbb3ff89194f5712083c2f413be6"],"state_sha256":"fd252041113d6b57ae31aa614375f94649cae2ff50a081565bc7e37b78eb686a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RC3VQ1/HIxmzbwzE0T6SHsQjEDU/uNDVf92AfuJC1NSsnf0IwrIndBhvsxIYg/GK5KhBby9xXV02LyFAElFfDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T04:08:59.512769Z","bundle_sha256":"2bd493b27835a57a42d89e3f09b6046d424546a5a3350a93169e349102f1d753"}}