{"as_of":"2026-08-14T21:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db95bfb3a4416ca719b47ac76eae5eaf990e7e07c59d38bb13f6895b1e20a6d6","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T19:35:15.879167Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.06856/citation-record","integrity":"/paper/2608.06856/integrity","json":"/paper/2608.06856/citation-record.json","paper":"/paper/2608.06856"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.966630Z","title":"Temporal databases,","venue":null,"work_id":"17937121-f8be-4de6-94de-8066348a8456","year":1986},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.593696Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:aead171f9c3ec1d86a0ef539b24a23c801f0441c9b5ea80605345d11eeee3349","observation_id":"87509a4a-18fe-4f93-af18-b775d38db1c8","resolution":{"observed_at":"2026-08-10T19:35:16.971310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.949584Z","title":"Temporal data management–an overview,","venue":null,"work_id":"f29ba6d1-74b3-4455-8887-5a2a3b9a3b4b","year":2017},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.606330Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:365bcf5045fd71676946dee765c12ee64653a877810469acf4279a10fbaad63c","observation_id":"26e5a959-bfa4-4e17-8605-2a9c2ecac7e7","resolution":{"observed_at":"2026-08-10T19:35:16.955404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.932489Z","title":"Evaluating probabilistic queries over imprecise data,","venue":null,"work_id":"64c133d0-7584-44d7-9b10-34fc16435c0f","year":2003},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.611745Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:ce08b95b4599bf402c9c0e5cdb9b0e9e3163a871cc499610fcdc2140d0e456ea","observation_id":"c63f34c2-5030-4c85-b3f6-9d218ddb4c54","resolution":{"observed_at":"2026-08-10T19:35:16.937402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.916057Z","title":"Efficient query evaluation on probabilistic databases,","venue":null,"work_id":"f8b7e9bb-78bd-4299-835a-e28c0765aa89","year":2007},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.620450Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:078e8dcf5a638138b0d689576101ae19280c8adee433a364d18ad4c65606a5da","observation_id":"3379f720-de52-47ee-914c-46ff26c521b8","resolution":{"observed_at":"2026-08-10T19:35:16.922095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.902674Z","title":"Raster intervals: an approximation technique for polygon intersection joins,","venue":null,"work_id":"a1b9c467-aed3-4f44-82a4-fea75a9e2a38","year":2023},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.625379Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:51c73e3c1abeba603f403452bfbc066a88eab5b650f57891d3096b41645a3dd4","observation_id":"5579e543-ad66-4a92-9be7-89c44d3cf670","resolution":{"observed_at":"2026-08-10T19:35:16.907106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.886037Z","title":"Raster interval object approximations for spatial intersection joins,","venue":null,"work_id":"63173c20-6823-4304-99fc-017485848f98","year":2025},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.630272Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:7d0a370405f978a5d5dfe1f236fe75ed05d4debe62081e8b1215e0336ae7c854","observation_id":"26a958bb-c8e0-448c-b256-d3eb1a41539f","resolution":{"observed_at":"2026-08-10T19:35:16.890596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.868827Z","title":"A flexible spatio-temporal indexing scheme for large-scale gps track retrieval,","venue":null,"work_id":"0d5d20ec-2944-4ac6-a53b-4ac0e52dc79d","year":2008},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.638010Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:64399799d2370bc2e371506efd0cf2786010d59adc3450c4eb9075618daebbba","observation_id":"d6d65e36-9a39-459e-b855-a2308631864b","resolution":{"observed_at":"2026-08-10T19:35:16.873385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.853364Z","title":"Join operations in temporal databases,","venue":null,"work_id":"79c02d82-dcf9-4913-9a0a-74d12122e642","year":2005},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.643843Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:a3788f2bae1d2ced393d9c174ee4e33cbe3546198c96b9decb9e67f286e50f85","observation_id":"29753125-1b1c-4aff-a9a3-13583a94ad75","resolution":{"observed_at":"2026-08-10T19:35:16.859489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.835270Z","title":"A forward scan based plane sweep algo- rithm for parallel interval joins,","venue":null,"work_id":"61b929f7-12c7-459b-81a2-fb59a78b07b6","year":2017},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.650450Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:af88676b46bebf10d5a36131630b51eb62af53ecfcb0eda016fbdccf03bceb46","observation_id":"80ae0640-55ed-449c-82bb-68e220b7e66d","resolution":{"observed_at":"2026-08-10T19:35:16.840936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.814211Z","title":"In-memory interval joins,","venue":null,"work_id":"6de47477-1514-4bae-a8f3-28652b668af7","year":2021},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.655592Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:6f32ea4391939dccaba5f4c7f53286fbf692333823d115d015ecae16d539d06b","observation_id":"f9c3adca-e66d-4095-a62d-c5b6d078277a","resolution":{"observed_at":"2026-08-10T19:35:16.818658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.783203Z","title":"Leveraging range joins for the computation of overlap joins,","venue":null,"work_id":"d111f733-c1be-4613-9f5d-a1bac15934ba","year":2022},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.660988Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:6da494eaf8d156094e98f2efbdea1bd3cf5339f2f649cc7b626429bb38c9c452","observation_id":"bd36ae73-21ae-4eef-9ff1-22034ad3767d","resolution":{"observed_at":"2026-08-10T19:35:16.793060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.765597Z","title":"Overlap interval partition join,","venue":null,"work_id":"476d2fb6-de34-49a2-8d50-c9f8312252a5","year":2014},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.667389Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:41298434e403919a3d9b299746801284e7df5310b7fd8c26dab325686229806b","observation_id":"42ec1649-0737-49ef-80ea-117524173965","resolution":{"observed_at":"2026-08-10T19:35:16.770881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.750659Z","title":"An interval join optimized for modern hardware,","venue":null,"work_id":"7e881949-09d5-4944-b680-304b07cdcdec","year":2016},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.672944Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:443486ca53931a9ea199c67890e766780cf2f800c0087d1dd6a805f7be807fa3","observation_id":"556bd0bd-d60b-4459-b784-f9e41bf17aaa","resolution":{"observed_at":"2026-08-10T19:35:16.755240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.735010Z","title":"Distributed evaluation of top-k temporal joins,","venue":null,"work_id":"8cd85702-f419-47e0-8aff-b9dfb9674edc","year":2016},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.678611Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:93225fef69d6f37522b84eb3b1c043bbb44bc2ef2d25d223c853c384c20f653e","observation_id":"cb0b6022-f1e5-41a1-b327-4eab2d4f2638","resolution":{"observed_at":"2026-08-10T19:35:16.740071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.714086Z","title":"Query processing algorithms for temporal intersection joins,","venue":null,"work_id":"e6fd0a69-c7b1-40a0-84a0-771f89644e23","year":1991},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.686029Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:10122822b9b8975d4778c5463ffba42d42279f91d72940e7f8659971ed15f366","observation_id":"0e959475-7ea0-4ba8-87eb-064fd4f0ac57","resolution":{"observed_at":"2026-08-10T19:35:16.721347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.685763Z","title":"Band joins for interval data,","venue":null,"work_id":"64d41f55-07b4-48ee-ba83-b596e6ee2796","year":2020},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.692787Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:aa2d34d649bbda45de85b55198f6751089df155aaf314ccb01084703dc0d37ba","observation_id":"1bf9cbf0-a6fa-4e07-b2fa-baf9d61ba7cf","resolution":{"observed_at":"2026-08-10T19:35:16.694263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.668547Z","title":"Interval count semi-joins","venue":null,"work_id":"aa25e0f1-37e3-4a06-8a67-bef4485943e4","year":2018},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.701365Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:e04fb4cb1683d1303da4f5589d0c93cbb1a8b307b4f835418f4e1bc66b9803f2","observation_id":"5cfbd551-ae44-4598-884c-2d30da50cd79","resolution":{"observed_at":"2026-08-10T19:35:16.674356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.635651Z","title":"Cache-efficient sweeping-based interval joins for extended allen relation predicates,","venue":null,"work_id":"24c3ab33-ad3a-442f-bb9c-2cd3d80e57c6","year":2021},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.707413Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:5c9ff8fee6257493e2c93a29e70e1843da4bb52389b2de04adc229e4376dd321","observation_id":"63716960-8165-486f-8f7f-cd2dae37ebe8","resolution":{"observed_at":"2026-08-10T19:35:16.643308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.611310Z","title":"Scalable online interval join on modern multicore processors in openmldb,","venue":null,"work_id":"31147115-3fd3-4ff3-97ac-02f691ee6ae0","year":2023},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.713728Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:84126604987c41b6d43ce77837938da921aa72e7e4fe82bcb38d7601cc04ecc2","observation_id":"b5e1ef2c-1631-4d36-bfb0-21c2f14cc6e4","resolution":{"observed_at":"2026-08-10T19:35:16.621111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.588076Z","title":"A note on computing interval overlap statistics,","venue":null,"work_id":"9913d750-5ef5-4441-9a4d-bee4e6eb4338","year":2019},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.723909Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:1450adab397576cf81e5ea0a12d0484ada0f7bcac8e7d6645f81d4f174e09caa","observation_id":"ef750db3-ff29-4dd1-9a2e-1ed7a7b0c521","resolution":{"observed_at":"2026-08-10T19:35:16.593933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.570513Z","title":"Clinical application of overlapping confidence intervals for monitoring changes in serial clinicalchemistry test results,","venue":null,"work_id":"35858049-bf8a-4e7b-a49b-a0541ea8b063","year":2020},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.730525Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:d83f54d7e6a3c1bbc7f5d6076e6bf6191e257350236ea75b79fb8fd558b20023","observation_id":"c8c79e20-38cb-4108-b8a8-6d012b9d0195","resolution":{"observed_at":"2026-08-10T19:35:16.575760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.526759Z","title":"General interval-valued overlap functions and interval- valued overlap indices,","venue":null,"work_id":"2971bdb9-28d2-49cf-a9f2-966237c1aaad","year":2020},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.735119Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:2d681608ca3dc0882cc5946ca5a510b108be96ad090a2c0966f38c66611267c6","observation_id":"ef6d7f87-7440-47d8-b7ff-3ebd9800d4c5","resolution":{"observed_at":"2026-08-10T19:35:16.539282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.505259Z","title":"Estimating visited stores through positive-unlabeled learning,","venue":null,"work_id":"192cee39-e5a7-4285-b4b5-7aeb36ce9586","year":2024},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.739500Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:cb9c5f726e073f0a2a43342de95759df68fe7dbc72f5d65a22a087c9ff42b170","observation_id":"a474f2ca-8b8d-42ac-8294-5d7bc92731ce","resolution":{"observed_at":"2026-08-10T19:35:16.513745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.476828Z","title":"Target and non-target category classification from gps and check-in data,","venue":null,"work_id":"dd75af8d-1f2b-4c1d-85b2-4f628a81b1a0","year":2025},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.744853Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:553a1ed7fa85df9c02c74c23efd3469efac1828bba6f1ad955d7597054a34cf6","observation_id":"00dd757b-12ff-4481-bbd2-78ddd5ae15f1","resolution":{"observed_at":"2026-08-10T19:35:16.483870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.458913Z","title":"Independent range sampling on interval data,","venue":null,"work_id":"67d09201-d651-4e5f-9801-daebea613e35","year":2024},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.748771Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:9aad40b98109fecd17620cbf8636b295381547971daca10d2b210ae172266144","observation_id":"93725f9c-a8e9-41c3-9e42-8223643ad5e5","resolution":{"observed_at":"2026-08-10T19:35:16.465045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.08315","last_updated":"2024-05-22T07:06:36Z","snapshot_observed_at":"2026-08-13T00:08:20.429860Z","submitted_at":"2024-05-14T04:42:00Z","title":"Independent Range Sampling on Interval Data (Longer Version)","version":2},"cited_work":{"arxiv_id":"2405.08315","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.08315","snapshot_observed_at":"2026-08-10T19:35:15.969314Z","title":"Independent Range Sampling on Interval Data (Longer Version)","venue":"cs.DB","work_id":"3be9a47d-ef26-4f35-b06f-a82c27a19b5a","year":2024},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.753495Z"},"links":{"cited_paper":"/paper/2405.08315","citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:240bdfb5ed376b2a5c6ff7bbe906c15d1fc81b657b47d1e22f4663016199e8c5","observation_id":"ac22b108-535b-4c27-828b-97c1a4d091e9","resolution":{"observed_at":"2026-08-10T19:35:15.974634Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.440029Z","title":"Efficient algorithms for top-k stabbing queries on weighted interval data,","venue":null,"work_id":"688d84e3-959f-449f-88db-30260d57772f","year":2024},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.759050Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:13a73dce90f082dc174b8991a705cef2fc603e01f7099a689067a9d7a4769cae","observation_id":"12e581d3-cfd0-4597-ac42-3e38505a2bba","resolution":{"observed_at":"2026-08-10T19:35:16.448581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.421272Z","title":"Top-k range search on weighted interval data,","venue":null,"work_id":"f07c33ea-5c5c-46de-ad49-d2cfa608fccd","year":2025},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.767474Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:d8987ab11e7994425f1d1ca73c349fe5073b8ca11fbc389de17c7e9ca0f521ce","observation_id":"6e9da65b-689b-4b18-ad50-da421ebd1b61","resolution":{"observed_at":"2026-08-10T19:35:16.427898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.402737Z","title":"Hint on steroids: Batch query processing for interval data","venue":null,"work_id":"781f2b5b-e28d-4417-b640-7683ea1a5605","year":2024},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.773311Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:82adf6e788dda30b800f30bf59da041200e3f759df8991a097caf1665b73af64","observation_id":"d4c3a0b4-bb90-4261-a812-7e83d58adfdd","resolution":{"observed_at":"2026-08-10T19:35:16.411472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.385428Z","title":"Indexing temporal relations for range-duration queries,","venue":null,"work_id":"5bed1837-30db-49a6-8fae-17f60ca470f4","year":2025},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.783137Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:7b16a110e59f0f7cf813a96b310760bf52cb0e0de688794f6f8e6801b76b3fca","observation_id":"3f4ca5b9-3631-4b38-868e-3c208058fd46","resolution":{"observed_at":"2026-08-10T19:35:16.390626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.357673Z","title":"Optimal packing and covering in the plane are np-complete,","venue":null,"work_id":"c1be1008-0618-4607-b153-2df6606bcaf2","year":1981},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.789559Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:373c2ed5c3c861e24b99bd2cf1e9b21d829979d477439f364f52b9d6d6504f0a","observation_id":"b922c25e-c3ce-4140-98cc-7a586ecf9eb1","resolution":{"observed_at":"2026-08-10T19:35:16.369308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.05601","last_updated":"2024-05-22T06:55:38Z","snapshot_observed_at":"2026-08-13T00:11:48.195862Z","submitted_at":"2024-05-09T07:47:05Z","title":"Efficient Algorithms for Top-k Stabbing Queries on Weighted Interval Data (Full Version)","version":2},"cited_work":{"arxiv_id":"2405.05601","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.05601","snapshot_observed_at":"2026-08-10T19:35:15.930921Z","title":"Efficient Algorithms for Top-k Stabbing Queries on Weighted Interval Data (Full Version)","venue":"cs.DB","work_id":"7ccf777c-2434-4f02-a759-1190467d2381","year":2024},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.795434Z"},"links":{"cited_paper":"/paper/2405.05601","citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:47733e518f96e0fd37e8fcda47868371b35077fc54f574995bb24989ce40bc4d","observation_id":"f66108e4-6c20-4fa4-84ca-aba4fe4bb988","resolution":{"observed_at":"2026-08-10T19:35:15.941260Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.337849Z","title":"Relevance queries for interval data,","venue":null,"work_id":"9912abbd-5468-452d-bab6-3a7e10812568","year":2025},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.800592Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:d372b1d114da2fae95c05f61558931577c02f47897c22debae2361b0a39abbcb","observation_id":"2f3e3cf6-e4b7-4289-a5a3-154e5860ea9b","resolution":{"observed_at":"2026-08-10T19:35:16.344726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.312969Z","title":"Indexing temporal relations for range-duration queries,","venue":null,"work_id":"55390954-1459-4973-802b-28ace7fcae3a","year":2023},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.804782Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:475746a6887e65157d56d01e21daf39aeae3fa42398a375e3b0bc964f6adf9d5","observation_id":"8735e8b9-505c-456a-9263-a38aff46198e","resolution":{"observed_at":"2026-08-10T19:35:16.318326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.280426Z","title":"Disjoint interval partitioning,","venue":null,"work_id":"f4bd512f-7fa9-4958-98ff-333561209de5","year":2017},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.811064Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:b0c1a78369f3af2f73ebdca680bf570cc1384d0faa6f7dda087de60086673f62","observation_id":"01e55448-1693-4cb1-9433-4a3346288a73","resolution":{"observed_at":"2026-08-10T19:35:16.287678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.265245Z","title":"Edelsbrunner,Dynamic Rectangle Intersection Searching, 1980","venue":null,"work_id":"9ce504cf-d748-427e-aa97-83a53bdb17c3","year":1980},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.816690Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:62d06550ee5acda22d1fdef6bd1feb7b61414fe993c442c09ad1f525174da94c","observation_id":"6d164974-f719-4099-8e59-a9f3b0f6f6c5","resolution":{"observed_at":"2026-08-10T19:35:16.270175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.246277Z","title":"Timeline index: a unified data structure for processing queries on temporal data in sap hana,","venue":null,"work_id":"0bc67647-aa20-4037-b8f2-a404fdc0ce20","year":2013},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.822041Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:006ecb6d1640ca61b32340644cf243ce130a4f48ed422c6fec941c7afe557224","observation_id":"849eef9d-25d6-4001-bcea-f76ea47bd6a1","resolution":{"observed_at":"2026-08-10T19:35:16.253197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.213706Z","title":"Sap hana database: Data management for modern business applica- tions,","venue":null,"work_id":"64c9400e-e575-491d-953c-4bbb98a22a19","year":2012},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.827377Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:5edab8f0fc5a96e78fb5c30d022600c40f2fa22f23d521abe20971bea6515758","observation_id":"3011fa26-d2b9-4922-ad57-f3af6f81da97","resolution":{"observed_at":"2026-08-10T19:35:16.224806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.189934Z","title":"Hint: a hierarchical interval index for allen relationships,","venue":null,"work_id":"daf0ff06-fc48-4c81-a933-a94e52269cff","year":2023},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.832347Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:3fc4c733e92ba24d7c6617ea64c342dd624f310d095f34d7a9cec7eb08561b7d","observation_id":"0bdfffb3-181c-4677-a7fc-df9798e50f8f","resolution":{"observed_at":"2026-08-10T19:35:16.196666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.169466Z","title":"Hint: A hierarchical index for intervals in main memory,","venue":null,"work_id":"d0082b3e-b901-4718-bd70-401e13e4148c","year":2022},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.839911Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:41adb2a9864d779a9f251f9eb699550c7862eecf71d8820f49cd0a6d0a0d3b52","observation_id":"796217ca-1772-4bd1-b9c4-fc09ac04534a","resolution":{"observed_at":"2026-08-10T19:35:16.175539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.148264Z","title":"Tide: Indexing time intervals by duration and endpoint,","venue":null,"work_id":"eb56f316-058d-43cb-9846-b20a90ebc3c3","year":2025},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.847384Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:a82c1259167dee722962a55b87931192b20b75fa2adfd511d8943829acd76e33","observation_id":"ebc09a7b-33e0-420c-bb03-ac67ec434ead","resolution":{"observed_at":"2026-08-10T19:35:16.157405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.122770Z","title":"Period index: A learned 2d hash index for range and duration queries,","venue":null,"work_id":"bbe237ec-bd20-4519-9425-ad8a25942fa2","year":2019},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.852889Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:648d83c77a37820e8c703830de7fbaa46e4dd75dd5b969be5c9c93c182739c37","observation_id":"d29b915b-0e8e-456b-83f8-ae2bfa3d29af","resolution":{"observed_at":"2026-08-10T19:35:16.133861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.096473Z","title":"Firas: A frame- work for interval range search and sampling,","venue":null,"work_id":"0297ee25-9f3d-4e16-915a-676bd79db613","year":2026},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.859403Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:3c5d4026868adff5cf0bd5357665935a14ca50e0a28f5b9bd74097aa0c604cbc","observation_id":"457bb987-755e-4959-b938-e1e4eb99eadd","resolution":{"observed_at":"2026-08-10T19:35:16.109439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.073729Z","title":"Efficiently answer top-k queries on typed intervals,","venue":null,"work_id":"207266fa-e1e7-4c13-93be-8ec8995f1224","year":2017},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.864234Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:0876ad242edf73801366bb799cb0bd68d2f8f8159be48467d2c0e2be29640180","observation_id":"c1379243-1b2f-401f-909a-1f17343354b7","resolution":{"observed_at":"2026-08-10T19:35:16.081348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.045015Z","title":"Efficient algorithms for top-k range search on weighted interval data,","venue":null,"work_id":"b1610ac7-1ed9-478e-8b9a-086020f2d1d6","year":2026},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.869320Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:86b942d2988224d13293b67abdc53c37d58f6f27b1ffb8156178182fa596602f","observation_id":"78688daa-cc51-48fa-ac4b-05e384619d82","resolution":{"observed_at":"2026-08-10T19:35:16.051476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:16.020285Z","title":"Fast indexing for temporal information retrieval,","venue":null,"work_id":"6b18a90c-cfcb-4c6f-9cb6-39f0c1912e7e","year":2025},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.873311Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:34b3616df1c7a65082a37df2595c16167331b688afea3ed14edce58b7ff5239c","observation_id":"a0878ddc-4b5d-4162-b5f0-b3abd60388c9","resolution":{"observed_at":"2026-08-10T19:35:16.025787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:35:15.999396Z","title":"Computing complex temporal join queries efficiently,","venue":null,"work_id":"9549d69a-c405-4b91-909c-4dbe4ae4f046","year":2022},"citing_paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T19:35:15.879167Z"},"links":{"citing_paper":"/paper/2608.06856"},"observation_digest":"sha256:92bf9713558b7fcfa50c4187b8da6d86ecc0721204b90d3113e68209b7fe816f","observation_id":"8de054e5-bc4c-4a61-a9c3-066b89e787bb","resolution":{"observed_at":"2026-08-10T19:35:16.006947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.06856","last_updated":"2026-08-07T06:29:14Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-12T23:11:25.103579Z","submitted_at":"2026-08-07T06:29:14Z","title":"Duration-constrained Interval Joins"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":45},"total_outbound_references":47},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2608.06856."}