{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:I6O3LTEPTUP7WGTH57QKZ55EH6","short_pith_number":"pith:I6O3LTEP","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"},"canonical_sha256":"479db5cc8f9d1ffb1a67efe0acf7a43f9060a9e196f5df202beabe931cf3a31e","source":{"kind":"arxiv","id":"1207.1187","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1187","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1187v1","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1187","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"I6O3LTEPTUP7","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"I6O3LTEPTUP7WGTH","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"I6O3LTEP","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:I6O3LTEPTUP7WGTH57QKZ55EH6","target":"record","payload":{"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"},"canonical_sha256":"479db5cc8f9d1ffb1a67efe0acf7a43f9060a9e196f5df202beabe931cf3a31e","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"},"source_kind":"arxiv","source_id":"1207.1187","source_version":1,"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:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45uIIWcSuIAGgJxvny1Vi4dId/SOzx1Y4gw1I7cDZziNzgxgD3FsUyioTbKNmXIO1EV/BDFruo1bUPe2I8SpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:33:16.869281Z"},"content_sha256":"378ceb91ab11d863333bcd2495cf45b7b435227223a4f6a626eeb5d6c49e55d8","schema_version":"1.0","event_id":"sha256:378ceb91ab11d863333bcd2495cf45b7b435227223a4f6a626eeb5d6c49e55d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:I6O3LTEPTUP7WGTH57QKZ55EH6","target":"graph","payload":{"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"},"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:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZTrKYmYXdG9tPkSX8mZWqXoJo3V2wbDQ6h2BFqwWvoPBjwrjzWERFtdU3/2zb3aL44qHXz1lgxCMFKJDZWo5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:33:16.870062Z"},"content_sha256":"d7215ed899b7fa20e38ae6a5d14c4df28c3fcf3c6a2d951f5d973deeb0b81f0b","schema_version":"1.0","event_id":"sha256:d7215ed899b7fa20e38ae6a5d14c4df28c3fcf3c6a2d951f5d973deeb0b81f0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I6O3LTEPTUP7WGTH57QKZ55EH6/bundle.json","state_url":"https://pith.science/pith/I6O3LTEPTUP7WGTH57QKZ55EH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I6O3LTEPTUP7WGTH57QKZ55EH6/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-05-30T20:33:16Z","links":{"resolver":"https://pith.science/pith/I6O3LTEPTUP7WGTH57QKZ55EH6","bundle":"https://pith.science/pith/I6O3LTEPTUP7WGTH57QKZ55EH6/bundle.json","state":"https://pith.science/pith/I6O3LTEPTUP7WGTH57QKZ55EH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I6O3LTEPTUP7WGTH57QKZ55EH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:I6O3LTEPTUP7WGTH57QKZ55EH6","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":"ff292508811ebd4172111178e963c634d9ea013c2c1ca30050bc0d9cd40e7a71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2012-07-05T08:20:02Z","title_canon_sha256":"cc2dc347feda83c8e60a6786b40a0f32b19c87e10d5797e665bbb9d615df96f0"},"schema_version":"1.0","source":{"id":"1207.1187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1187","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1187v1","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1187","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"I6O3LTEPTUP7","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"I6O3LTEPTUP7WGTH","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"I6O3LTEP","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:d7215ed899b7fa20e38ae6a5d14c4df28c3fcf3c6a2d951f5d973deeb0b81f0b","target":"graph","created_at":"2026-05-18T02:21:08Z","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":"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 ","authors_text":"Alois Knoll, Andreas Raabe, Hardik Shah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2012-07-05T08:20:02Z","title":"Dynamic Priority Queue: An SDRAM Arbiter With Bounded Access Latencies for Tight WCET Calculation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1187","kind":"arxiv","version":1},"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:378ceb91ab11d863333bcd2495cf45b7b435227223a4f6a626eeb5d6c49e55d8","target":"record","created_at":"2026-05-18T02:21:08Z","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":"ff292508811ebd4172111178e963c634d9ea013c2c1ca30050bc0d9cd40e7a71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2012-07-05T08:20:02Z","title_canon_sha256":"cc2dc347feda83c8e60a6786b40a0f32b19c87e10d5797e665bbb9d615df96f0"},"schema_version":"1.0","source":{"id":"1207.1187","kind":"arxiv","version":1}},"canonical_sha256":"479db5cc8f9d1ffb1a67efe0acf7a43f9060a9e196f5df202beabe931cf3a31e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"479db5cc8f9d1ffb1a67efe0acf7a43f9060a9e196f5df202beabe931cf3a31e","first_computed_at":"2026-05-18T02:21:08.515611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:08.515611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0HVUiABtDHxvzmfXKv5wmKkp+yDPD/jhDPeJNAV89UQSaI45si2VOFfYr+8t7Khdey2ePgdd9jzoqeWHXRC8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:08.516024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:378ceb91ab11d863333bcd2495cf45b7b435227223a4f6a626eeb5d6c49e55d8","sha256:d7215ed899b7fa20e38ae6a5d14c4df28c3fcf3c6a2d951f5d973deeb0b81f0b"],"state_sha256":"f7e18e23364adf10414bc6af3af4b0ac48c7df6ba7a1021e81697135150726f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HOkMV6fEliEvCoidXFHV+ro8uCqVTREd7AeRskIhevemkg+XEbE68jbp+oVSj8Az12om5Rm6f4o0m2otW6UCAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:33:16.874226Z","bundle_sha256":"1e3c56987a78b8cf75e1a7aaa73c358cc701611a199a298678535db292298a91"}}