{"as_of":"2026-08-14T19:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9a1a480805dd9a0f98dc4897e0b550441d8ca9c5ab28b7953664d7c0b98f1bec","coverage":[{"denominator":69,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":69,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T15:05:04.636291Z","state":"measured"},{"denominator":69,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":69,"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/2507.17215/citation-record","integrity":"/paper/2507.17215/integrity","json":"/paper/2507.17215/citation-record.json","paper":"/paper/2507.17215"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:04.070306Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.070306Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:392fa36c440c25b0aea3caee61fe5b0468f3a5827d8aa413846be4b7d54a2218","observation_id":"a8392ca3-0c83-4655-89c8-b161f011a59c","resolution":{"observed_at":"2026-08-06T15:05:04.070306Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:12.005246Z","title":null,"venue":null,"work_id":"84338f7a-bc83-4d39-9237-13c711f2c2e3","year":2014},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.083203Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:be40425949cd289c3ce9c5581d95df6b281ae81259abb72ac57e3467789fbc87","observation_id":"494e3164-9010-440a-9b7e-b7649a447e61","resolution":{"observed_at":"2026-08-06T15:05:12.053405Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:11.856354Z","title":null,"venue":null,"work_id":"ba003067-66e6-46b3-9c2c-9d450c2397cf","year":2021},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.093185Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:334794760270d2cb28941a3c9ac1332a105f1ae4da9a1b65b6b1338734696cec","observation_id":"5fd53f63-1c60-44bc-93ea-7a8cd7a4ef92","resolution":{"observed_at":"2026-08-06T15:05:11.904822Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:11.595955Z","title":null,"venue":null,"work_id":"e5d796ed-1c7f-4d66-b4ab-76797ee8b23e","year":2023},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.100506Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:e7169b2d27850a021735949e7dd5c4852ee29e77de02879c1b1817812ba6872b","observation_id":"00410436-2e3b-4f6e-91d2-adf36aa51d6c","resolution":{"observed_at":"2026-08-06T15:05:11.737322Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"10.1145/2886095","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"ACM Transactions on Database Systems","work_id":"b4c59170-047b-4634-b32a-04329c45e9b2","year":2016},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.109756Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:75b603cf4da6f03abd4cd1a5aa540f628d52454fb3447ec493c5b1bff37db9a6","observation_id":"6ba778b0-b910-46b8-8d25-cbe2bfd469b7","resolution":{"observed_at":"2026-08-06T15:05:04.910220Z","resolver_source":"doi","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":{"arxiv_id":"2306.00893","last_updated":"2024-01-08T13:22:57Z","snapshot_observed_at":"2026-08-04T06:07:16.438397Z","submitted_at":"2023-06-01T16:50:48Z","title":"Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.00893","snapshot_observed_at":"2026-08-06T15:05:04.123125Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.123125Z"},"links":{"cited_paper":"/paper/2306.00893","citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:bee80a8cdd3a9239ace22719b88620a8109ca0f674f96f1c9a0e5d381612a175","observation_id":"c929a717-f77a-4a23-97b5-aa103f33ed19","resolution":{"observed_at":"2026-08-06T15:05:04.123125Z","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-06T15:05:04.135370Z","title":"Chandra and David Harel","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.135370Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:8b559d01b3280df68720e0cd0895379db02a7bee6e46597d070a17a7bacdf028","observation_id":"6b4c5acf-bc88-4fd6-bb96-fb64b76c2801","resolution":{"observed_at":"2026-08-06T15:05:04.135370Z","resolver_source":null,"status":"malformed_identifier"},"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-06T15:05:04.141347Z","title":null,"venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.141347Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:03fc30b0b978dcc25c95cdf5711a72cf1d9f3bb083d3d03a73ff8101db3169e3","observation_id":"f908a79d-411f-401c-8946-78d09df01f2e","resolution":{"observed_at":"2026-08-06T15:05:04.141347Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:11.324826Z","title":"van Kreveld, and Mark H","venue":null,"work_id":"15722fd6-14aa-46e5-9196-90e198a1c310","year":null},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.149450Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:d87c6d4b67fa1b50aa34dc32ccc86db163b8759c71d34074c098eca1d71812ec","observation_id":"af396eaf-6bb3-4264-97e8-c5a0270d5f6d","resolution":{"observed_at":"2026-08-06T15:05:11.452126Z","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-06T15:05:11.083505Z","title":null,"venue":null,"work_id":"26cc57aa-8f1e-4260-ac1e-7bce582d879a","year":2018},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.172638Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:4a38bd940ccc87e13d1157cdc7f750378f0255dc3950efe7133e9336e3da116e","observation_id":"f30ebb3b-f10a-4a25-9f3e-d04fbecf20b6","resolution":{"observed_at":"2026-08-06T15:05:11.205332Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:10.821409Z","title":"Turull Torres","venue":null,"work_id":"94890578-dc24-4033-bc3d-d8560e0a754a","year":null},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.177962Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:aa15a4df8fdf17cba4a98aaa438389fe1c1feb08c80db693e8d2504023b80972","observation_id":"c5ac620a-dd15-4cbf-8e15-02dc722d88a9","resolution":{"observed_at":"2026-08-06T15:05:10.909980Z","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-06T15:05:10.572399Z","title":null,"venue":null,"work_id":"13738061-1386-4113-ade9-181de08df2c9","year":2022},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.197449Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:f9fa4ff7ce2256376ad84ea938873924ced7429872209bc2ee67d8b6d204756d","observation_id":"035c0072-7846-42c7-a612-4f950eb1efd0","resolution":{"observed_at":"2026-08-06T15:05:10.666417Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:10.375982Z","title":null,"venue":null,"work_id":"826422a4-4d52-4a7a-9f4e-555218f51b86","year":2016},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.205142Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:64a0d30072a9ebf89c4f267434ad1d08967063c0f88ecacab50f2c7121d41915","observation_id":"697fe6c9-9d47-463d-95de-9ffce4a43b03","resolution":{"observed_at":"2026-08-06T15:05:10.430608Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"3122.19531","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:05.874288Z","title":null,"venue":null,"work_id":"4d260e47-7dbe-4c83-bae3-38fbfd2573d8","year":2011},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.210355Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:882f6708a5326fcd9adf82914baa6ed6410dac474c347f70f36c6a8d50b605ee","observation_id":"fbd73263-8f2d-4006-8f6c-7c70fdd7a738","resolution":{"observed_at":"2026-08-06T15:05:05.887578Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-06T15:05:10.183109Z","title":null,"venue":null,"work_id":"c91610e5-7a51-4ae9-8c45-a2e91306c0ac","year":2014},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.221275Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:095a723901a738b8988b773ffae3e416b96069694ab6effff936f13d5f43a224","observation_id":"a2de6664-e005-436f-bcf2-4885312bbd83","resolution":{"observed_at":"2026-08-06T15:05:10.263495Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:10.011026Z","title":null,"venue":null,"work_id":"c4bf1be5-82ac-4ea6-89df-03eaf2904a24","year":2020},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.228624Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:9d10073d33b380c4a4954cb1ebe2b29a21d80097d51dc087331df7e54a030212","observation_id":"b8dfb1b2-c039-4449-b3ed-232d0687a427","resolution":{"observed_at":"2026-08-06T15:05:10.069960Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:09.822796Z","title":null,"venue":null,"work_id":"b572bba4-2ed7-4909-a86f-bd2b48ce5807","year":2018},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.234946Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:774fe680653c4d1178d2f26f9c33d068213ae4a9977be8bbaaa19b9bca591455","observation_id":"8c966515-9518-4b4c-ac47-90a0a97fcd81","resolution":{"observed_at":"2026-08-06T15:05:09.894367Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:09.612297Z","title":null,"venue":null,"work_id":"42840acb-cec5-4b2f-b7db-2704f6e0ae3f","year":2016},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.245120Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:c2507d7ffccbfed3ff79436b4447d8a5c9c93b1a3e466b4e39cd67f89a347780","observation_id":"e12afce7-1865-496d-ac2d-5201606d7d6d","resolution":{"observed_at":"2026-08-06T15:05:09.707225Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:09.393917Z","title":"Pfeiffer III, Timothy La Fond, Sebastián Moreno, and Jennifer Neville","venue":null,"work_id":"ce7ca9bf-06ca-421e-b210-44290004ecbe","year":null},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.256595Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:4784872325975a66ebae997f93e36a3b66cb0522e5ca1c654332d57015823026","observation_id":"b3afb6a9-df35-469c-8ec6-062c4b2c19c8","resolution":{"observed_at":"2026-08-06T15:05:09.465322Z","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-06T15:05:09.022201Z","title":null,"venue":null,"work_id":"81f89df2-77e8-46f8-983f-c1063294f0ba","year":2018},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.273123Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:d4b2910fd5dbd3761d7b862e641368b05b6b608925411fd9edcff2db3d152a9c","observation_id":"77e022cb-358b-47b6-80dd-cdaf7afc5fbd","resolution":{"observed_at":"2026-08-06T15:05:09.068297Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:08.847252Z","title":null,"venue":null,"work_id":"27d57fec-4e9e-4628-87e9-929e3fabe252","year":2015},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.280386Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:cc3e35ae2fb32979ae652a769164fd8cf617180e4cf58a9581b731d0102d1e9e","observation_id":"2f742c76-06aa-4318-a248-73c142adaee7","resolution":{"observed_at":"2026-08-06T15:05:08.916222Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1802.04613","last_updated":"2020-02-24T09:35:57Z","snapshot_observed_at":"2026-08-14T00:23:35.947197Z","submitted_at":"2018-02-13T13:29:50Z","title":"First-order queries on classes of structures with bounded expansion","version":4},"cited_work":{"arxiv_id":"1802.04613","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.04613","snapshot_observed_at":"2026-08-06T15:05:05.744351Z","title":"First-order queries on classes of structures with bounded expansion","venue":"cs.DB","work_id":"aee86521-8029-47e3-a5f7-fd9005e61602","year":2018},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.288971Z"},"links":{"cited_paper":"/paper/1802.04613","citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:92125db80015e25b2807882952d22eb18c7ce8c554455416bb3f66594e54db68","observation_id":"6b6ba2de-a04c-4471-8bc0-954f6f72b4af","resolution":{"observed_at":"2026-08-06T15:05:05.752685Z","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-06T15:05:08.691428Z","title":null,"venue":null,"work_id":"f50b5ea3-2bea-4072-8a6f-b1c1e644e5dc","year":null},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.294768Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:11d8181b44f822e1a172b0de6a665d90a19c2c0558128e7e6654796946c36714","observation_id":"c66ee1a9-4e2f-46cf-844b-68e01fa385dc","resolution":{"observed_at":"2026-08-06T15:05:08.763790Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:08.239794Z","title":null,"venue":null,"work_id":"058c8692-b3b7-41c6-b929-ad80dbe69e9b","year":null},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.308610Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:7d16e9690067efe24c5d0b8ca7012c03582b818bab10cc85873e3c8db9aea734","observation_id":"26ccc8e2-0c26-4f09-899c-3a5093ca9107","resolution":{"observed_at":"2026-08-06T15:05:08.302228Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:04.327097Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.327097Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:4573139dc4cc8d9b8d1043aa04e6d97099dca010638d56ea6806bf08b85464a0","observation_id":"48003b2a-0891-43d2-9314-4ee8f561e78a","resolution":{"observed_at":"2026-08-06T15:05:04.327097Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:07.933785Z","title":null,"venue":null,"work_id":"e1b01574-f034-4a0d-9f20-6d3f0cb3139b","year":2013},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.342389Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:f8a594ac13b97a643a02e5313b9e875ff0894b7d9ff9cd0546e6905bb5582cdf","observation_id":"aa636b9b-9140-4e49-9a3f-5426e833085d","resolution":{"observed_at":"2026-08-06T15:05:07.970765Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:07.802208Z","title":null,"venue":null,"work_id":"501f15fa-98a9-496e-8879-ccb22e5f2e8a","year":2018},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.348977Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:8b591e2abbfd46ccf4bfcb85523de4bc48d71ef5a76df5d53580f34e3cb4d191","observation_id":"f68bddaa-023b-4c01-8d5b-2d0ef26c092a","resolution":{"observed_at":"2026-08-06T15:05:07.863653Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:04.356642Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.356642Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:60622279c4534c435ec044c8b8fd623f864ef48d0cf44c6749ee409141d77d6f","observation_id":"b7d1de8c-9c65-4f06-a5a9-dea6a99c572a","resolution":{"observed_at":"2026-08-06T15:05:04.356642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.07791","last_updated":"2025-07-11T03:26:29Z","snapshot_observed_at":"2026-08-13T13:02:14.197863Z","submitted_at":"2023-01-18T21:22:57Z","title":"Temporal Motifs for Financial Networks: A Study on Mercari, JPMC, and Venmo Platforms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.07791","snapshot_observed_at":"2026-08-06T15:05:04.369406Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.369406Z"},"links":{"cited_paper":"/paper/2301.07791","citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:4bf741c2dbff5991fdc19fc4535f10ff8ab4b4da33c673135e8932defa0655bb","observation_id":"51b3eb06-0601-42bb-a857-6a3d5ca27abb","resolution":{"observed_at":"2026-08-06T15:05:04.369406Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:07.650127Z","title":null,"venue":null,"work_id":"ed495e7b-c57b-40f3-857e-eb5a5f20d2bc","year":2019},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.375823Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:031a505b21e53563cae97ad04f6d469596d95f27b1905b51e85d0f5871e6f8c2","observation_id":"806a63bf-3bd2-4940-bad3-628918edd1b7","resolution":{"observed_at":"2026-08-06T15:05:07.722176Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:04.336370Z","title":"Journal of Statistical Me- chanics: Theory and Experiment 2011, 11 (2011), P11005","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.336370Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:c7a77255ccc9f006370934a0479347c3fa602456ebe652bd41ee8595193c385f","observation_id":"f5ce79a0-25c9-4013-a927-c532a9e49771","resolution":{"observed_at":"2026-08-06T15:05:04.336370Z","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":"2402.32238","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:05.643922Z","title":"Matula and Leland L","venue":null,"work_id":"f75d7768-725c-4bb0-b66c-ba83b0a035d0","year":1983},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.399264Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:392cd0c36053d5907759b6a1413028fdb4b582f03ed6ae0db97f4c0731f909ac","observation_id":"fc3e2456-51fe-49b8-8549-dec0d811468c","resolution":{"observed_at":"2026-08-06T15:05:05.661424Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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":"10.1609/aaai.v27i1.8632","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Telang, and Munindar P","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"65fea94d-cbef-44f0-a0ba-d1e9c9ad7b5b","year":2013},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.409751Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:18f795d66aae819b6c9f1743349114111326dafb8a56f5f597ee1e202dc55fd3","observation_id":"80348a99-f6cf-4dfb-8480-15847ad0163b","resolution":{"observed_at":"2026-08-06T15:05:04.788033Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:04.418659Z","title":"Italiano, and Wook-Shin Han","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.418659Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:c436a275c5605baf4d7e3bdd820e1980a6f2aa54ce9cd4db2b6e7a4d0ab0acc8","observation_id":"a6036f40-6116-4378-9d8e-636d17f51416","resolution":{"observed_at":"2026-08-06T15:05:04.418659Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:07.369245Z","title":null,"venue":null,"work_id":"681bd367-a52e-45f9-a55c-55ea1484690e","year":1986},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.425841Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:6b89e98a8c60325f55ab9bd913ee5dbc23a2df6b148820978bbd3ac98d105ed3","observation_id":"9a08850f-be79-4262-b0a2-a4762c2499f2","resolution":{"observed_at":"2026-08-06T15:05:07.440109Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:07.195648Z","title":null,"venue":null,"work_id":"72c12650-f34b-4aaa-b7c0-64fc04f2effa","year":2005},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.432155Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:5756a27ba2b6e940e02d38757f751bb76ba065dc0758523be125b6c5372fd797","observation_id":"ba96a02f-a801-4eb8-a8b3-e6f6265851ec","resolution":{"observed_at":"2026-08-06T15:05:07.304561Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:07.518026Z","title":null,"venue":null,"work_id":"119da903-0e6a-4ee2-abdd-fe41f8df019d","year":2018},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.383672Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:d2b024c7cb32a73191c2b58a2b9004bcc6ae9a0f444db63556211f4dc39a3302","observation_id":"36d5a6b2-7859-4ad2-83af-e8bf129526de","resolution":{"observed_at":"2026-08-06T15:05:07.584552Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:07.058219Z","title":null,"venue":null,"work_id":"cf9166e8-fe3c-478a-8612-9cef22eac784","year":2017},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.448379Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:65092095d2a54cf28e6ff2de770c4a5bd85ef6639645632907638cfb34eb063a","observation_id":"1848e6c1-c7b7-4f7b-b913-9eab04c20b68","resolution":{"observed_at":"2026-08-06T15:05:07.137484Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:06.945575Z","title":null,"venue":null,"work_id":"eb6c0c93-414e-4289-8ff6-480e24034ac4","year":2021},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.456204Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:8f1c05365606467fb56ff0011c5fcc9b23e166f13aa90dbceca1d644b545c7d7","observation_id":"3cdf77e2-6613-4443-9924-57b941f7b180","resolution":{"observed_at":"2026-08-06T15:05:07.022699Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:06.761601Z","title":null,"venue":null,"work_id":"599d957e-65dc-400b-913e-102e53804b97","year":2013},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.467850Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:e6502d734c9f9883349a625084e80d5ee365e719905d33fbf76a64e357ff6b99","observation_id":"e5965e5a-a113-4da4-9c43-5a0008cb6d42","resolution":{"observed_at":"2026-08-06T15:05:06.828147Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:06.660056Z","title":null,"venue":null,"work_id":"b838eb69-d479-4a4c-9fc6-067e95d91549","year":2017},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.474070Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:6e15fb92d68c947910ab6e70b7f0992f29e9aae48a4ff8ed873e2ce50365f8d9","observation_id":"c69afdaf-356e-4f2c-8afd-bfbcce8e5f9a","resolution":{"observed_at":"2026-08-06T15:05:06.675831Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:06.601194Z","title":null,"venue":null,"work_id":"e5c220ba-2399-42a8-80bf-7e018423e9f0","year":2020},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.480495Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:bb05c648fe9206d4930a17ac2502edccd20514b04a21537e4bb89946416f8915","observation_id":"249c9a5a-b0dc-4e0d-8566-0b52f1b89a26","resolution":{"observed_at":"2026-08-06T15:05:06.624092Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2409.08975","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:05.127414Z","title":"Seshadhri, and Nishil Talati","venue":null,"work_id":"4924373a-0aa8-45e0-94e1-c57edb2becb7","year":2024},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.439115Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:51c194af708b1652b7f1d99706712948acd428ec983ec9a6e749ad4a62f5541b","observation_id":"ed2fa7b0-68ec-495c-bac1-8aa3367e6cbd","resolution":{"observed_at":"2026-08-06T15:05:05.137328Z","resolver_source":"raw_fallback","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-06T15:05:06.478918Z","title":null,"venue":null,"work_id":"1cb83376-8c1e-49d2-aaad-6deb10c48742","year":2021},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.496254Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:d71b43df49a271117b6d7a6e171c2adba0fcc60239ae2104577f4c03f01c9874","observation_id":"4a315ce7-9cce-4c0f-b3a7-75d0a9859711","resolution":{"observed_at":"2026-08-06T15:05:06.493825Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:06.425566Z","title":"Seshadhri","venue":null,"work_id":"395121ae-4572-4ea7-bba6-8b190e72061c","year":2023},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.501410Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:314dca3a43110f868fdc40b749f0af833eb28fb141246c7cf98702509754e1f9","observation_id":"cfc8d1da-db4d-49ea-8ab3-50c0eaa4c5ae","resolution":{"observed_at":"2026-08-06T15:05:06.449793Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:04.509362Z","title":"Seshadhri, Tamara G","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.509362Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:542c673f762c26b3fd694fa8dde6ae61b48d55ab11f4bd31a33d2b107c0c0329","observation_id":"c2af9a39-84dc-453f-bc4c-bc30d7c9284d","resolution":{"observed_at":"2026-08-06T15:05:04.509362Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:06.365420Z","title":null,"venue":null,"work_id":"e8ea9043-79f7-4a95-8442-987f4584a4fb","year":2014},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.521241Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:c4e2d806ec5f74143f8b687304b522095162d45b166fd2a072a6095c019d7056","observation_id":"0bbeb0e2-0698-4218-b0b3-0e421d4ae6b6","resolution":{"observed_at":"2026-08-06T15:05:06.392091Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:06.341705Z","title":null,"venue":null,"work_id":"42591588-e033-4f93-b4d3-5580d2d5c1d3","year":2019},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.527081Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:0adab749e8568c0649b4feda46b37fc9d08b1307784bc6da8a209b93644e57f9","observation_id":"d8b320b7-bf45-47b3-a28a-5537c3bd4324","resolution":{"observed_at":"2026-08-06T15:05:06.347338Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:06.533164Z","title":null,"venue":null,"work_id":"fc56bfa3-4157-421a-93a7-376c5ee36cbc","year":2021},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.490143Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:bce9ac81ab8b382b69e0a186561ceca0107c84a41a8782543550017c9433f6f3","observation_id":"99167fea-e271-42b3-b52a-40fe8e0d3033","resolution":{"observed_at":"2026-08-06T15:05:06.555130Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:06.296140Z","title":null,"venue":null,"work_id":"8766628d-370d-4979-97ee-a3e1a8d5262e","year":2019},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.548934Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:4d20c4082e22e20e20aa9a437e515edeefd84d6ce7d32dd310c27b82374c4921","observation_id":"3fdfc735-5aa5-4c26-99e9-6c8e4317b7a5","resolution":{"observed_at":"2026-08-06T15:05:06.306255Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:06.268150Z","title":null,"venue":null,"work_id":"aee77ce5-2f05-47c7-aace-6f0f07453232","year":2022},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.555523Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:bb7e4ae28a91c73b269b6a81753a8e4112071cb5a966671366e7f3a067b62144","observation_id":"81f61ac8-c1cc-4046-ab29-1af78647ab36","resolution":{"observed_at":"2026-08-06T15:05:06.277630Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:06.245044Z","title":null,"venue":null,"work_id":"86349e79-2f92-4075-8ef7-e09a1d77c423","year":2022},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.562828Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:fcd1fc532b2e470eb992990adfdb1c1c9da29149e094dbf177da78e260b8ae91","observation_id":"15b09057-5174-4fca-b0f1-f4b4c9e85267","resolution":{"observed_at":"2026-08-06T15:05:06.252218Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:06.221969Z","title":null,"venue":null,"work_id":"737a277f-f994-4a6c-a0fc-2ff865bb91a4","year":2008},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.571104Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:0d12c74f9d045cfc82e29749280b132b49d3993900a7a081e3d4db4d21bef0b6","observation_id":"99453b16-c4c9-4025-b88d-0cf627681d52","resolution":{"observed_at":"2026-08-06T15:05:06.227427Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:06.190728Z","title":null,"venue":null,"work_id":"5806cfe2-481d-49bd-beaf-d0b97568f2f4","year":2009},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.577015Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:c301c53f43f5a634b6d152522de74e64ddfdeb395b6e23473d650b22e17bcf8e","observation_id":"9ca033eb-a912-4f91-806e-aa12d53a6134","resolution":{"observed_at":"2026-08-06T15:05:06.199829Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:06.324181Z","title":"Seshadhri and Srikanta Tirthapura","venue":null,"work_id":"e7ff028b-cd54-4d9c-a8f3-0d2735b7cb99","year":2019},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.536977Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:c79d8c1ae716900cb5a4543c0f8f19bdb8d60e633c7df0a4a80c7cc3e1ab17dc","observation_id":"60453eb6-9095-4daa-be9c-334bc18b4acb","resolution":{"observed_at":"2026-08-06T15:05:06.329586Z","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-06T15:05:06.158043Z","title":null,"venue":null,"work_id":"8b79aa79-4b8b-42e0-88e7-141fdb736c7e","year":2019},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.596395Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:061dcaacec4378fbf0b338474215e4d451957f1f96c0838564b48cd53af401ac","observation_id":"19c0564d-eef8-4ddd-84a0-be00f91ffb7d","resolution":{"observed_at":"2026-08-06T15:05:06.165883Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"10.1007/s41109-018-0082-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Applied Network Science","work_id":"e86123c0-1413-4159-9581-e8864dda25e1","year":2018},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.601313Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:874cd920fa797372a0cf1f74282120ae8c44d62ec567692bb1864ed5f2eb56c9","observation_id":"d0d49f8f-08dc-4f1f-84be-6bdc2159fd3d","resolution":{"observed_at":"2026-08-06T15:05:04.728853Z","resolver_source":"doi","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":{"arxiv_id":"2506.13173","last_updated":"2025-06-16T07:34:54Z","snapshot_observed_at":"2026-08-14T04:43:26.651184Z","submitted_at":"2025-06-16T07:34:54Z","title":"Efficient Approximate Temporal Triangle Counting in Streaming with Predictions","version":1},"cited_work":{"arxiv_id":"2506.13173","doi":"10.48550/arxiv.2506.13173","metadata_source":"pith","pith_arxiv_id":"2506.13173","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Efficient Approximate Temporal Triangle Counting in Streaming with Predictions","venue":"cs.DS","work_id":"667e74d0-412e-4186-8274-26b5e3ffe3ba","year":2025},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.606611Z"},"links":{"cited_paper":"/paper/2506.13173","citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:0e7de1e9fcf382e2516f767e2338a22c255298175bb6e169303a3c8be9e38e6f","observation_id":"542adc5d-23eb-4c5d-9da8-c3ceb1a01a8d","resolution":{"observed_at":"2026-08-06T15:05:04.705050Z","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-06T15:05:06.127207Z","title":null,"venue":null,"work_id":"d60424a7-e138-4139-96bb-09ccfc04081f","year":2020},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.612637Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:105ba1cd9932a3d1e9b366dd704cd0c5807136a6fae3f5b6a54860fabc5a62fb","observation_id":"1b3569bf-7d5a-4124-a5ad-e2d8a955365b","resolution":{"observed_at":"2026-08-06T15:05:06.134717Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:06.077662Z","title":null,"venue":null,"work_id":"bcdae561-3228-4ba6-a7b2-1ae049f1f73c","year":2017},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.619482Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:74b5f6e88a35d7d40b3f28ddaa2101c335c5f7875233d35dcddb791ae45848a3","observation_id":"1c9ae9c4-01a1-40d6-bf68-69387341a40a","resolution":{"observed_at":"2026-08-06T15:05:06.087835Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1807.03733","last_updated":"2018-08-07T14:02:20Z","snapshot_observed_at":"2026-08-14T18:53:40.034888Z","submitted_at":"2018-07-10T16:09:29Z","title":"Network Classification in Temporal Networks Using Motifs","version":2},"cited_work":{"arxiv_id":"1807.03733","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.03733","snapshot_observed_at":"2026-08-06T15:05:04.979265Z","title":"Network Classification in Temporal Networks Using Motifs","venue":"cs.SI","work_id":"60d13c29-00c0-4b51-b649-82a11b1cad4a","year":2018},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.589674Z"},"links":{"cited_paper":"/paper/1807.03733","citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:e75fa6a4d55cf0d4f2462d7e2ab65ba7ad869f691ebe92807cb34a4451418c4b","observation_id":"685b7d32-73de-476d-a406-75361f7655d1","resolution":{"observed_at":"2026-08-06T15:05:04.992587Z","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":{"arxiv_id":"2310.02800","last_updated":"2023-10-11T15:24:40Z","snapshot_observed_at":"2026-08-14T03:52:49.669377Z","submitted_at":"2023-10-04T13:21:04Z","title":"Everest: GPU-Accelerated System For Mining Temporal Motifs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02800","snapshot_observed_at":"2026-08-06T15:05:04.624415Z","title":"inserts an interval 𝐼","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.624415Z"},"links":{"cited_paper":"/paper/2310.02800","citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:ad692f6a9c2e3c4824c6c96df26dbc0362ee4f74d2091a2e127f176242e2e75a","observation_id":"149bc40d-6a1b-4822-9bfd-9ee20704fe08","resolution":{"observed_at":"2026-08-06T15:05:04.624415Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:06.053480Z","title":"As a consequence, the algorithm over-counts the contribution of𝑤","venue":null,"work_id":"53bf7a00-6dbc-4872-9020-d7c8cae4824e","year":2018},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.630295Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:5e7ee0f691b504345349c8333fec05f621e35ad3a03fd5a12c3e56847c73b1df","observation_id":"545f6f6f-3352-4360-ac2c-06205c9bf1b4","resolution":{"observed_at":"2026-08-06T15:05:06.061849Z","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-06T15:05:06.031546Z","title":"(2) If the algorithm visits a white node𝑥 with Counter(𝑥) > 0, then check for Vertex(𝑥)","venue":null,"work_id":"33420edf-9b19-43c3-818d-de04657b251d","year":2018},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.636291Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:8cc72ddbfcd48f0a19273c94c6b6303f50af3b270f9104656d317f9120ea4f4b","observation_id":"c50b24ec-edc9-4507-ab89-12d9af2bdc2d","resolution":{"observed_at":"2026-08-06T15:05:06.037120Z","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":"oclc/2275841","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:05.984304Z","title":"Springer","venue":null,"work_id":"6f7b915c-49c1-4a9d-bf2a-14947fdb816e","year":null},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.164246Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:23a43875b03ae726de8953fe2e744f964fd405a2a6e2ec98d3d69a180b4c53aa","observation_id":"b03c8927-1d24-4a34-967b-4a15bc34be47","resolution":{"observed_at":"2026-08-06T15:05:05.998981Z","resolver_source":"raw_fallback","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:04.188394Z","title":"In Advances in Conceptual Modeling - Challenging Perspectives, ER 2009 Workshops CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS, Gramado, Brazil, November 9-12, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.188394Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:511b87e5845311e39375dc08c9c82fea490dd2006ff85b6573a6c465730cae8a","observation_id":"cc3182ce-2657-4c2f-8988-83e6bd45ff4b","resolution":{"observed_at":"2026-08-06T15:05:04.188394Z","resolver_source":null,"status":"malformed_identifier"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:05:08.449996Z","title":"In Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, Athens, Greece, June 12-16, 2011 , Timos K","venue":null,"work_id":"2907d911-f87c-4291-a111-4b4559ebe7f4","year":2011},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.301885Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:ef63937864926224bf950c1c62cf0efcf195e592f8674306e3989e6324531215","observation_id":"d2375160-8d29-4eb9-86ae-92e9f8230903","resolution":{"observed_at":"2026-08-06T15:05:08.624301Z","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-06T15:05:09.166355Z","title":null,"venue":null,"work_id":"3e4b5caa-2395-409a-a733-60d1b6e260e7","year":2012},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.264195Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:5149de2473222e1e77ab45a1a47bf79199a2591b792f0ab7a10a799af578ebb4","observation_id":"afd66d00-b6ae-4a76-9fd5-110a579d6d14","resolution":{"observed_at":"2026-08-06T15:05:09.278868Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T15:05:08.073687Z","title":"Frontiers in Blockchain 4 (2021), 668510","venue":null,"work_id":"38655d08-ab21-4cfb-bc38-4e2f057f36dc","year":2021},"citing_paper":{"arxiv_id":"2507.17215","last_updated":"2025-07-23T05:12:23Z","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-06T15:05:04.319664Z"},"links":{"citing_paper":"/paper/2507.17215"},"observation_digest":"sha256:4b87c2736d93149de7b523d1e2213805732b97bbb20bab855b52eca522d379c3","observation_id":"8bbd0088-a581-4493-9083-ec62212f66fb","resolution":{"observed_at":"2026-08-06T15:05:08.145412Z","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":"2507.17215","last_updated":"2025-07-23T05:12:23Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-11T04:39:58.354754Z","submitted_at":"2025-07-23T05:12:23Z","title":"Triadic First-Order Logic Queries in Temporal Networks"},"reference_resolution":{"displayed":69,"state_counts":{"malformed_identifier":2,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":48,"verified_exact":8,"verified_fuzzy":9},"total_outbound_references":69},"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 69 of 69 outbound references and 0 inbound Pith citation observations for arXiv:2507.17215."}