{"as_of":"2026-08-08T01:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:77c17ab7d179574d7564c56628da87b0f67328ac32650a71082ce6673c2ebabe","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T10:14:48.573532Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2607.20356/citation-record","integrity":"/paper/2607.20356/integrity","json":"/paper/2607.20356/citation-record.json","paper":"/paper/2607.20356"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:41.381235Z","title":"Emptyheaded: A relational engine for graph processing","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:41.381235Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:dc88a43fc6e2e694f55a36cdb974770dcadff52e6c8749cd4e2ee64db6c75f5a","observation_id":"f59abcf3-7cb8-4ec9-b60e-15197d7bea9d","resolution":{"observed_at":"2026-08-01T10:14:41.381235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:41.472384Z","title":"The complexity of boolean conjunctive queries with intersection joins","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:41.472384Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:acded2b2b88209f1908698ceef40646a5ded4f986e8965fbdd774e8c4f77b7f8","observation_id":"3b826eb8-957f-4623-8217-81daba703a03","resolution":{"observed_at":"2026-08-01T10:14:41.472384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:41.619008Z","title":"What do Shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? InProc","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:41.619008Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:7c323793e3146ddac13fe1b4716566bdf5d529fbb81f8463e6a1abba8d854215","observation_id":"6991e996-aaae-4db3-88d5-75e4822fee60","resolution":{"observed_at":"2026-08-01T10:14:41.619008Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:41.762544Z","title":"Index maintenance for time-travel text search","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:41.762544Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:0b692f1192c5f4ad70bd07049d190a0a0a82cf03c3a85513bd49004ce8fc8972","observation_id":"0afb6c3c-2218-4d66-9535-e3704f095ffa","resolution":{"observed_at":"2026-08-01T10:14:41.762544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:41.906281Z","title":"Foundations of modern query languages for graph databases","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:41.906281Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:2ac235576701e69e62441af8b99bec064be88bde5a4e72adb5487cab80b64cda","observation_id":"b62fdaa8-0ba7-460d-8fa8-caafa70d3d87","resolution":{"observed_at":"2026-08-01T10:14:41.906281Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:42.051380Z","title":"Temporal regular path queries","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:42.051380Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:2375d78f438716f3dd311fe7d80cb8a468b0c9aef7a715cd475eeb97f996b6c4","observation_id":"43d30dff-3227-4afd-876f-f112e2a1d20c","resolution":{"observed_at":"2026-08-01T10:14:42.051380Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:42.190000Z","title":"CompactLTJ: Space & time efficient Leapfrog Triejoin on graph databases.The Very Large Databases Journal, 34:article 67, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:42.190000Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:c82bb273c28feaf70344f9fc91aedf50db28d933c6400a26e35584c8be99ea8c","observation_id":"63e86371-2f64-4b5f-8fc8-2fa8faa72c10","resolution":{"observed_at":"2026-08-01T10:14:42.190000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:42.386669Z","title":"Reutter, Javiel Rojas-Ledesma, and Adriá Soto","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:42.386669Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:761b34f23e0504328fbcc8fc07e6bfa68e52cb726104eeada5196ae209ddddd6","observation_id":"fe7cf0d1-5b78-482f-b17d-31430a85894c","resolution":{"observed_at":"2026-08-01T10:14:42.386669Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:42.519852Z","title":"Size bounds and query plans for relational joins.SIAM Journal on Computing, 42(4):1737–1767, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:42.519852Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:dd04e358f6a199bb2369cf09dd4271090c06fe241a06356d129558e54b20628e","observation_id":"c02b8d3e-9643-4167-bbf2-75e06fa789ef","resolution":{"observed_at":"2026-08-01T10:14:42.519852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:42.638013Z","title":"A time machine for text search","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:42.638013Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:c59b6cd2e837b1f53b48bcd1d84f9ca4f7c09017bf8c360b9a8a7bc4ac264ff2","observation_id":"ba465c5b-bb7d-44d1-88ba-f95116482a6c","resolution":{"observed_at":"2026-08-01T10:14:42.638013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:42.752361Z","title":"Temporal statement modifiers.ACM Transactions on Database Systems, 25(4):407–456, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:42.752361Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:a7e1968c50688af1d9903d11ebbabf7b309e72000d5e84ca4b3aca15b34cd405","observation_id":"4e96fcf1-ccc5-43ec-bceb-25884cb8d8f4","resolution":{"observed_at":"2026-08-01T10:14:42.752361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:42.886930Z","title":"Demaine, J","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:42.886930Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:a813afd1c228171764e6a8c3066fe58a6284fababad2f154e78b491277d1bfcc","observation_id":"c30bf67a-0985-4989-9708-ca1dda5d29a5","resolution":{"observed_at":"2026-08-01T10:14:42.886930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.08236","last_updated":"2022-01-16T05:43:49Z","snapshot_observed_at":"2026-08-03T07:37:46.835328Z","submitted_at":"2022-01-16T05:43:49Z","title":"Temporal Knowledge Graph Completion: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.08236","snapshot_observed_at":"2026-08-01T10:14:43.047511Z","title":"Temporal knowledge graph completion: A survey.arXiv preprint arXiv:2201.08236, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:43.047511Z"},"links":{"cited_paper":"/paper/2201.08236","citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:bb739d4e92e8df1301f650ea5c6cdf06b15e34a2c406daaa62df33156cef0675","observation_id":"c57ec377-e4b1-42e3-a134-5f94e096ae2b","resolution":{"observed_at":"2026-08-01T10:14:43.047511Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.04782","last_updated":"2024-03-02T16:21:45Z","snapshot_observed_at":"2026-07-06T17:41:10.677334Z","submitted_at":"2024-03-02T16:21:45Z","title":"A Survey on Temporal Knowledge Graph: Representation Learning and Applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.04782","snapshot_observed_at":"2026-08-01T10:14:43.187548Z","title":"A survey on temporal knowledge graph: Representation learning and applications","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:43.187548Z"},"links":{"cited_paper":"/paper/2403.04782","citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:ad7b599168ef9408843f582eabcb4a7c3cbae537b6684ccbd887beb56b91ace2","observation_id":"b1fee889-80c3-49bc-8d8f-b6454c314e77","resolution":{"observed_at":"2026-08-01T10:14:43.187548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:43.294116Z","title":"Indexing temporal relations for range-duration queries","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:43.294116Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:ce89c8327c08e13aa9aace829d2c5ac6449017edd1b89c790a7984ff32e1c8d2","observation_id":"32241c25-aacc-46c4-a9f7-49ee09d8d620","resolution":{"observed_at":"2026-08-01T10:14:43.294116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:43.427184Z","title":"Chan, Kasper G","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:43.427184Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:772baca4972708f6fe087bd79c093b6bf96845bba0adc6b58707b035da1cb897","observation_id":"ae4825d5-4ac3-45ec-933a-43d2aa9f04c7","resolution":{"observed_at":"2026-08-01T10:14:43.427184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:43.498386Z","title":"Clark.Compact PAT Trees","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:43.498386Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:e5d5e7cc398512a035cedca4d038381f3046e346cae4559646c6597c0bd8424a","observation_id":"2f936bb9-9ed6-4383-83de-86b0eb402cd1","resolution":{"observed_at":"2026-08-01T10:14:43.498386Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:43.630742Z","title":"The wavelet matrix: An efficient wavelet tree for large alphabets.Information Systems, 47:15–32, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:43.630742Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:7b00e0ece7cbc5ea8f1df893ab8b088ff940ce13d6059f5bc51646733429c18c","observation_id":"71686e66-789f-462b-a0ca-9bff202411ff","resolution":{"observed_at":"2026-08-01T10:14:43.630742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:43.713306Z","title":"On completeness of historical relational data models","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:43.713306Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:e92b12f1eced11292f841ffad20a110dd719645e9b76f471d1112bb6a9da2d50","observation_id":"cddb0e19-48f9-400c-bbe8-40d5f704ec48","resolution":{"observed_at":"2026-08-01T10:14:43.713306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:43.844295Z","title":"Versioned queries over RDF archives: All you need is SPARQL? InMEPDaW@ ISWC, pages 43–52, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:43.844295Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:b60c1681c5b5019eb4314d0454c9de90524d6326276ed11c5c4d155284a921ec","observation_id":"030855f8-0668-46d5-a75c-f8e0a5255108","resolution":{"observed_at":"2026-08-01T10:14:43.844295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:43.966056Z","title":"Temporal alignment","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:43.966056Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:df0b98c8144a95e54ee3bceebf58c4c5fbfff0608e94626c0d9c6fc350ee0c8a","observation_id":"f0f35c6c-de00-40d4-8467-8f9330ed3fbe","resolution":{"observed_at":"2026-08-01T10:14:43.966056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:44.103311Z","title":"A researcher’s digest of GQL","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:44.103311Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:394f4df3f1b728881042d922652addff95b3aa4fd08dbcfefdff1d7d2c563229","observation_id":"4b5710dd-a6f4-425b-a38a-c21685b09842","resolution":{"observed_at":"2026-08-01T10:14:44.103311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:44.213657Z","title":"Freitag, Maximilian Bandle, Tobias Schmidt, Alfons Kemper, and Thomas Neumann","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:44.213657Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:fe8b49a9685f338ea1905d5c88a89645ecd03ea6361613fd41f2addc88fde24e","observation_id":"2b44b0e8-e7f8-4fe2-a3e0-d6ebc8dd13db","resolution":{"observed_at":"2026-08-01T10:14:44.213657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:44.325233Z","title":"Time-respecting flow graph pattern matching on temporal graphs.IEEE Trans- actions on Knowledge and Data Engineering, 33(10):3453–3467, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:44.325233Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:793eb6b2e91a1881c18e60aeaab764cf8223b5ef9c26c9dedb363787f41af42a","observation_id":"be6c262d-7f1d-40f2-96c3-9f36ebd58de2","resolution":{"observed_at":"2026-08-01T10:14:44.325233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:44.421302Z","title":"Eventkg: A multilingual event-centric temporal knowledge graph","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:44.421302Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:41bd8e31a61d20da4f1953ab728838295c53256ff3ba07cfd56dfb3631d1a661","observation_id":"4d667a7c-bd6d-4558-be9e-87cc82868931","resolution":{"observed_at":"2026-08-01T10:14:44.421302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:44.568050Z","title":"Multi-temporal RDF ontology versioning","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:44.568050Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:1335bfbe58cf86771e8eb57e8716f2de2e92717390398670f7e10fb59e33986e","observation_id":"d5bdec6b-240c-46f8-8667-4c30f7152333","resolution":{"observed_at":"2026-08-01T10:14:44.568050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:44.684722Z","title":"T-SPARQL: A TSQL2-like temporal query language for RDF","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:44.684722Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:9b37706780fe39d175fcd869b1c515d6e617f3775483e9096844f13cbd6a01af","observation_id":"fbca0644-b41e-4fee-9d2e-69cbcb9f531f","resolution":{"observed_at":"2026-08-01T10:14:44.684722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:44.780633Z","title":"A worst-case optimal join algorithm for SPARQL","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:44.780633Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:223f227c1c85f2c45aa2573960402f909010cbaae48b153711eb9db9ad6c1ee1","observation_id":"a086511d-e226-44a1-a6bf-f5131e8c5097","resolution":{"observed_at":"2026-08-01T10:14:44.780633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:44.916702Z","title":"An efficient and scalable graph database with built-in temporal support: J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:44.916702Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:ddcc8b355b5d51a68e377653277d8e3f50e9074b2debbd2ba30aa97615a97e76","observation_id":"12fa1689-b710-4a55-9b1d-de76195ddbcd","resolution":{"observed_at":"2026-08-01T10:14:44.916702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:45.010464Z","title":"Agarwal, and Jun Yang","venue":null,"work_id":null,"year":2076},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:45.010464Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:874201e846755b359e6c268aa22be4ebaa86b281ce131084b2f1a48f2025f037","observation_id":"21cf3105-2e17-4f06-aaf7-c38de4c107d0","resolution":{"observed_at":"2026-08-01T10:14:45.010464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:45.116343Z","title":"TeMatch: A fast temporal sub- graph matching framework with temporal-aware subgraph matching algorithms","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:45.116343Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:e160dda4548796041b0864e52db0675aec92914f07b148a197374ff91b600899","observation_id":"cad5983b-1438-4f01-b6f8-f24217d798cc","resolution":{"observed_at":"2026-08-01T10:14:45.116343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:45.219732Z","title":"Space-efficient static trees and graphs","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:45.219732Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:4f69a34bb3d120fdfe9b08ee6f346c5c0281f668ed116705e3d5aa4b8962bbe7","observation_id":"7318ee12-f1ed-4d4c-a777-9f0318f0d783","resolution":{"observed_at":"2026-08-01T10:14:45.219732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:45.314319Z","title":"Khamis, Hung Q","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:45.314319Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:ca37d2a6f51ed02dcbb55c7e97a7a74a441c1b8ecf731cda9e6d6b280de35e4b","observation_id":"720467af-19fd-4455-829e-f6d14be9e01e","resolution":{"observed_at":"2026-08-01T10:14:45.314319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:45.471551Z","title":"Storing and analyzing historical graph data at scale","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:45.471551Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:df4228e74dc3d55ebaa63ad0efd1c1c792e19cebe1ab02a565e30eb7fc8e378b","observation_id":"49ffc2dd-c017-4146-9f49-c32d95a27c79","resolution":{"observed_at":"2026-08-01T10:14:45.471551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:45.641665Z","title":"Modeling and querying metadata in the semantic sensor web: The model stRDF and the query language stSPARQL","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:45.641665Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:a5203b753b19aa8813f2bbebd14971c07926466dc200e643a485530bcad0e9bb","observation_id":"306242f0-fa28-4e21-9b31-ce6734b22f39","resolution":{"observed_at":"2026-08-01T10:14:45.641665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:45.803149Z","title":"Managing intervals effi- ciently in object-relational databases","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:45.803149Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:c627f6fd12aa25e18853117192646a0f05fc160c9e9518eec2a027e84d144c3b","observation_id":"5c53992d-1494-4575-afd8-b2ab81103950","resolution":{"observed_at":"2026-08-01T10:14:45.803149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:45.919965Z","title":"Temporal features in SQL: 2011.ACM Sigmod Record, 41(3):34–43, 2012","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:45.919965Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:6ef7c15487a87ba127bd628b0692b3814522450549a9f1e81495137cf9726150","observation_id":"e1687a31-b4e7-4bb5-aa62-1fb460e78401","resolution":{"observed_at":"2026-08-01T10:14:45.919965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:46.086701Z","title":"Durable subgraph matching on tem- poral graphs.IEEE Transactions on Knowledge and Data Engineering, 35(5):4713– 4726, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:46.086701Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:4bc0aa3362be5f373337446260fd8e7e0bc136fbdfdde28a1d76684c95f36e4e","observation_id":"9eb73680-c32d-4758-a0d0-56cb23b69797","resolution":{"observed_at":"2026-08-01T10:14:46.086701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:46.198184Z","title":"Temporal multi-query subgraph matching in cybersecurity.Technologies, 13(8):335, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:46.198184Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:cd6ef8cf18ccec2b9eaa291333f5e56f7417c50f70599d628e9bc2ab5ba44df4","observation_id":"7afd9ad2-e25a-4857-a0c6-4825dc13e521","resolution":{"observed_at":"2026-08-01T10:14:46.198184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:46.325085Z","title":"Getting the most out of Wikidata: Semantic technology usage in Wikipedia’s knowledge graph","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:46.325085Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:bf9e1f3c590053d4401cd7af24f15e8d0174b083db6b20e0fc60b06f2bdd64e3","observation_id":"b74bec9e-8a25-48d7-a7f4-ab25402db55b","resolution":{"observed_at":"2026-08-01T10:14:46.325085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:46.420762Z","title":"Optimizing subgraph queries by combin- ing binary and worst-case optimal joins.Proceedings of the VLDB Endowment, 12(11):1692–1704, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:46.420762Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:b8b0abff5d2dfabab506a12c6ccba3dec8db9603cac3f6f2d780df40290c8e59","observation_id":"a075bfd3-7312-4462-830e-0ce0a9246d15","resolution":{"observed_at":"2026-08-01T10:14:46.420762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:46.535395Z","title":"Temporal graph algebra","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:46.535395Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:24d4580a8e5296dd2631e0c5d462d3277e95f0fedcf39584ab8292cd59ca9048","observation_id":"8a5122ed-da92-4849-b9a3-2111f2294408","resolution":{"observed_at":"2026-08-01T10:14:46.535395Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:46.647046Z","title":"Ian Munro","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:46.647046Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:78ef0b778d38f6a8c4b0a17f0e12e27fc5edc267b36f044c525c59f35454e5a3","observation_id":"1a528242-ecc8-4fb9-a18f-c257f84e8b18","resolution":{"observed_at":"2026-08-01T10:14:46.647046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:46.788893Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:46.788893Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:bcdef7587e814cc19718b8b385b05376ce6edc1ed6bdc7d7d5a63f6787c06816","observation_id":"7cb5682a-f99a-4199-bbac-59e3b8513dce","resolution":{"observed_at":"2026-08-01T10:14:46.788893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:46.904648Z","title":"Ngo, Ely Porat, Cristopher Ré, and Atri Rudra","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:46.904648Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:d8e58fc1b879fff0bb2e0677b0bc6b5b683596b8e1edbf73400b3641c23bdf4c","observation_id":"90125516-fe83-43c3-b23e-5c8da6a78156","resolution":{"observed_at":"2026-08-01T10:14:46.904648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:47.045581Z","title":"Motifs in temporal networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:47.045581Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:e3a17ac2a02d4605a10fdc8870085921c2d03ac317f68b534610642531e8c22b","observation_id":"87db4c0d-3469-4002-bf33-a86aa5f7aa4c","resolution":{"observed_at":"2026-08-01T10:14:47.045581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:47.157365Z","title":"GLENDA: Querying RDF archives with full SPARQL","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:47.157365Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:86aac2e852c4ee94950876aafaa9cf6fe9ded2a87c04192b101ab805af01f5d7","observation_id":"63823115-c7df-4f41-b7d2-691f9dff5692","resolution":{"observed_at":"2026-08-01T10:14:47.157365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:47.321496Z","title":"SPARQL-st: Extending SPARQL to support spatiotemporal queries","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:47.321496Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:7e697c9775a1e4bd66bdc3c5bcb63be1708b5c8c9e32fd9da70129932d599d9c","observation_id":"8da177ba-9b86-4b05-a283-2b203f770df4","resolution":{"observed_at":"2026-08-01T10:14:47.321496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:47.465964Z","title":"Top-𝑘 durable graph pattern queries on temporal graphs.IEEE Transactions on Knowledge and Data Engineer- ing, 31(1):181–194, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:47.465964Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:91f2c9b7570df891c9430a6fbe0e32bc104da1f8551f99b5ca57b7b1293d5ae1","observation_id":"8d8f0b83-17c2-4884-a0eb-2cf8b48e4089","resolution":{"observed_at":"2026-08-01T10:14:47.465964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:47.613897Z","title":"The temporal query language TQuel.ACM Transactions on Database Systems, 12(2):247–298, 1987","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:47.613897Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:f88314cc09d20fbc770913ba91f80c50f648b0353b1f6f26ef434a4d888682d6","observation_id":"57c5b4ec-7a72-48b1-a28b-b5e5c4c47583","resolution":{"observed_at":"2026-08-01T10:14:47.613897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:47.735549Z","title":"Veldhuizen","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:47.735549Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:b506610769d22edfdc57f59bb4a83e81e62233e234e234a5456d1db684249838","observation_id":"d0045c07-bbe6-4082-abc8-aa790d8b6562","resolution":{"observed_at":"2026-08-01T10:14:47.735549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:47.846410Z","title":"Wikidata: a free collaborative knowl- edgebase.Commun","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:47.846410Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:94e7bd5827e13dc22d69e9053bf5e7697101380708de12cd80ba3ad7bc79431d","observation_id":"60691047-4a07-4815-a258-e44dd3bd8368","resolution":{"observed_at":"2026-08-01T10:14:47.846410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:47.975637Z","title":"ADOPT: Adaptively optimizing attribute orders for worst-case optimal join algorithms 13 via reinforcement learning.Proceedings of the VLDB Endowment, 16(11):2805– 2817, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:47.975637Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:d8e255544ad4ff9dbe15c00c768768ac03829d9c7397be4cf1819c6537579f8b","observation_id":"13600ad3-400d-430d-8327-d86a54f47fa8","resolution":{"observed_at":"2026-08-01T10:14:47.975637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:48.140073Z","title":"Free Join: Unifying worst-case optimal and traditional joins.Proceedings of the ACM on Management of Data (SIGMOD), 1(2):150:1–150:23, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:48.140073Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:2d8e66ab092386df95d1aace60616b4be7fa0de9f3864d65557104b28aeeff5c","observation_id":"d4f553eb-d62f-44b3-8fba-e45f7e5d9d75","resolution":{"observed_at":"2026-08-01T10:14:48.140073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:48.266795Z","title":"Path problems in temporal graphs.Proceedings of the VLDB Endowment, 7(9):721–732, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:48.266795Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:8d9d5c92d54c64118ad077579422e512c60ceaf4ac525946d7e9282df13cce12","observation_id":"f90ecf76-152a-4e30-a8cd-cd00aaefe357","resolution":{"observed_at":"2026-08-01T10:14:48.266795Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:48.401199Z","title":"Algorithms for acyclic database schemes","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:48.401199Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:1c6be9956c9ca03d579bf46f9af027e0109697b47248d4bddcf564a6f81f04cb","observation_id":"938bb174-db4b-4014-9f9d-2037d6edb41f","resolution":{"observed_at":"2026-08-01T10:14:48.401199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:48.573532Z","title":"join-first","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:48.573532Z"},"links":{"citing_paper":"/paper/2607.20356"},"observation_digest":"sha256:10a8fcf443927b9832e11b9c6af48bd472cbc356ce72ea97636fac281f4d1bed","observation_id":"08c47db3-fe2b-48c2-ab92-10381a186293","resolution":{"observed_at":"2026-08-01T10:14:48.573532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.20356","last_updated":"2026-07-22T16:43:03Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-03T23:49:58.906780Z","submitted_at":"2026-07-22T16:43:03Z","title":"Worst-Case Optimal BGPs on Temporal Graphs"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":57,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":57},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2607.20356."}