{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FLCRMHYBO7B4QHMLGSD3RQGFRX","short_pith_number":"pith:FLCRMHYB","schema_version":"1.0","canonical_sha256":"2ac5161f0177c3c81d8b3487b8c0c58dcf78a28c4eb411a3c757adaece2526e8","source":{"kind":"arxiv","id":"1603.02094","version":3},"attestation_state":"computed","paper":{"title":"Quality and Cost of Deterministic Network Calculus - Design and Evaluation of an Accurate and Fast Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NI","authors_text":"Jens B. Schmitt, Paul Nikolaus, Steffen Bondorf","submitted_at":"2016-03-07T14:53:33Z","abstract_excerpt":"Networks are integral parts of modern safety-critical systems and certification demands the provision of guarantees for data transmissions. Deterministic Network Calculus (DNC) can compute a worst-case bound on a data flow's end-to-end delay. Accuracy of DNC results has been improved steadily, resulting in two DNC branches: the classical algebraic analysis and the more recent optimization-based analysis. The optimization-based branch provides a theoretical solution for tight bounds. Its computational cost grows, however, (possibly super-)exponentially with the network size. Consequently, a heu"},"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":"1603.02094","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-07T14:53:33Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"d021691d9abd48e4266aadf7d574740847199e53f0331e088f27c718be256a52","abstract_canon_sha256":"2922c9f2eaf1cc7d37c369a3e4cd618c3ffa9b6c71094a65f7a32486ff1434a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:24.873025Z","signature_b64":"kQNujYzi7Pzt2oD5WW9+QjHBKYWuOh2uf/BSK4sCRIctx+IG1ke4556cS9TqX6HX3HkY3ms+NeB9MH4Ye949CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ac5161f0177c3c81d8b3487b8c0c58dcf78a28c4eb411a3c757adaece2526e8","last_reissued_at":"2026-05-18T00:44:24.872455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:24.872455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quality and Cost of Deterministic Network Calculus - Design and Evaluation of an Accurate and Fast Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NI","authors_text":"Jens B. Schmitt, Paul Nikolaus, Steffen Bondorf","submitted_at":"2016-03-07T14:53:33Z","abstract_excerpt":"Networks are integral parts of modern safety-critical systems and certification demands the provision of guarantees for data transmissions. Deterministic Network Calculus (DNC) can compute a worst-case bound on a data flow's end-to-end delay. Accuracy of DNC results has been improved steadily, resulting in two DNC branches: the classical algebraic analysis and the more recent optimization-based analysis. The optimization-based branch provides a theoretical solution for tight bounds. Its computational cost grows, however, (possibly super-)exponentially with the network size. Consequently, a heu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02094","kind":"arxiv","version":3},"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":"1603.02094","created_at":"2026-05-18T00:44:24.872556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.02094v3","created_at":"2026-05-18T00:44:24.872556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02094","created_at":"2026-05-18T00:44:24.872556+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLCRMHYBO7B4","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLCRMHYBO7B4QHML","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLCRMHYB","created_at":"2026-05-18T12:30:15.759754+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/FLCRMHYBO7B4QHMLGSD3RQGFRX","json":"https://pith.science/pith/FLCRMHYBO7B4QHMLGSD3RQGFRX.json","graph_json":"https://pith.science/api/pith-number/FLCRMHYBO7B4QHMLGSD3RQGFRX/graph.json","events_json":"https://pith.science/api/pith-number/FLCRMHYBO7B4QHMLGSD3RQGFRX/events.json","paper":"https://pith.science/paper/FLCRMHYB"},"agent_actions":{"view_html":"https://pith.science/pith/FLCRMHYBO7B4QHMLGSD3RQGFRX","download_json":"https://pith.science/pith/FLCRMHYBO7B4QHMLGSD3RQGFRX.json","view_paper":"https://pith.science/paper/FLCRMHYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.02094&json=true","fetch_graph":"https://pith.science/api/pith-number/FLCRMHYBO7B4QHMLGSD3RQGFRX/graph.json","fetch_events":"https://pith.science/api/pith-number/FLCRMHYBO7B4QHMLGSD3RQGFRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLCRMHYBO7B4QHMLGSD3RQGFRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLCRMHYBO7B4QHMLGSD3RQGFRX/action/storage_attestation","attest_author":"https://pith.science/pith/FLCRMHYBO7B4QHMLGSD3RQGFRX/action/author_attestation","sign_citation":"https://pith.science/pith/FLCRMHYBO7B4QHMLGSD3RQGFRX/action/citation_signature","submit_replication":"https://pith.science/pith/FLCRMHYBO7B4QHMLGSD3RQGFRX/action/replication_record"}},"created_at":"2026-05-18T00:44:24.872556+00:00","updated_at":"2026-05-18T00:44:24.872556+00:00"}