{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RQLXCQCOIGUVCVKC2HDZVHX2Y3","short_pith_number":"pith:RQLXCQCO","schema_version":"1.0","canonical_sha256":"8c1771404e41a9515542d1c79a9efac6e7fc8bf56261b5e92da5b3b4622e045b","source":{"kind":"arxiv","id":"1602.08563","version":2},"attestation_state":"computed","paper":{"title":"Online Tree Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksandra Spyra, Jan Marcinkowski, Maciej Pacut, Marcin Bienkowski, Stefan Schmid","submitted_at":"2016-02-27T07:35:49Z","abstract_excerpt":"We initiate the study of a natural and practically relevant new variant of online caching where the to-be-cached items can have dependencies. We assume that the universe is a tree T and items are tree nodes; we require that if a node v is cached then the whole subtree T(v) rooted at v is cached as well. This theoretical problem finds an immediate application in the context of forwarding table optimization in IP routing and software-defined networks.\n  We present an elegant online deterministic algorithm TC for this problem, and rigorously prove that its competitive ratio is O(height(T) * k_ALG"},"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":"1602.08563","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-27T07:35:49Z","cross_cats_sorted":[],"title_canon_sha256":"24d28bb5b415857fbe6d4917c1257f4eb61c7056d50498b66a831a340a1eced7","abstract_canon_sha256":"9039726a83773b94a9fa7b44ccec07f557a86114502b91571dab00ef0aef2291"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:33.849229Z","signature_b64":"1qFMBovesyIz4ZO4Sl5ixZX9BuEpGZjl1wQwYKsKHLM4qtIq+9OOO3Mej03m90WWT++CaRwyuy3bE4BFRr2xCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c1771404e41a9515542d1c79a9efac6e7fc8bf56261b5e92da5b3b4622e045b","last_reissued_at":"2026-05-18T00:44:33.848671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:33.848671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Tree Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksandra Spyra, Jan Marcinkowski, Maciej Pacut, Marcin Bienkowski, Stefan Schmid","submitted_at":"2016-02-27T07:35:49Z","abstract_excerpt":"We initiate the study of a natural and practically relevant new variant of online caching where the to-be-cached items can have dependencies. We assume that the universe is a tree T and items are tree nodes; we require that if a node v is cached then the whole subtree T(v) rooted at v is cached as well. This theoretical problem finds an immediate application in the context of forwarding table optimization in IP routing and software-defined networks.\n  We present an elegant online deterministic algorithm TC for this problem, and rigorously prove that its competitive ratio is O(height(T) * k_ALG"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08563","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.08563","created_at":"2026-05-18T00:44:33.848749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08563v2","created_at":"2026-05-18T00:44:33.848749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08563","created_at":"2026-05-18T00:44:33.848749+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQLXCQCOIGUV","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQLXCQCOIGUVCVKC","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQLXCQCO","created_at":"2026-05-18T12:30:41.710351+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/RQLXCQCOIGUVCVKC2HDZVHX2Y3","json":"https://pith.science/pith/RQLXCQCOIGUVCVKC2HDZVHX2Y3.json","graph_json":"https://pith.science/api/pith-number/RQLXCQCOIGUVCVKC2HDZVHX2Y3/graph.json","events_json":"https://pith.science/api/pith-number/RQLXCQCOIGUVCVKC2HDZVHX2Y3/events.json","paper":"https://pith.science/paper/RQLXCQCO"},"agent_actions":{"view_html":"https://pith.science/pith/RQLXCQCOIGUVCVKC2HDZVHX2Y3","download_json":"https://pith.science/pith/RQLXCQCOIGUVCVKC2HDZVHX2Y3.json","view_paper":"https://pith.science/paper/RQLXCQCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08563&json=true","fetch_graph":"https://pith.science/api/pith-number/RQLXCQCOIGUVCVKC2HDZVHX2Y3/graph.json","fetch_events":"https://pith.science/api/pith-number/RQLXCQCOIGUVCVKC2HDZVHX2Y3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQLXCQCOIGUVCVKC2HDZVHX2Y3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQLXCQCOIGUVCVKC2HDZVHX2Y3/action/storage_attestation","attest_author":"https://pith.science/pith/RQLXCQCOIGUVCVKC2HDZVHX2Y3/action/author_attestation","sign_citation":"https://pith.science/pith/RQLXCQCOIGUVCVKC2HDZVHX2Y3/action/citation_signature","submit_replication":"https://pith.science/pith/RQLXCQCOIGUVCVKC2HDZVHX2Y3/action/replication_record"}},"created_at":"2026-05-18T00:44:33.848749+00:00","updated_at":"2026-05-18T00:44:33.848749+00:00"}