{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4GYCKT6ROZVIHIGS6LVX5WJSRV","short_pith_number":"pith:4GYCKT6R","schema_version":"1.0","canonical_sha256":"e1b0254fd1766a83a0d2f2eb7ed9328d6349a3abc3d51f32d866266aef3c2ce9","source":{"kind":"arxiv","id":"1806.09549","version":1},"attestation_state":"computed","paper":{"title":"Maximum Rooted Connected Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ioannis Lamprou, Ioannis Sigalas, Russell Martin, Sven Schewe, Vassilis Zissimopoulos","submitted_at":"2018-06-25T16:12:36Z","abstract_excerpt":"Prefetching constitutes a valuable tool toward efficient Web surfing. As a result, estimating the amount of resources that need to be preloaded during a surfer's browsing becomes an important task. In this regard, prefetching can be modeled as a two-player combinatorial game [Fomin et al., Theoretical Computer Science 2014], where a surfer and a marker alternately play on a given graph (representing the Web graph). During its turn, the marker chooses a set of $k$ nodes to mark (prefetch), whereas the surfer, represented as a token resting on graph nodes, moves to a neighboring node (Web resour"},"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":"1806.09549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-25T16:12:36Z","cross_cats_sorted":[],"title_canon_sha256":"d950d2247ebdd71d2e698b3a88b8e054a6b6607228ba43ba2857c10c76800ac1","abstract_canon_sha256":"d54a43eea08bdcfb340ba07b1bf3812f2ac81f71bdbfdd9d1d25dac7e902dea8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:25.475588Z","signature_b64":"WgDPwUZwVwdni3q05OHbGZMthJskZSgkZa54mdfWWbwqMgNbI5Mfl41fPtZLrcyEAeiGKMlUJo6wDw046M/0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1b0254fd1766a83a0d2f2eb7ed9328d6349a3abc3d51f32d866266aef3c2ce9","last_reissued_at":"2026-05-18T00:12:25.475140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:25.475140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Rooted Connected Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ioannis Lamprou, Ioannis Sigalas, Russell Martin, Sven Schewe, Vassilis Zissimopoulos","submitted_at":"2018-06-25T16:12:36Z","abstract_excerpt":"Prefetching constitutes a valuable tool toward efficient Web surfing. As a result, estimating the amount of resources that need to be preloaded during a surfer's browsing becomes an important task. In this regard, prefetching can be modeled as a two-player combinatorial game [Fomin et al., Theoretical Computer Science 2014], where a surfer and a marker alternately play on a given graph (representing the Web graph). During its turn, the marker chooses a set of $k$ nodes to mark (prefetch), whereas the surfer, represented as a token resting on graph nodes, moves to a neighboring node (Web resour"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09549","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":"1806.09549","created_at":"2026-05-18T00:12:25.475207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09549v1","created_at":"2026-05-18T00:12:25.475207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09549","created_at":"2026-05-18T00:12:25.475207+00:00"},{"alias_kind":"pith_short_12","alias_value":"4GYCKT6ROZVI","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4GYCKT6ROZVIHIGS","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4GYCKT6R","created_at":"2026-05-18T12:32:05.422762+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/4GYCKT6ROZVIHIGS6LVX5WJSRV","json":"https://pith.science/pith/4GYCKT6ROZVIHIGS6LVX5WJSRV.json","graph_json":"https://pith.science/api/pith-number/4GYCKT6ROZVIHIGS6LVX5WJSRV/graph.json","events_json":"https://pith.science/api/pith-number/4GYCKT6ROZVIHIGS6LVX5WJSRV/events.json","paper":"https://pith.science/paper/4GYCKT6R"},"agent_actions":{"view_html":"https://pith.science/pith/4GYCKT6ROZVIHIGS6LVX5WJSRV","download_json":"https://pith.science/pith/4GYCKT6ROZVIHIGS6LVX5WJSRV.json","view_paper":"https://pith.science/paper/4GYCKT6R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09549&json=true","fetch_graph":"https://pith.science/api/pith-number/4GYCKT6ROZVIHIGS6LVX5WJSRV/graph.json","fetch_events":"https://pith.science/api/pith-number/4GYCKT6ROZVIHIGS6LVX5WJSRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4GYCKT6ROZVIHIGS6LVX5WJSRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4GYCKT6ROZVIHIGS6LVX5WJSRV/action/storage_attestation","attest_author":"https://pith.science/pith/4GYCKT6ROZVIHIGS6LVX5WJSRV/action/author_attestation","sign_citation":"https://pith.science/pith/4GYCKT6ROZVIHIGS6LVX5WJSRV/action/citation_signature","submit_replication":"https://pith.science/pith/4GYCKT6ROZVIHIGS6LVX5WJSRV/action/replication_record"}},"created_at":"2026-05-18T00:12:25.475207+00:00","updated_at":"2026-05-18T00:12:25.475207+00:00"}