{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2VDMYMONEJIZMCCEUDCM6ZUREH","short_pith_number":"pith:2VDMYMON","schema_version":"1.0","canonical_sha256":"d546cc31cd2251960844a0c4cf669121e2787303443bee22b2e4c87ba0f6a811","source":{"kind":"arxiv","id":"1001.3744","version":1},"attestation_state":"computed","paper":{"title":"Multicast Transmission Prefix and Popularity Aware Interval Caching Based Admission Control Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"P. Jayarekha, T.R. GopalaKrishnan nair","submitted_at":"2010-01-21T08:57:27Z","abstract_excerpt":"Admission control is a key component in multimedia servers, which will allow the resources to be used by the client only when they are available. A problem faced by numerous content serving machines is overload, when there are too many clients who need to be served, the server tends to slow down. An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the QoS requirements of the existing requests in the system. By caching and streaming only the data in the interval between two successive requests on the same objec"},"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":"1001.3744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2010-01-21T08:57:27Z","cross_cats_sorted":[],"title_canon_sha256":"4fe5b9fc15f85457e5c6f94b4be0bcde1e15538071894fff38d9e3eafffd79b5","abstract_canon_sha256":"a8d1691877a7aed901d16db67697f9291c51366f24d909267ddc8e22014c35d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:58.921304Z","signature_b64":"GWNxfW85mZA7OF425FtmLel0Uo7kbuuxS1moeeKhhuILIVYG/vWn4dbKfQpjnYi8YuOv+1GW9A222gQO7tvSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d546cc31cd2251960844a0c4cf669121e2787303443bee22b2e4c87ba0f6a811","last_reissued_at":"2026-05-18T01:04:58.920600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:58.920600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multicast Transmission Prefix and Popularity Aware Interval Caching Based Admission Control Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"P. Jayarekha, T.R. GopalaKrishnan nair","submitted_at":"2010-01-21T08:57:27Z","abstract_excerpt":"Admission control is a key component in multimedia servers, which will allow the resources to be used by the client only when they are available. A problem faced by numerous content serving machines is overload, when there are too many clients who need to be served, the server tends to slow down. An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the QoS requirements of the existing requests in the system. By caching and streaming only the data in the interval between two successive requests on the same objec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3744","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":"1001.3744","created_at":"2026-05-18T01:04:58.920723+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.3744v1","created_at":"2026-05-18T01:04:58.920723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3744","created_at":"2026-05-18T01:04:58.920723+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VDMYMONEJIZ","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VDMYMONEJIZMCCE","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VDMYMON","created_at":"2026-05-18T12:26:03.138858+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/2VDMYMONEJIZMCCEUDCM6ZUREH","json":"https://pith.science/pith/2VDMYMONEJIZMCCEUDCM6ZUREH.json","graph_json":"https://pith.science/api/pith-number/2VDMYMONEJIZMCCEUDCM6ZUREH/graph.json","events_json":"https://pith.science/api/pith-number/2VDMYMONEJIZMCCEUDCM6ZUREH/events.json","paper":"https://pith.science/paper/2VDMYMON"},"agent_actions":{"view_html":"https://pith.science/pith/2VDMYMONEJIZMCCEUDCM6ZUREH","download_json":"https://pith.science/pith/2VDMYMONEJIZMCCEUDCM6ZUREH.json","view_paper":"https://pith.science/paper/2VDMYMON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.3744&json=true","fetch_graph":"https://pith.science/api/pith-number/2VDMYMONEJIZMCCEUDCM6ZUREH/graph.json","fetch_events":"https://pith.science/api/pith-number/2VDMYMONEJIZMCCEUDCM6ZUREH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VDMYMONEJIZMCCEUDCM6ZUREH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VDMYMONEJIZMCCEUDCM6ZUREH/action/storage_attestation","attest_author":"https://pith.science/pith/2VDMYMONEJIZMCCEUDCM6ZUREH/action/author_attestation","sign_citation":"https://pith.science/pith/2VDMYMONEJIZMCCEUDCM6ZUREH/action/citation_signature","submit_replication":"https://pith.science/pith/2VDMYMONEJIZMCCEUDCM6ZUREH/action/replication_record"}},"created_at":"2026-05-18T01:04:58.920723+00:00","updated_at":"2026-05-18T01:04:58.920723+00:00"}