{"as_of":"2026-08-13T02:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:487ebaa4ebfaa8dd82683005b391292bf50ee8490a400f40ce071276d8f617ec","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-12T06:34:41.77262+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-12T16:19:28.310463Z","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:e55d3e0bf25b0f99d8d237edfac27832fd99a7c838c799a68745f966385f9afd","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:5c5af596b56c797fd111bd18a87121409b2416014c642b42034674c7d5dcc24d","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:c530344ce9daa7eea409a3d703b219a49d28d45339f08cae537de7da882ec508","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:caca674773a25d83217313471634bf7876c8ad795b11685a17c611e7abe7a767","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:18199d007fb7f21623a6c8a5129e401741449c8c25e4a60b3d7bc6dd1a5d0f83","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T23:18:14.213312Z","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-12T16:19:28.310463Z","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:4768e712d6c7037283c0c7e1e98e1ad7c4e1e0ee5444115aa47e8bf7f22ac449","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:b584ab67fb5279286b0a825d01914785b55ee1bfb2c15fb984d43dadc6027319","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:548ac2e00577ea94864aa91063bcf1609f40251c8989f5da37918593a6115387","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:52a8ce23168b5fa4c99b0dd4c48afcdb4bb6d28cb9d2ff6fcbcd12b65c009244","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:9dc29e25f62c96b8f22e92bb72b3e3f3259de67cd570e9edbde136d11b172f80","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:c2cb98a57e7b0941acc4b925174d2287fdfbc95f0c63590dfe3574acb69e9809","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:b0029b1b9891e6a42c69b724bc91892c69440d06687a916903ed90c152b56bf0","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:6f2d1a22902178e0d12f6794367f56430d3b5dba4c0414258294a993a8afc886","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:78968ece7f08ef2530ce2f0a91ef939d2e52b55228924ecd9339e4295c89fb47","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:a3fed37ada6cff3b33fe1b7b10e18e17111b6bde675a89c1bd182b2dfe26f2b1","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T23:49:42.731646Z","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-12T16:19:28.310463Z","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:446d6d9f617f76a0f6c9682e9e4d7e57031f34f929852b2d269807d5e2e826af","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-12T16:19:28.310463Z","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:e42a96d29bdde1ce8e5018392e0270f3965d84bf29be88f396952cbadc87cad7","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:be5ff8a550ae18e7f6501eaec6f762bac73f4b80fd1ac6cfedb6964327362a52","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:2d34a1ce12761b2c87412e4e870986902d672797e2f6bb5066229b9814f22e66","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T00:28:53.886148Z","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-12T16:19:28.310463Z","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:621393b90da5b35d1f52201076b88d90182dff506414de6ee8c04a98130ecd08","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:f8c5110ce51a28039cf12b51be31b34414c0e19798d7c9e458deaa41f4c01091","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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:94175b166a7fd23b969332ec29aae3b181426c85c4738e8008817ef78d971558","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:19:28.310463Z","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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 1 inbound Pith citation observation for arXiv:2411.13483."}