{"as_of":"2026-08-09T13:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:54d03814086f722e36f3b284d6fe4892623613f1806f35a306d55a0e65711291","coverage":[{"denominator":71,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":71,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:01:48.528382Z","state":"measured"},{"denominator":72,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":72,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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-05-10T07:46:13.522793Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-10T07:47:12.241046Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"cited_work":{"arxiv_id":"2506.23186","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.23186","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bressan, V","venue":null,"work_id":"9d052335-3677-4012-a041-4029e64f0b94","year":2025},"citing_paper":{"arxiv_id":"2604.16159","last_updated":"2026-04-17T15:29:15Z","snapshot_observed_at":"2026-07-31T12:46:03.148411Z","submitted_at":"2026-04-17T15:29:15Z","title":"Halfspace separation in geodesic convexity","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T07:46:13.522793Z"},"links":{"cited_paper":"/paper/2506.23186","citing_paper":"/paper/2604.16159"},"observation_digest":"sha256:aa5990ffdccda54b5df42681a491dded9a734dbf081bb0b0e570b0ce1b2b5711","observation_id":"634ba2f1-df7e-411c-93f1-e0f4aaec6ae7","resolution":{"observed_at":"2026-05-10T07:47:12.242305Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.23186/citation-record","integrity":"/paper/2506.23186/integrity","json":"/paper/2506.23186/citation-record.json","paper":"/paper/2506.23186"},"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-06T22:01:55.042704Z","title":"Afshani, E","venue":null,"work_id":"a145e873-e44f-47cc-a545-46d658b09de1","year":2007},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:42.588156Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:01f4294282926bf422f2ec99af1a1064b683e991a1e5330b1fe85a95ca94ef99","observation_id":"4d72cb92-eecb-4b2f-8b72-f475cfb51d4f","resolution":{"observed_at":"2026-08-06T22:01:55.046575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:55.033326Z","title":null,"venue":null,"work_id":"e0e07c10-aa09-4f05-84c5-f1c5237bcfde","year":1988},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:42.655920Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:1f83ed7e2288a2b1caefdb525b8294b81281ffb3cd6afa2f2a617b4b33030057","observation_id":"59376537-a758-40ea-9a92-95d29460cec7","resolution":{"observed_at":"2026-08-06T22:01:55.036622Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:55.023694Z","title":"Aspvall, M","venue":null,"work_id":"3065bc2a-8ed3-4c0f-a3f1-35a3334653c0","year":1979},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:42.717898Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:ca9f4d4385d89b486085a504e2c7100dff9e54f5d3c49e226493526823761872","observation_id":"890ea0f7-fb69-4875-b218-fd15a2abd066","resolution":{"observed_at":"2026-08-06T22:01:55.026715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:55.013340Z","title":null,"venue":null,"work_id":"a4ba6125-8d0d-47f8-8902-8592d99b6d8c","year":1989},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:42.808209Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:d6011d95f256c85f212c7ce3a1ed0035a2110caf1ebe0bb3e3444c204861ac92","observation_id":"05c85bdf-9630-47fa-ab4a-515b7a06d7c8","resolution":{"observed_at":"2026-08-06T22:01:55.016478Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:55.004166Z","title":null,"venue":null,"work_id":"efd55706-d815-4695-8cf0-fefad105110b","year":1972},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:42.900629Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:ab4680ab2457c94d35a5f586d5ba0fff199709c1a60b0a69a9e512f72a5905fd","observation_id":"14cdeed2-1988-44b0-af73-e2f042cebf7a","resolution":{"observed_at":"2026-08-06T22:01:55.007351Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.994201Z","title":"Ben - David and A","venue":null,"work_id":"21ea4849-9bda-4f37-8a4c-c136a48ce33e","year":1998},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:42.975143Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:d5309718d1c0e722f2389492006f19c08db93035f06dc4afde2379ff2ee08ffc","observation_id":"2508c249-a9ec-4899-bbae-f74502f62dfb","resolution":{"observed_at":"2026-08-06T22:01:54.997925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.985276Z","title":"Bj\\\"orner, M","venue":null,"work_id":"b8512220-aa20-4483-8ee3-aaef37d80f88","year":1993},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:43.086213Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:174610c214e2645cbfdce06da42c2265d706b7435d4059d489e43887f2cb7645","observation_id":"5cfa3965-dfdd-4c44-9e9c-ffc0c3743f49","resolution":{"observed_at":"2026-08-06T22:01:54.988363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.976513Z","title":"Blumer, A","venue":null,"work_id":"d439674b-afab-4b17-9ac5-9fc807ca1198","year":1989},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:43.159452Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:2cf779cc594acc43d43877ea4038f5784300c651a87d637c24debdfda20fb945","observation_id":"b1d654ce-b0df-46ed-832b-2250376cf751","resolution":{"observed_at":"2026-08-06T22:01:54.979790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.967881Z","title":null,"venue":null,"work_id":"351dedbb-0c83-4b34-a11e-2d07bcdf0742","year":1992},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:43.225979Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:48ba26aad6dacac0663245df9b2eecb430ad3de9cc7bb46f98fce4385e94a112","observation_id":"4e87d97f-4a34-4e70-ac2d-11304fc03b10","resolution":{"observed_at":"2026-08-06T22:01:54.970742Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.958792Z","title":"Bousquet, S","venue":null,"work_id":"fbfc04b7-0ab5-4ef5-bcdb-4a2aa1640509","year":2020},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:43.302667Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:376c223c6bcc8d920ae694540ca9768e4adcf3aa6b3d5221a64b9bec1b52a32b","observation_id":"59a441b8-161e-4e48-ab0c-c99c1995fbf1","resolution":{"observed_at":"2026-08-06T22:01:54.961673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.948422Z","title":"Bressan, N","venue":null,"work_id":"d5a11b82-235e-40a3-a932-b28d4586a05e","year":2021},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:43.358320Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:8be7bf5d3d34462bc301583e1c9f8bae4d577f3b96e2c2509b5444c685f61495","observation_id":"00619ec3-1e5c-4ff2-89fc-6d7f863b0024","resolution":{"observed_at":"2026-08-06T22:01:54.951960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.939071Z","title":"Bressan, E","venue":null,"work_id":"8ee33085-9820-40e5-b093-c73700db5479","year":2024},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:43.446545Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:74985be2c9e0f80edba2962e204b6a37c53d163f8f9732dd2bf3c2bcbb551b0c","observation_id":"7ef900a8-fdd2-4d1e-8ded-8a3f67ef9b56","resolution":{"observed_at":"2026-08-06T22:01:54.942190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.929772Z","title":"Cesa-Bianchi, C","venue":null,"work_id":"4132b2a5-85e6-45de-ad14-205de3218d83","year":2010},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:43.533848Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:3d614e3944ea88ba62f3feff295b0231dee728f1cbc004c7216568131ab46242","observation_id":"13bff329-0351-4e51-bdc3-2675672b850e","resolution":{"observed_at":"2026-08-06T22:01:54.932839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.919230Z","title":"Cesa-Bianchi, C","venue":null,"work_id":"5e84a424-798b-4508-b79e-d0b13665a5e3","year":2013},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:43.619489Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:d401fe7691f4d8ea4bcaaa2006717b42dbe3a99055ed49178fcd8fe9b67e8178","observation_id":"c7d39fff-bfd0-4941-a740-564c807cdd8a","resolution":{"observed_at":"2026-08-06T22:01:54.923093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.909730Z","title":"Chalopin, V","venue":null,"work_id":"9e294d3e-aa8e-4c36-a517-5dbd8e90f83c","year":2022},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:43.719626Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:f64c3092611cb4d71c6b127d2dbdc09478e3f56443e6617ad013f4b2ed50c4de","observation_id":"c1c0e907-6052-4917-9c79-28c69e0b3b96","resolution":{"observed_at":"2026-08-06T22:01:54.913018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.900273Z","title":"Chalopin, V","venue":null,"work_id":"c17114bf-d7c0-41e3-9659-b216f2cdcb01","year":2023},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:43.814152Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:168970f72f1ce193074b05cd81e0c55b8c0bd6d45a975bcc7b85c5211d8213f8","observation_id":"58d35bcf-18a3-4205-8d21-a704613e78e5","resolution":{"observed_at":"2026-08-06T22:01:54.903623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.891140Z","title":"Chalopin, V","venue":null,"work_id":"4060a607-09c0-475a-bb55-744cd129a6c0","year":2024},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:43.887445Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:3c3a78c6044afc25e8e666c8b536655a2c2e70c832db0d03a6f9498bf086a377","observation_id":"2a345a82-a91c-4cff-8393-a6eed5985aad","resolution":{"observed_at":"2026-08-06T22:01:54.894041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.882444Z","title":"Changat, H","venue":null,"work_id":"bade181a-7b73-4cfc-a61f-77d017f6faaf","year":2005},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:43.995267Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:7ed259534c55b0005ca71d68fa90e4b3e44a269f5533b5f7a6d08be6ad60daa7","observation_id":"ff6965bf-771e-4851-823f-cebce4253d92","resolution":{"observed_at":"2026-08-06T22:01:54.885160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.873061Z","title":null,"venue":null,"work_id":"acf4e5a7-c289-4205-a313-2cc5a36200a6","year":1986},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:44.081482Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:3bb63eeebb4228c6fc2dbba0f90517779ec3f97e191134458fbc5a23dc12d80d","observation_id":"3f325769-68db-4791-bf57-4fa1869aee7d","resolution":{"observed_at":"2026-08-06T22:01:54.875972Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.864439Z","title":null,"venue":null,"work_id":"20374d30-27d1-44d4-bc04-26353ebf2019","year":1994},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:44.176724Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:ce10a671fc6c94f799b7131b21730a0c30f8fc94a1fd9f73e81dce24d76b78fb","observation_id":"faa91f26-8ee3-4994-9165-f27a026b2899","resolution":{"observed_at":"2026-08-06T22:01:54.867469Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.07512","last_updated":"2024-05-13T07:20:06Z","snapshot_observed_at":"2026-07-06T18:13:20.536375Z","submitted_at":"2024-05-13T07:20:06Z","title":"Separation axiom $S_3$ for geodesic convexity in graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.07512","snapshot_observed_at":"2026-08-06T22:01:44.291719Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:44.291719Z"},"links":{"cited_paper":"/paper/2405.07512","citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:2e928880ce21a3806626d4d83af4d6b2280fe65e4d7e0c7c41f524d797c064b9","observation_id":"e1a5d575-323d-4bb0-9e27-1c4c89ee3b15","resolution":{"observed_at":"2026-08-06T22:01:44.291719Z","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-06T22:01:54.855484Z","title":"Chepoi, B","venue":null,"work_id":"1cca872d-45c4-4534-8594-863dc2569358","year":2007},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:44.383438Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:eb0c18ea4a2ea0fa2be98f3a90766de1878eab31eb2beeee6021fdf9990a7b54","observation_id":"951910b0-83ed-4c34-9990-721e3a37f86c","resolution":{"observed_at":"2026-08-06T22:01:54.858724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.846184Z","title":"Chepoi, K","venue":null,"work_id":"ffb6abad-338a-4c59-8d75-b58d74638df9","year":2024},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:44.504811Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:08f3a76998cc841685cf7bc4a31b01fefa19121d609cc311818f1b21d16c9023","observation_id":"ef74e05c-b73b-4e80-84f5-2d946b45e4f9","resolution":{"observed_at":"2026-08-06T22:01:54.849153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.836824Z","title":"Coudert, M","venue":null,"work_id":"72cee5f8-08e2-4ed5-a363-0e21ed2be526","year":2024},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:44.595265Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:eb22c78823bac2b2b13713dd36bccc5b4e0201615790ce1057e35a7d043d69f8","observation_id":"4b90bf56-e77f-4ae4-ae5f-0bc64dca4cda","resolution":{"observed_at":"2026-08-06T22:01:54.840096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.826834Z","title":"Darnst \\\"a dt","venue":null,"work_id":"8219c89e-10cd-4320-ab14-76b29159160a","year":2015},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:44.678877Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:a3f83b7a851d7a83ffff44f7813b774c0054f805de59b3f8a81a52a169fe2af5","observation_id":"ccf6dcd7-3fc2-415c-8df4-9280744a6b8b","resolution":{"observed_at":"2026-08-06T22:01:54.829915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.817506Z","title":"Dasarathy, R","venue":null,"work_id":"60f2d5c4-7aa6-4db8-bfd5-eba0c1b38d0a","year":2015},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:44.770822Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:5801894f936662adf3848c950ff564c35799aae493524c88b83bae6976c63f3e","observation_id":"3df0a472-a029-49c3-8478-98ffce3856b4","resolution":{"observed_at":"2026-08-06T22:01:54.820860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.809108Z","title":null,"venue":null,"work_id":"67d301bc-4d0c-4831-81b4-bfcf331ec93b","year":2010},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:44.858995Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:8f2cfd7737e03fbd7175d073d6a93fdef0e8a7595fdd40786792d4db15a2ebe3","observation_id":"a16aeee7-5776-4551-8665-f2735301f812","resolution":{"observed_at":"2026-08-06T22:01:54.812055Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.799814Z","title":null,"venue":null,"work_id":"028b96fd-ce31-4f9f-8552-b66a1772d62b","year":1988},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:44.948614Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:b63182a7ee74dd6c742ccc126ab8e9c0df47e6db8612d347b4b06bf827ada760","observation_id":"d70ea87b-2271-44f5-b31a-9bd97dc4087b","resolution":{"observed_at":"2026-08-06T22:01:54.802976Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.790821Z","title":"Duchet and H","venue":null,"work_id":"95f08708-b34c-4074-941d-ab5e2b1147c9","year":1983},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:45.023940Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:6e830b2f6f3c93d047870ab5210dd3de6ccd548d8d307dff40beb3c13f9a1e98","observation_id":"45af5597-1c07-4065-8ac0-48e3d22ce090","resolution":{"observed_at":"2026-08-06T22:01:54.793826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.781474Z","title":"A general lower bound on the number of examples needed for learning","venue":null,"work_id":"7f85d2a1-78dd-4fe0-9de4-2fa88fecc1be","year":1989},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:45.109450Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:e49ad31083acf7079bdeb4b945c6c04ae018a9a617156a0ddbffa9276e363c51","observation_id":"885982a6-a68a-4b41-a134-7eeaaac8991d","resolution":{"observed_at":"2026-08-06T22:01:54.784742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.772481Z","title":"Elaroussi, L","venue":null,"work_id":"44a70e2a-2729-4bee-8c10-fcab28bdb676","year":2024},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:45.194333Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:b49b46bfa0dded67a661549d2563d959a2345e2b1f8faeffc504fa71eb628d11","observation_id":"0a4a446b-b719-47f2-9d6d-e1dfa3a0292f","resolution":{"observed_at":"2026-08-06T22:01:54.775291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.763995Z","title":"Farber and R","venue":null,"work_id":"a060de9c-ced4-4950-8a23-7f12cb4daf85","year":1986},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:45.271552Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:4b789d38e34b113f82270e92613467abdccb8851c7625b89ca87135c9fdf1547","observation_id":"5717c5d9-ea17-4126-9553-2dd98b463612","resolution":{"observed_at":"2026-08-06T22:01:54.766874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.754738Z","title":"Stable networks and product graphs","venue":null,"work_id":"c857258b-dd75-42f5-913e-f48a63bcc8fe","year":1995},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:45.355480Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:a037017c854194ab3cd7a12571e71d287fd0796dac6ca306727e2dac6e2a2fd9","observation_id":"29b1ca7c-973d-4b94-85bb-51f44c00e905","resolution":{"observed_at":"2026-08-06T22:01:54.758140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.744557Z","title":"Floyd and M","venue":null,"work_id":"5bd0a67d-a242-44e4-9af2-cfa4fd6a3152","year":1995},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:45.426365Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:ff2ce087970869c304a0184ed3f464060d554d9cfb3141f513918c7fee7121ef","observation_id":"ffb912e0-2a00-43ac-8783-5f8ded96527a","resolution":{"observed_at":"2026-08-06T22:01:54.748457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.735428Z","title":"Gentile, M","venue":null,"work_id":"aa3bd8e0-32c6-43d9-9949-c5c560a8dae8","year":2013},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:45.509644Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:d20bbf7e99c799f82c8505a3e469877956bac675ecab40a6789ef9577a2f7df2","observation_id":"3e47fad4-8bee-470e-9777-13b59c86033a","resolution":{"observed_at":"2026-08-06T22:01:54.738568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.726440Z","title":"Glantz and H","venue":null,"work_id":"103f34b4-8ba5-492a-a1be-ff3ce5e3b617","year":2017},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:45.609866Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:806fa5398275933d580cb50a09e1c207d45aa2ef506ad0a5aec69dc168f0933c","observation_id":"f224466e-920f-4e5a-87ec-674b1d9aa373","resolution":{"observed_at":"2026-08-06T22:01:54.729404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.511798Z","title":null,"venue":null,"work_id":"bf8771c6-fb23-4abe-9683-0cc1cc1878bb","year":1995},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:45.689339Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:a3dff0a38a6a2b28b8ad6439d4fcd67ced37345304f5be462692ee9be8549ca2","observation_id":"79b91660-a495-41f2-89d7-4af43dadde7c","resolution":{"observed_at":"2026-08-06T22:01:54.686164Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:54.131591Z","title":null,"venue":null,"work_id":"95fd012d-6140-4249-941a-99611d61ff7b","year":2020},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:45.737467Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:281454478ba882aa4139c2ac2ab25336ad15f521722d3b2dacf282a65b9674d2","observation_id":"17b6e729-9838-4182-8b66-e1365847a654","resolution":{"observed_at":"2026-08-06T22:01:54.289414Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:53.786207Z","title":"Guillory and J","venue":null,"work_id":"02b95329-feb5-46e6-9f63-3897b60923b4","year":2009},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:45.836516Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:50d0241a213640c1a97f020509a12452089781618c6a4de3fbcca2bfbb26dd7e","observation_id":"0a72baf7-50b5-4cb1-bd5f-fe5df31df186","resolution":{"observed_at":"2026-08-06T22:01:53.926251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:53.470014Z","title":null,"venue":null,"work_id":"b30ae588-cc33-4528-bfc4-07e334eff754","year":2006},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:45.952955Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:88720f987385b6da10dbbea3291fb7aea40d25a9195013f9a3584374064b92e9","observation_id":"82d84eea-2ed0-47f3-80d8-16cec4d85aca","resolution":{"observed_at":"2026-08-06T22:01:53.635266Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:53.417555Z","title":"Heged u s","venue":null,"work_id":"abf9fe83-891c-4c7f-88f2-db0a07a39ab5","year":1995},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:46.035070Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:0db8c666ae1d565be7c947c1f67839f1cbd0319699fadb640e9fc13dd35e1420","observation_id":"608c81bd-c51c-4785-841d-503425cfe6aa","resolution":{"observed_at":"2026-08-06T22:01:53.463174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:53.259443Z","title":"Herbster, M","venue":null,"work_id":"4dc6aa5b-4788-4ee4-9e6a-3526c6be916b","year":2005},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:46.156468Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:2825754f5ca1e9d08b947ec0ab177824440c2d916e5b0e410ca86666795d2cae","observation_id":"2aee94cc-76eb-4b6b-b113-839016ef9e45","resolution":{"observed_at":"2026-08-06T22:01:53.323565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:53.106938Z","title":"Herbster, S","venue":null,"work_id":"611b0f26-3e57-4faf-b938-f4517ffa68cd","year":2015},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:46.225634Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:81938d507a82c1982b558bbd7a6dabd443bf00f4c5fe73ed83f0ae65c536df87","observation_id":"3f3d14a7-d1e5-42f8-ad7f-5d1ece57c7bd","resolution":{"observed_at":"2026-08-06T22:01:53.192852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:53.001505Z","title":"Kleinberg","venue":null,"work_id":"893d488c-60ba-4bea-8fc0-837ca21363f6","year":2004},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:46.300058Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:9439d1895d0286acbc4a4f8d68d463cf6c13982ea693b16ecc098c69ba1bdf72","observation_id":"2eab41a2-0c6c-4740-8080-531bbd5f34ec","resolution":{"observed_at":"2026-08-06T22:01:53.075561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:52.826560Z","title":"Kuzmin and M","venue":null,"work_id":"43daf2c4-86dc-4076-a228-67d7abac3683","year":2007},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:46.349429Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:7b5ad6847378ee350e91b850c5057a5601542d9492069672d4704b4c9d6632d8","observation_id":"919756b6-a327-42fe-b1e9-186a3d2afe1e","resolution":{"observed_at":"2026-08-06T22:01:52.901857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:52.650045Z","title":"Le and C","venue":null,"work_id":"7277286a-66a7-4a44-8b6d-82329e5b7fc7","year":2024},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:46.423338Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:b099f51266ddedd4046db4d5c7d8c3ed246c7db648ec584abca8756ab2a46317","observation_id":"384a48d8-87c8-415f-8b0c-c09369c2cb6e","resolution":{"observed_at":"2026-08-06T22:01:52.720143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:52.509114Z","title":null,"venue":null,"work_id":"b59f3a03-cb51-4247-bd62-a61258edc888","year":2013},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:46.491963Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:0fc858d951e79e1235d7eadfb3a504d5851f8eac407761c6677df71426b12730","observation_id":"b2d69842-20fa-4991-b5c6-1ce7b5e79f77","resolution":{"observed_at":"2026-08-06T22:01:52.595276Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:52.374626Z","title":"Littlestone","venue":null,"work_id":"662af0f1-35fd-454d-86c4-bbe59669fadb","year":1988},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:46.572748Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:d4a2b2d688144447e5c92cd3549058b47817fddcee15c7d483cae984a6cb0633","observation_id":"8d5923ae-9b7c-48af-b734-918683fa1fe7","resolution":{"observed_at":"2026-08-06T22:01:52.435596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:52.251119Z","title":"Littlestone and M","venue":null,"work_id":"d7b1e596-7d53-4154-87cb-363c0d8b9641","year":1986},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:46.674963Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:2de17ea942a3f76f4857722c9f1b45b87a78f970c5515906efc11059aa793411","observation_id":"63db6ab9-1f6c-45eb-b155-cfab8351fe35","resolution":{"observed_at":"2026-08-06T22:01:52.313693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:52.118354Z","title":null,"venue":null,"work_id":"e0b3d2e0-13e1-4314-b218-fcb84322f2cf","year":2012},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:46.678509Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:0c967bcf8f3c750306cd451a19fa6ea894694a7fb71cf2c123b964d1153b1129","observation_id":"7e12af1d-0a2d-44c1-9710-054d3a1bbe4a","resolution":{"observed_at":"2026-08-06T22:01:52.169547Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:51.973467Z","title":"Minsky and S","venue":null,"work_id":"e225df11-875a-4d2d-9f40-896ec3257989","year":1987},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:46.714366Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:0bd687cbc1ede4c59836b48cdeed7b3d581af61338194b3c391c9d8c6a081d0d","observation_id":"95982f81-68d9-4088-ab40-bc19231be37b","resolution":{"observed_at":"2026-08-06T22:01:52.040336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:51.825871Z","title":"Moran and M","venue":null,"work_id":"67a69b50-5e10-4dbc-9f29-6e254ec035f8","year":2016},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:46.779427Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:174664db6e2757505a2033595fa777e6a2453c64c226afb201f6f84032be1f5d","observation_id":"ce6f9b2e-63fb-463e-98c3-b41ac708a614","resolution":{"observed_at":"2026-08-06T22:01:51.859893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:51.691233Z","title":"Moran and A","venue":null,"work_id":"21af7cad-1d5d-4365-a193-39757876dd89","year":2016},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:46.898326Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:0c2df639be082e3bca4daa3b3c526cfd71946c91f4d426937f4d7fe20eadbbd5","observation_id":"201609e8-bec5-428c-a794-822c32d2bbf5","resolution":{"observed_at":"2026-08-06T22:01:51.733292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:51.543833Z","title":null,"venue":null,"work_id":"103e2b2f-ca57-441e-bcd9-e3278a794629","year":2013},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:46.996316Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:d1dd2d1566ff6fd1035a9f31f87c8f2a434888390ab1e94dfab389f24f60e558","observation_id":"7c5ee1c5-bf3b-4f01-9801-56044c4b4aa0","resolution":{"observed_at":"2026-08-06T22:01:51.605542Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:51.430400Z","title":"Pelckmans, J","venue":null,"work_id":"efee19f2-25b8-4c2b-bfe9-033cd35a82dc","year":2007},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:47.095879Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:a886ccfb47f3776d140b85b84e80ca31ab4f342ef5ab210a39c327e6e81a27ee","observation_id":"1857312e-1c50-49c4-96ec-6c0cfcf04d2d","resolution":{"observed_at":"2026-08-06T22:01:51.487176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:51.256318Z","title":null,"venue":null,"work_id":"d2566efe-cf5c-4fc6-b989-f4c9d0348bb1","year":2012},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:47.175875Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:a6b986f55008ab96f7d8a810ccfc550c524fcb208efbc8081446a51f85260d0c","observation_id":"1cef50c4-4bda-4ab7-96da-4ee069efb7ec","resolution":{"observed_at":"2026-08-06T22:01:51.333861Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:51.042366Z","title":null,"venue":null,"work_id":"eaaf09de-032f-4b50-a8fd-cf79491cef58","year":2022},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:47.267589Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:27531006410f674f6da725bf6cd8669f5305a0e2a58ff39c806fcf12ea4872fb","observation_id":"306c6164-e54d-4a6e-bcce-04d3ea13e15c","resolution":{"observed_at":"2026-08-06T22:01:51.164720Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:50.783052Z","title":"Seiffarth, T","venue":null,"work_id":"3cfb9106-9710-44c3-bfec-4f029698e907","year":2023},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:47.344131Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:c7ec51e2b52ab99b0b36e8f22c0d3a3915c988622637d714e2416aad883136f6","observation_id":"06973b3b-16bc-418b-90ce-ab93ce8cb069","resolution":{"observed_at":"2026-08-06T22:01:50.885737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:50.591053Z","title":"Shalev-Shwartz and S","venue":null,"work_id":"4140c111-b651-4bb5-a4e4-dc4ba0424595","year":2014},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:47.427144Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:9804c9ef48d53435b6c8366393400c6d282f5cbc777b697a4ceca56ddf103248","observation_id":"633a3a8a-b1c0-4acd-b754-3822342bfc72","resolution":{"observed_at":"2026-08-06T22:01:50.673569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05453","last_updated":"2025-02-08T05:26:02Z","snapshot_observed_at":"2026-08-08T19:13:22.338944Z","submitted_at":"2025-02-08T05:26:02Z","title":"LLM-Powered Decentralized Generative Agents with Adaptive Hierarchical Knowledge Graph for Cooperative Planning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05453","snapshot_observed_at":"2026-08-06T22:01:47.518001Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:47.518001Z"},"links":{"cited_paper":"/paper/2502.05453","citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:38b27bbac9117fd0004894a78303af2df10e003d1451c52a29c2cdedfce7d7cf","observation_id":"e4a35d72-1399-4737-ab4a-c72cbe1bb44f","resolution":{"observed_at":"2026-08-06T22:01:47.518001Z","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-06T22:01:50.414874Z","title":"Simon and S","venue":null,"work_id":"c95af35a-0040-4107-a15d-db22916cfe05","year":2015},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:47.613073Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:ae9304ab48b8c5b516e2864c4419a22a855bbfdd823930c924b1f9794574c336","observation_id":"b9e4d04c-83c8-4af5-8be7-100ab94296a4","resolution":{"observed_at":"2026-08-06T22:01:50.494221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:50.277957Z","title":"Self-directed node classification on graphs","venue":null,"work_id":"bb95c844-9ed3-4ff7-a679-626c7e075fc4","year":2025},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:47.692108Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:858480fcf5427673e9999a92ecc64fdf43df5c5f8ad1827d44ac35acc495f196","observation_id":"2227f527-f06c-4722-a77c-d9a9fd628249","resolution":{"observed_at":"2026-08-06T22:01:50.336791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:50.067114Z","title":"S ubelj, D","venue":null,"work_id":"fbaa33ea-4ee6-4e47-b15b-765831b89131","year":2019},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:47.771085Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:7901cdbfd315fb2cf13d7a427437fa3fc5a6e2456e78f03994dee953265f5c0f","observation_id":"3b350c36-0e77-479d-b4b8-9ddb51b1a008","resolution":{"observed_at":"2026-08-06T22:01:50.190309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:49.909046Z","title":"Talagrand","venue":null,"work_id":"1a2cc9c7-1d09-4c62-8337-1e4df3ab0e62","year":1994},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:47.845186Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:8fe01eaa7acaf9465eed9321e046028df5438820751e8670502d761a5803d22c","observation_id":"09dd5065-cf7e-4964-b9a9-20f475dacecd","resolution":{"observed_at":"2026-08-06T22:01:49.984208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:49.732617Z","title":"Thiessen and T","venue":null,"work_id":"482a43f9-9d6b-4d82-b1e8-6bd993f3de15","year":2021},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:47.929185Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:d4e7c1ff46737e630e8350d087677d9970db737abae1bbd5b8bc082e878c4771","observation_id":"7cd4877d-5c41-4501-a4ef-4bf41a384cf2","resolution":{"observed_at":"2026-08-06T22:01:49.812227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:49.568018Z","title":"Thiessen and T","venue":null,"work_id":"e45224f1-9fb8-42e1-b44f-46fc0b42052c","year":2022},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:48.009165Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:f05f941e8d140896087eb13c03bfc84d90f9125de0f7cf1bc0c0fec74eac75fb","observation_id":"aa90d751-54d0-42b3-b34b-2c80593663be","resolution":{"observed_at":"2026-08-06T22:01:49.647351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:49.349605Z","title":null,"venue":null,"work_id":"a7b24661-97ea-4cf6-b330-6fb297735aa5","year":1984},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:48.111740Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:9133f1c1edd01af6dc61dbce35113aebaab7bb3afa8df7456166dd717145432f","observation_id":"62ca66f1-d2d8-4a65-82be-358f8d5113aa","resolution":{"observed_at":"2026-08-06T22:01:49.464682Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:49.196121Z","title":null,"venue":null,"work_id":"1883b532-dc0e-4de0-8466-644ab497ec73","year":1993},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:48.203286Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:34bc7911081d9ed543fbdd376fda1c4667e7888ba66cf93a22975986aeee5b15","observation_id":"a607a377-9ef1-4139-b842-b2bf1938e4e6","resolution":{"observed_at":"2026-08-06T22:01:49.254972Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:49.000530Z","title":"Vapnik and A","venue":null,"work_id":"66ebac96-9bab-428a-91e2-64bc52340390","year":1974},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:48.338899Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:67ffbea64d75ccc65874b97b906b843078a054f7952c2a22da5fea00b48c9e2d","observation_id":"b1775841-39ee-486b-939e-ecc56bb40cf7","resolution":{"observed_at":"2026-08-06T22:01:49.100239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:48.825121Z","title":"Zhou, M.-C","venue":null,"work_id":"f40fb446-1c36-4012-a969-c6239afc827e","year":2002},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:48.427569Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:0354129b2d1365a8949e2490917366b9a1e354fcdaeb481516120fa1e39f8e0d","observation_id":"a0281b5d-ea16-4817-bf09-bc70c4449e54","resolution":{"observed_at":"2026-08-06T22:01:48.914929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:01:48.666184Z","title":"Zilles, S","venue":null,"work_id":"f417abe9-dbc5-4c9b-9999-768ef6f4a224","year":2011},"citing_paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-06T22:01:48.528382Z"},"links":{"citing_paper":"/paper/2506.23186"},"observation_digest":"sha256:6449e4200eb0771f2d10b847688436d94812403e1520914ff10b1fabf3d090ae","observation_id":"4a9f35cc-38a1-4cfe-8d15-c6dd078b8058","resolution":{"observed_at":"2026-08-06T22:01:48.732291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.23186","last_updated":"2025-06-29T11:14:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T12:35:02.652375Z","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs"},"reference_resolution":{"displayed":71,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":51},"total_outbound_references":71},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 71 of 71 outbound references and 1 inbound Pith citation observation for arXiv:2506.23186."}