{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ACA3BEEN65HW4YQSDO4XAGLJHI","short_pith_number":"pith:ACA3BEEN","canonical_record":{"source":{"id":"1808.02291","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-07T10:17:11Z","cross_cats_sorted":["cs.DB","cs.LO"],"title_canon_sha256":"aa917a3481242190bb4f5ae298b2a6458da799b4826c28be6c196461529794b6","abstract_canon_sha256":"5ea817565318a888accf72f05b385a049d00c57f4b8eed92476a13ea8ae71301"},"schema_version":"1.0"},"canonical_sha256":"0081b0908df74f6e62121bb97019693a31e15128b385a939bdaa58f3b5b31f4e","source":{"kind":"arxiv","id":"1808.02291","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02291","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02291v3","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02291","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"ACA3BEEN65HW","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ACA3BEEN65HW4YQS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ACA3BEEN","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ACA3BEEN65HW4YQSDO4XAGLJHI","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02291","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-07T10:17:11Z","cross_cats_sorted":["cs.DB","cs.LO"],"title_canon_sha256":"aa917a3481242190bb4f5ae298b2a6458da799b4826c28be6c196461529794b6","abstract_canon_sha256":"5ea817565318a888accf72f05b385a049d00c57f4b8eed92476a13ea8ae71301"},"schema_version":"1.0"},"canonical_sha256":"0081b0908df74f6e62121bb97019693a31e15128b385a939bdaa58f3b5b31f4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:39.329713Z","signature_b64":"QhGFov50DfvKmBKgzrmevBPwryZREb7ZrrwdfPhnJk3kFCSiupfWzoIMxNj8Cvhu3fmYrm1XisXm0C4EFqCWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0081b0908df74f6e62121bb97019693a31e15128b385a939bdaa58f3b5b31f4e","last_reissued_at":"2026-05-18T00:00:39.329238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:39.329238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02291","source_version":3,"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-18T00:00:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tfmzrdhonZh7zl8EcO/XuLe3FUdsoMZEFxlfjFNxSBFVKC/Pd/YIoKqd6si/8E08chg+ImzGAP8sjCZ5EHNdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:06:09.147991Z"},"content_sha256":"1892d45e26f5020412821f52c679ba4b581f0efdc6e81eaf61aec0d8deadd582","schema_version":"1.0","event_id":"sha256:1892d45e26f5020412821f52c679ba4b581f0efdc6e81eaf61aec0d8deadd582"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ACA3BEEN65HW4YQSDO4XAGLJHI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Window Validity Problem in Rule-Based Stream Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LO"],"primary_cat":"cs.AI","authors_text":"Alessandro Ronca, Bernardo Cuenca Grau, Ian Horrocks, Mark Kaminski","submitted_at":"2018-08-07T10:17:11Z","abstract_excerpt":"Rule-based temporal query languages provide the expressive power and flexibility required to capture in a natural way complex analysis tasks over streaming data. Stream processing applications, however, typically require near real-time response using limited resources. In particular, it becomes essential that the underpinning query language has favourable computational properties and that stream processing algorithms are able to keep only a small number of previously received facts in memory at any point in time without sacrificing correctness. In this paper, we propose a recursive fragment of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02291","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"},"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-18T00:00:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uiaspE3dnQUWgUBwwgSeQQFGtDCyko7HrOkVh3BB6Hx3JTqdVg+aM5AQNc0mLMMBBLAvSuXbM/PM0viFFgPgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:06:09.148354Z"},"content_sha256":"3ed772af353e4645ed3716be65009a37953fb0bc2846822a74986a5d14125389","schema_version":"1.0","event_id":"sha256:3ed772af353e4645ed3716be65009a37953fb0bc2846822a74986a5d14125389"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACA3BEEN65HW4YQSDO4XAGLJHI/bundle.json","state_url":"https://pith.science/pith/ACA3BEEN65HW4YQSDO4XAGLJHI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACA3BEEN65HW4YQSDO4XAGLJHI/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-06-04T11:06:09Z","links":{"resolver":"https://pith.science/pith/ACA3BEEN65HW4YQSDO4XAGLJHI","bundle":"https://pith.science/pith/ACA3BEEN65HW4YQSDO4XAGLJHI/bundle.json","state":"https://pith.science/pith/ACA3BEEN65HW4YQSDO4XAGLJHI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACA3BEEN65HW4YQSDO4XAGLJHI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ACA3BEEN65HW4YQSDO4XAGLJHI","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":"5ea817565318a888accf72f05b385a049d00c57f4b8eed92476a13ea8ae71301","cross_cats_sorted":["cs.DB","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-07T10:17:11Z","title_canon_sha256":"aa917a3481242190bb4f5ae298b2a6458da799b4826c28be6c196461529794b6"},"schema_version":"1.0","source":{"id":"1808.02291","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02291","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02291v3","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02291","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"ACA3BEEN65HW","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ACA3BEEN65HW4YQS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ACA3BEEN","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:3ed772af353e4645ed3716be65009a37953fb0bc2846822a74986a5d14125389","target":"graph","created_at":"2026-05-18T00:00:39Z","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":"Rule-based temporal query languages provide the expressive power and flexibility required to capture in a natural way complex analysis tasks over streaming data. Stream processing applications, however, typically require near real-time response using limited resources. In particular, it becomes essential that the underpinning query language has favourable computational properties and that stream processing algorithms are able to keep only a small number of previously received facts in memory at any point in time without sacrificing correctness. In this paper, we propose a recursive fragment of","authors_text":"Alessandro Ronca, Bernardo Cuenca Grau, Ian Horrocks, Mark Kaminski","cross_cats":["cs.DB","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-07T10:17:11Z","title":"The Window Validity Problem in Rule-Based Stream Reasoning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02291","kind":"arxiv","version":3},"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:1892d45e26f5020412821f52c679ba4b581f0efdc6e81eaf61aec0d8deadd582","target":"record","created_at":"2026-05-18T00:00:39Z","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":"5ea817565318a888accf72f05b385a049d00c57f4b8eed92476a13ea8ae71301","cross_cats_sorted":["cs.DB","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-07T10:17:11Z","title_canon_sha256":"aa917a3481242190bb4f5ae298b2a6458da799b4826c28be6c196461529794b6"},"schema_version":"1.0","source":{"id":"1808.02291","kind":"arxiv","version":3}},"canonical_sha256":"0081b0908df74f6e62121bb97019693a31e15128b385a939bdaa58f3b5b31f4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0081b0908df74f6e62121bb97019693a31e15128b385a939bdaa58f3b5b31f4e","first_computed_at":"2026-05-18T00:00:39.329238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:39.329238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QhGFov50DfvKmBKgzrmevBPwryZREb7ZrrwdfPhnJk3kFCSiupfWzoIMxNj8Cvhu3fmYrm1XisXm0C4EFqCWAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:39.329713Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02291","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1892d45e26f5020412821f52c679ba4b581f0efdc6e81eaf61aec0d8deadd582","sha256:3ed772af353e4645ed3716be65009a37953fb0bc2846822a74986a5d14125389"],"state_sha256":"19987b2beeb5cd13ad5b3b82416db0bd61a468b140a2149bb36892611351eb8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2CfVXrsuIJla0C2OHTCK3cWQh9kCrELcciYlIA1k2YbNF9klnNSYFA6NLnQJuPz6ISFqhLFwtDayu4wkbcpiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T11:06:09.150865Z","bundle_sha256":"2fa931cdf51dc23041ff2c359084c6a0b767366d48209f2eef9a4eb351afff78"}}