{"as_of":"2026-08-16T17:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:12f1abb190b4df40c426ef717fdc29a55092b43e54ab6912be45c81a211dcfd9","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T16:32:55.833653Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T18:07:35.354611Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T18:07:35.408730Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"cited_work":{"arxiv_id":"2411.13483","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.13483","snapshot_observed_at":"2026-08-10T18:07:35.408730Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","venue":"math.CO","work_id":"56bc9181-40a4-4982-a59d-39d895f4c52d","year":2024},"citing_paper":{"arxiv_id":"2501.11726","last_updated":"2025-07-02T20:37:39Z","snapshot_observed_at":"2026-08-12T16:25:24.436533Z","submitted_at":"2025-01-20T20:21:54Z","title":"Antidirected trees in directed graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T18:07:35.354611Z"},"links":{"cited_paper":"/paper/2411.13483","citing_paper":"/paper/2501.11726"},"observation_digest":"sha256:a62eb27bad1396a676d8933aff64eee5900dc712a275c0ad886c79ee31416a1a","observation_id":"135fc8a5-c2aa-4be5-89b6-ec4d1538c52e","resolution":{"observed_at":"2026-08-10T18:07:35.416605Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.13483/citation-record","integrity":"/paper/2411.13483/integrity","json":"/paper/2411.13483/citation-record.json","paper":"/paper/2411.13483"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:32:56.361287Z","title":"Addario-Berry, F","venue":null,"work_id":"ec1ce1a1-8554-4183-a52e-a7980270dfe0","year":2013},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.693800Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:a38ba8065427251b51fdc14b1e97a3d0efa8c6f21968ee5e18450e91fda67a7a","observation_id":"52c5dbb7-4796-43c0-94fa-81ea3d05a646","resolution":{"observed_at":"2026-08-12T16:32:56.367811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:56.339964Z","title":"Besomi, M","venue":null,"work_id":"54c48892-9079-4fe3-8f87-2fe2600b0756","year":2019},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.700628Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:1b891da0b4fc7ea95993e84776d13422b9d19d046afd4cd0e354dc0e08b7dfd1","observation_id":"4bb86969-18aa-4a15-bc86-4c76867165c0","resolution":{"observed_at":"2026-08-12T16:32:56.345556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:56.318080Z","title":"Brandt and E","venue":null,"work_id":"014b0362-5b05-4bb7-88b3-0845bc70d94e","year":1996},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.710726Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:35f53fbf908d0cb11ccea231aa1e9d67411e7f3d89ba7001888c741a7d918612","observation_id":"dff06543-f605-4f71-b985-90378048d2f4","resolution":{"observed_at":"2026-08-12T16:32:56.324407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:56.291361Z","title":null,"venue":null,"work_id":"0158def4-03c8-43df-a5d2-96270a3ac116","year":1980},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.717300Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:99e98280919069940e03d39bb40f0f8abc518164e1517d94aa81b24ece4cba00","observation_id":"88cf4fdf-2637-42cb-9f21-80f09205adfc","resolution":{"observed_at":"2026-08-12T16:32:56.299212Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.05205","last_updated":"2024-01-10T15:04:02Z","snapshot_observed_at":"2026-08-16T14:28:30.303350Z","submitted_at":"2024-01-10T15:04:02Z","title":"Long antipaths and anticycles in oriented graphs","version":1},"cited_work":{"arxiv_id":"2401.05205","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.05205","snapshot_observed_at":"2026-08-12T16:32:55.949393Z","title":"Long antipaths and anticycles in oriented graphs","venue":"math.CO","work_id":"484c081c-4b7b-4d39-822c-0b87786b8d34","year":2024},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.723351Z"},"links":{"cited_paper":"/paper/2401.05205","citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:5ac147134c4be8672a914e867a8626a3c6428c1e097c23e5247290411acbc795","observation_id":"aa31c6bc-dbc4-4f77-89c1-90050a5d3afb","resolution":{"observed_at":"2026-08-12T16:32:55.958424Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:56.268186Z","title":null,"venue":null,"work_id":"d07d674e-19b1-4a06-b20d-e0bf519cc7e3","year":1995},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.731633Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:6556aa6667f2386cf70ea167cfbef883acdb4e7324a9b6285114f46e15a7e49a","observation_id":"495e1e2e-8f52-47cb-89f7-33107ce194b0","resolution":{"observed_at":"2026-08-12T16:32:56.274359Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:56.244113Z","title":"Havet, B","venue":null,"work_id":"62b2b151-34d7-4ae7-aede-5356ad209de2","year":2020},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.738049Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:2767ca9feaad7fb74f54ffa173ac901110216a7332c636b879b1303a0019508b","observation_id":"a8a73c31-3bd5-44c8-84a0-96c3fa1eddf4","resolution":{"observed_at":"2026-08-12T16:32:56.251245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:56.221478Z","title":null,"venue":null,"work_id":"ea479996-7e81-4757-af64-cd768945c85b","year":2000},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.748620Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:b7fa8c525cc639f17083cd9d3ec87a2fbbc0fe4d2536295c7ad1618f1fb45079","observation_id":"bf250147-dcba-4b7a-892f-338ebb110afc","resolution":{"observed_at":"2026-08-12T16:32:56.229584Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:56.200668Z","title":null,"venue":null,"work_id":"cef45f74-f4af-4edb-b97a-7f609430af01","year":2001},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.756149Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:e6ffca0fb722be0390631dbb2f073f9b2d2b2c3e5072c2bf748179e4d858b2f3","observation_id":"df97e6d2-b35c-480a-9e90-4aa756ba518e","resolution":{"observed_at":"2026-08-12T16:32:56.207114Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:56.178893Z","title":"Klimoˇ sov´ a and M","venue":null,"work_id":"a4f1638e-e84a-4ff9-a7c0-a673f73e7a6d","year":2023},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.762544Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:795ccad293e8b8f9906853765b05e1d33bcaab66d5385a7f14a08bee3e6fb750","observation_id":"9ea78cb6-575d-49db-8864-0a37a58e1f71","resolution":{"observed_at":"2026-08-12T16:32:56.187465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:56.160630Z","title":"Kontogeorgiou, G","venue":null,"work_id":"34dadd56-d819-4e27-9701-8f782ae403e4","year":null},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.768839Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:af503e352dad62b75f0b112e201ee8208268bd697914a792759011cc12f2ba10","observation_id":"13874729-8af4-4624-a150-0f715e7c8b43","resolution":{"observed_at":"2026-08-12T16:32:56.166028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:56.140592Z","title":"Reed and M","venue":null,"work_id":"2a52b918-25a0-4232-888b-2dbc871d72e5","year":2023},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.774661Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:5f79bdd5ff7b117b25dd39d0d6cfa8acb52ccabc10b0db7ddae8fb356d523613","observation_id":"2380a87e-57b8-4441-8772-b7767541b1b0","resolution":{"observed_at":"2026-08-12T16:32:56.147674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:56.113833Z","title":"Reed and M","venue":null,"work_id":"09296257-d203-4810-8b4f-7f03444e1fe9","year":2023},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.780272Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:0761d33e784198a922dd1ab68ab477390fc65d195e66651c2a6081c0af810c88","observation_id":"158ff8d4-3a37-4be6-9211-b1901836ff19","resolution":{"observed_at":"2026-08-12T16:32:56.123746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:56.094665Z","title":"Sacl´ e and M","venue":null,"work_id":"594a4ca4-e057-4c12-8a4a-8ec9f1173f67","year":1997},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.785426Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:d8656ae63aba3bdba67f62951e76a358b275d7b65c73bf6526569ad84ca9e2ea","observation_id":"5a80c7a8-8561-40e3-8522-630a11f1da01","resolution":{"observed_at":"2026-08-12T16:32:56.100942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03166","last_updated":"2025-09-05T14:34:05Z","snapshot_observed_at":"2026-08-16T13:45:55.989013Z","submitted_at":"2024-06-05T11:57:02Z","title":"Alternating paths in oriented graphs with large semidegree","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03166","snapshot_observed_at":"2026-08-12T16:32:55.790574Z","title":"Skokan and M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.790574Z"},"links":{"cited_paper":"/paper/2406.03166","citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:8f2648e8d4ea83cd235a522c1a17ded100ff9cf391de7eba642490f49a17d5f7","observation_id":"17435ef9-e929-481d-bc33-9ed152c64abb","resolution":{"observed_at":"2026-08-12T16:32:55.790574Z","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-12T16:32:56.071763Z","title":null,"venue":null,"work_id":"b8120468-5e36-4884-b20a-7a7b0de545ba","year":null},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.796260Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:2082dfdd5d04ea822953148c30b89ba1773df8e5f66b992b5d2989cc01f02c02","observation_id":"7d3fc5cc-cdeb-4bbb-b135-1d07324da746","resolution":{"observed_at":"2026-08-12T16:32:56.077807Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:56.051465Z","title":null,"venue":null,"work_id":"b08a86bf-f06e-4ce2-8341-8a9af55b460b","year":2021},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.804335Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:84835b1ce9e3416ad01950643e21676bb0f706bcb530039baff2fce3f087e071","observation_id":"14d87816-1254-47fd-9507-e75df1ec0174","resolution":{"observed_at":"2026-08-12T16:32:56.058271Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:56.019112Z","title":null,"venue":null,"work_id":"b85809c0-f419-4490-9b12-49c5966dab64","year":2024},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.812064Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:807f404aecd47e0d9b0d46aff0d0666ecb7c49a4794fae16d3131e1a88a3049f","observation_id":"3e339120-60b6-4d83-b6dd-5a720208314a","resolution":{"observed_at":"2026-08-12T16:32:56.026496Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.10750","last_updated":"2024-10-16T17:42:31Z","snapshot_observed_at":"2026-08-16T14:00:24.119005Z","submitted_at":"2024-04-16T17:31:39Z","title":"Antidirected trees in dense digraphs","version":3},"cited_work":{"arxiv_id":"2404.10750","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.10750","snapshot_observed_at":"2026-08-12T16:32:55.889779Z","title":"Antidirected trees in dense digraphs","venue":"math.CO","work_id":"b1345c8b-0193-4d84-aa0e-40d21e09fdf1","year":2024},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.818131Z"},"links":{"cited_paper":"/paper/2404.10750","citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:6db9053dd6365b628744ddb65393f947f7eb0ff50b0db0c08e1f86589f205a5e","observation_id":"3eab2878-f2f9-48e8-b743-d30a1b246148","resolution":{"observed_at":"2026-08-12T16:32:55.900130Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:55.995715Z","title":"Stein and C","venue":null,"work_id":"9f908954-1b32-4725-b00b-2dcaf777c5ec","year":2024},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.825516Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:2b8dc0b8325e5db461ccb8e25fd626e567c9ff477402aa43c309f28fc043e53b","observation_id":"da8aebfb-8b2d-42fb-9362-ba2be9fcd215","resolution":{"observed_at":"2026-08-12T16:32:56.001611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T16:32:55.974690Z","title":"Sudakov and J","venue":null,"work_id":"2551d48c-301a-4361-a263-e03424509a09","year":2010},"citing_paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T16:32:55.833653Z"},"links":{"citing_paper":"/paper/2411.13483"},"observation_digest":"sha256:d54d4cb4755439d4077f4272f436918018357e8f4dfa0198628f9910849fe746","observation_id":"0c0f2bcf-686e-4176-b504-881fefb1a4b3","resolution":{"observed_at":"2026-08-12T16:32:55.982157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.13483","last_updated":"2024-11-20T17:34:59Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-15T11:26:01.095137Z","submitted_at":"2024-11-20T17:34:59Z","title":"Oriented Trees in Digraphs without Oriented $4$-cycles"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":2,"verified_fuzzy":11},"total_outbound_references":21},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 1 inbound Pith citation observation for arXiv:2411.13483."}