{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6DPJOIY6KH4ZBVR4SX55HH7MPK","short_pith_number":"pith:6DPJOIY6","schema_version":"1.0","canonical_sha256":"f0de97231e51f990d63c95fbd39fec7a8f671de1b601acf0e8f4fe24ae83463d","source":{"kind":"arxiv","id":"1504.04757","version":2},"attestation_state":"computed","paper":{"title":"Tree Buffers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Radu Grigore, Stefan Kiefer","submitted_at":"2015-04-18T20:39:15Z","abstract_excerpt":"In runtime verification, the central problem is to decide if a given program execution violates a given property. In online runtime verification, a monitor observes a program's execution as it happens. If the program being observed has hard real-time constraints, then the monitor inherits them. In the presence of hard real-time constraints it becomes a challenge to maintain enough information to produce error traces, should a property violation be observed. In this paper we introduce a data structure, called tree buffer, that solves this problem in the context of automata-based monitors: If th"},"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":"1504.04757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-18T20:39:15Z","cross_cats_sorted":[],"title_canon_sha256":"8153864fedd502322798044ab730adc09ba119122501ab7e60e827c9e50fbfe3","abstract_canon_sha256":"54d787af53f730c9d80f0c4603c290345542c4af9af4ecfce86d9772a1136ab2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:54.007549Z","signature_b64":"21pyrb4jWwjtb3VKKXDNPWyXB6KAIUT/QUpr2VfQ2WoY+ojf3AV6Id1Qp20GB3PD5I8UAlVOajJ2M85rYfRYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0de97231e51f990d63c95fbd39fec7a8f671de1b601acf0e8f4fe24ae83463d","last_reissued_at":"2026-05-18T02:09:54.006721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:54.006721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree Buffers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Radu Grigore, Stefan Kiefer","submitted_at":"2015-04-18T20:39:15Z","abstract_excerpt":"In runtime verification, the central problem is to decide if a given program execution violates a given property. In online runtime verification, a monitor observes a program's execution as it happens. If the program being observed has hard real-time constraints, then the monitor inherits them. In the presence of hard real-time constraints it becomes a challenge to maintain enough information to produce error traces, should a property violation be observed. In this paper we introduce a data structure, called tree buffer, that solves this problem in the context of automata-based monitors: If th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04757","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":"1504.04757","created_at":"2026-05-18T02:09:54.006858+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04757v2","created_at":"2026-05-18T02:09:54.006858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04757","created_at":"2026-05-18T02:09:54.006858+00:00"},{"alias_kind":"pith_short_12","alias_value":"6DPJOIY6KH4Z","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6DPJOIY6KH4ZBVR4","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6DPJOIY6","created_at":"2026-05-18T12:29:07.941421+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/6DPJOIY6KH4ZBVR4SX55HH7MPK","json":"https://pith.science/pith/6DPJOIY6KH4ZBVR4SX55HH7MPK.json","graph_json":"https://pith.science/api/pith-number/6DPJOIY6KH4ZBVR4SX55HH7MPK/graph.json","events_json":"https://pith.science/api/pith-number/6DPJOIY6KH4ZBVR4SX55HH7MPK/events.json","paper":"https://pith.science/paper/6DPJOIY6"},"agent_actions":{"view_html":"https://pith.science/pith/6DPJOIY6KH4ZBVR4SX55HH7MPK","download_json":"https://pith.science/pith/6DPJOIY6KH4ZBVR4SX55HH7MPK.json","view_paper":"https://pith.science/paper/6DPJOIY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04757&json=true","fetch_graph":"https://pith.science/api/pith-number/6DPJOIY6KH4ZBVR4SX55HH7MPK/graph.json","fetch_events":"https://pith.science/api/pith-number/6DPJOIY6KH4ZBVR4SX55HH7MPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6DPJOIY6KH4ZBVR4SX55HH7MPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6DPJOIY6KH4ZBVR4SX55HH7MPK/action/storage_attestation","attest_author":"https://pith.science/pith/6DPJOIY6KH4ZBVR4SX55HH7MPK/action/author_attestation","sign_citation":"https://pith.science/pith/6DPJOIY6KH4ZBVR4SX55HH7MPK/action/citation_signature","submit_replication":"https://pith.science/pith/6DPJOIY6KH4ZBVR4SX55HH7MPK/action/replication_record"}},"created_at":"2026-05-18T02:09:54.006858+00:00","updated_at":"2026-05-18T02:09:54.006858+00:00"}