{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:I6O3LTEPTUP7WGTH57QKZ55EH6","short_pith_number":"pith:I6O3LTEP","schema_version":"1.0","canonical_sha256":"479db5cc8f9d1ffb1a67efe0acf7a43f9060a9e196f5df202beabe931cf3a31e","source":{"kind":"arxiv","id":"1207.1187","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Priority Queue: An SDRAM Arbiter With Bounded Access Latencies for Tight WCET Calculation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Alois Knoll, Andreas Raabe, Hardik Shah","submitted_at":"2012-07-05T08:20:02Z","abstract_excerpt":"This report introduces a shared resource arbitration scheme \"DPQ - Dynamic Priority Queue\" which provides bandwidth guarantees and low worst case latency to each master in an MPSoC. Being a non-trivial candidate for timing analysis, SDRAM has been chosen as a showcase, but the approach is valid for any shared resource arbitration.\n  Due to its significant cost, data rate and physical size advantages, SDRAM is a potential candidate for cost sensitive, safety critical and space conserving systems. The variable access latency is a major drawback of SDRAM that induces largely over estimated Worst "},"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":"1207.1187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2012-07-05T08:20:02Z","cross_cats_sorted":[],"title_canon_sha256":"cc2dc347feda83c8e60a6786b40a0f32b19c87e10d5797e665bbb9d615df96f0","abstract_canon_sha256":"ff292508811ebd4172111178e963c634d9ea013c2c1ca30050bc0d9cd40e7a71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:08.516024Z","signature_b64":"0HVUiABtDHxvzmfXKv5wmKkp+yDPD/jhDPeJNAV89UQSaI45si2VOFfYr+8t7Khdey2ePgdd9jzoqeWHXRC8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"479db5cc8f9d1ffb1a67efe0acf7a43f9060a9e196f5df202beabe931cf3a31e","last_reissued_at":"2026-05-18T02:21:08.515611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:08.515611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Priority Queue: An SDRAM Arbiter With Bounded Access Latencies for Tight WCET Calculation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Alois Knoll, Andreas Raabe, Hardik Shah","submitted_at":"2012-07-05T08:20:02Z","abstract_excerpt":"This report introduces a shared resource arbitration scheme \"DPQ - Dynamic Priority Queue\" which provides bandwidth guarantees and low worst case latency to each master in an MPSoC. Being a non-trivial candidate for timing analysis, SDRAM has been chosen as a showcase, but the approach is valid for any shared resource arbitration.\n  Due to its significant cost, data rate and physical size advantages, SDRAM is a potential candidate for cost sensitive, safety critical and space conserving systems. The variable access latency is a major drawback of SDRAM that induces largely over estimated Worst "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1187","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":"1207.1187","created_at":"2026-05-18T02:21:08.515672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1187v1","created_at":"2026-05-18T02:21:08.515672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1187","created_at":"2026-05-18T02:21:08.515672+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6O3LTEPTUP7","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6O3LTEPTUP7WGTH","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6O3LTEP","created_at":"2026-05-18T12:27:09.501522+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/I6O3LTEPTUP7WGTH57QKZ55EH6","json":"https://pith.science/pith/I6O3LTEPTUP7WGTH57QKZ55EH6.json","graph_json":"https://pith.science/api/pith-number/I6O3LTEPTUP7WGTH57QKZ55EH6/graph.json","events_json":"https://pith.science/api/pith-number/I6O3LTEPTUP7WGTH57QKZ55EH6/events.json","paper":"https://pith.science/paper/I6O3LTEP"},"agent_actions":{"view_html":"https://pith.science/pith/I6O3LTEPTUP7WGTH57QKZ55EH6","download_json":"https://pith.science/pith/I6O3LTEPTUP7WGTH57QKZ55EH6.json","view_paper":"https://pith.science/paper/I6O3LTEP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1187&json=true","fetch_graph":"https://pith.science/api/pith-number/I6O3LTEPTUP7WGTH57QKZ55EH6/graph.json","fetch_events":"https://pith.science/api/pith-number/I6O3LTEPTUP7WGTH57QKZ55EH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6O3LTEPTUP7WGTH57QKZ55EH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6O3LTEPTUP7WGTH57QKZ55EH6/action/storage_attestation","attest_author":"https://pith.science/pith/I6O3LTEPTUP7WGTH57QKZ55EH6/action/author_attestation","sign_citation":"https://pith.science/pith/I6O3LTEPTUP7WGTH57QKZ55EH6/action/citation_signature","submit_replication":"https://pith.science/pith/I6O3LTEPTUP7WGTH57QKZ55EH6/action/replication_record"}},"created_at":"2026-05-18T02:21:08.515672+00:00","updated_at":"2026-05-18T02:21:08.515672+00:00"}