{"as_of":"2026-08-13T19:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cdbfd0dbfa4b706fad80b511f4668fa8291c2461b6795fe9a4fd8f63240c4e62","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-13T06:32:02.005865+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-08-11T01:17:47.686111Z","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:ad98a5df30adc2717ee3b1c8dd0d46fc92333c85856a79b230ed1320f76d3f8b","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:86d21df37f1d750370a5e1beb8c64095d1f0540be7cbf46d574fa5a875f413f4","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:35387cb879ef850ce9984e5617c43365c1340146ec651c2a597577803a3875ca","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:25c84df9b89f1e5c0b7fb45377e81b620dce383b1af1f9fe827222aaceaa30ab","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:e49088b8d37d14b0036a20adbc1f87c3758f98f0d473d1ea26698ebbd90c8741","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:d8c13938174b37a95a82567db16e4710527d63bdfe06bb2da28696f0b4c78fba","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:3a83884554cda5f70b00bbf43ee663dd17564b70fb5045aadb9b3155ee042577","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:39be70632d27a2db26311b91c4a842968f6196f0690a55e42dce5624ef742cb3","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:e1b1a4156774ef09baa80b0b3ac4abeeabb179ebcf4ff78f5b47e3080155d0d3","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:1a2892b3b62d46f391f088846f97153ff79355a1fcf1445d89c2b75a2a0f34f3","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:d6ec4369622ec85d2eb509e352ebe06d82fa3a20ee3b14b14ba3ca8480467614","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:e99544b819b47c899f3ffcc2d14634fbf965fb127b1637e4ce03a6cff186f6c9","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:b0ea537f57ecffbb7b40d766c11ae9babf4bb144f41dda7752506db1e24787e6","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:9ea8a0ca92d59fad7f38ee6cff72f15057a0bb91ce026bd6d83af696c3ce0a7a","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:cd2713dbd372fc7814b920ee026f83eb9b5870c9af5dbf8029e9cbb88ee603f8","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:c4045e81b475355a249d92d5de9b84c9354aa733d1576924696de5a534a5f3cf","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:32425fae9db53bf0a6e3b4ef0e42a48379f7f8cc67fc7efb3c0e80320ef43051","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:ed34b6c2c316651e9d57944c5d1bf0a3eff22699ca1ec8d3b8f2b542000f49d2","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:b3f3791a1fb3a1e9be1b4ae5a9a8b315675dc870ce9041d591b84bb908785e4b","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:fb0cb15a5692ea00caa9bca0b710f0f4d9aad7e95cfb53c9fef67208d82f061d","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:565b4922bc38e9ac1a457c3edef972ca0b665852c3ec7f8dda4f4a2f2ec61722","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-13T00:09:09.991409Z","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:3cd1f4e63487a095a03be5c0c317f0f89cfb192d751932c32a40c3b05e55b0d6","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:0e3c7e9b7a0d4c6cbff4f1064cba37cc12b954c14ec30dd8f225f3ca9bf4c233","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:c3516da803bac410ca4dc8b9613e41eeb2ab78edd7d9c539f9eabdd86de23d9b","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:0c5be3ea910da29fb6fb8f7a7df051afa3d95e74e26a9e2ff6ac620aa773f8bd","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:9b804343d12a89282ac13e8524e69f0544100838ce1cb57a410c5eaa40a23e44","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:1a38cf26267069dd31b780156b182e59521d7dcf66d317003073e763f73c5290","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:9eaf962ffe79509d49dc10ce05342bf623a727b2ea177760ab3b89c125afd4fa","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:a213336142c3b2f4905dddf04d50374466a9c3aa043936b4615ba3102d13d2de","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:43a3a6989af5258a7a564fe55896a7c28fc6c1136dffa82670a51524fac8569b","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:f074b06740ee3071c55d55e1ec3de0745d5d12425126edbdfd213b44dd6b99e9","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:c02c0961bc1482befeaf33aa63c8e4e2676eb9ae208072680e9ad2afe6df4224","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:c7e1f4c1da1ae317883c821cbd93867df57e90eaa5dab2efbb2d10d3e968fa88","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:89a64e2fdf4a4f92a7cc02b7dd2fb4671e1f005abe9b5c85b55cffb58ae2ea19","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:81828e7831bbc6a75e8cb14edd2bf638755cfa39c796da0ce974280b8be98a98","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:5a920df048ca67133bdb334b93f372248bff121fc372c507f4b98c6154f6a7e1","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:ab6504f9e71e881f68dc1071c4983b975493c1fd079be7b1dcb2a239c65fc17d","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:199001e256e6fdfca92c31cef61f1cbec876ce38107b85e1d4e91ad4dd115f5c","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:09c2a625bf7b85fa7a7b5f56d90ddaffab09da3c46555a73f3a3e657b62706ac","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:80fd8dfa885aa424f0b41601ec5c4af246b48cc61f5b58a7a3d1627b91dc49de","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:1eb52771e34611bc12081f0ab787df3314de2ce38f096c1d085c8a04e3f06f13","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:ac3c8d5f9ca9e233bfdce367f1ad8487f8e57eafb08ebfb3f74f704295d843ca","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:535a352063a530e8f1a322a72bfe5682589d22d933247730ecc0f5204e36a0c0","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:3e0e33fa66b5c9c57a7a052f6fd6e4a516c545d36dc93809f7c6b4e41be22159","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:0d4597f799372648bf80e4e3515ad80509f6e286514d53649c845921821dbe61","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:82e80b00d19c4419477f392513d67960e993a0b05b980c734dcd37478675c647","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:e10107653f09024c0a23e18e416b2e4b7dbc5feb6e9fc2793d09935199466e6d","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:2637563a25e979eb6810f4ef3f88ce37185353626686c0e2c7a82854c9986122","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:acb5c62e79d35798716887bb84d24704194415cac71f021da48e8cc876b4f6b3","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:5cf3f2e54c8ba92e4eaf00084a532bd6f667d89cd59a8ac0099792ffb5324d75","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:6da7cf2991f19250ea9672a4ed0e08b32716b108f16fcb1480343d2a2fc0809f","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:126606c9cbca76023417cc3700bc0b5a519d01fd5c75bffe3f5d247cdcd66640","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:9a98dae80740fb8c27983a6cec88ff5e689d9e8df7dbbd87083f761d55b88565","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:bd36a412d5b052fc08e7cca6b669303fbd45f1ed0dcc2d6cf2e2c86caf3676d6","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:31a4ff10b33ad1fbdb6b70571f6176e0c1fdf9f6ab8fde75d58296a247d84741","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:4a6eb9db845e24bd734c68240310fdfeef25ed34adddabbe8220907d98dd1ff3","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:e1d7ed03ae6fd6b3c5cb3382fe21beda84b8793eb98524a4168f020c4387270b","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:0e2d8b6d59432a98e1df8a11154ebe52d1eec8e9a022baf68edab01618235cf4","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:d62bee9bfa548868964bc9738a3c88bbf0d26bb337764aaa71feccfc7efa5fc3","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:907ff9f3076d235eaece79c52f9a6429e2576f337558cbbe7db32b23c52ce66f","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T10:32:59.967799Z","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:078cbe7c87cc071d33435447d65c0bec989b8bbccaf01fa8daf94cb91702efdb","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:79b77c702b1a76be7f4faf74f59140ef0204cc3233736204ca1abb824b36f85c","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:af08f54c75550fcab38053d20626d6c51c4e6ee50174816f2fab16450a3f28a1","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:6ee829385a6162af37653e7885b25bd50b55cb07bd22b45b57d4ce6de6a53b51","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:c2910538502adb5bd684a9a2100a30923c656b48bb1fa31d5d896a87b3ce0a5f","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:da32d54ea4cf2a044f26f7e59be9bea2064d5b55648f6e7e99845c8835bba838","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:fa1bcd2bbf11bac6f8d50bafff9caabe9396d034e5ea49d9ead94ae43b194480","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:4155427ee01eafd36a05f52d68cce15924970c85f50927128724c66221679879","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:6234bc6a70eda281730e005b078e009c6a152a88d5ec26da1ba6aa57b64c3ccf","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:456077e8a8e301bcde69d211c3dcb5a7826a2f10b35f91cb9fbe2e90eccad15f","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:8645d433a1d074c8bacefd516a4263ac1194ac7f89da1625dde4179e953ed7b2","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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:df7604f9e8b6ff642588baec15adfd668088019c75d8909768e7184b20f64f0e","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 71 of 71 outbound references and 1 inbound Pith citation observation for arXiv:2506.23186."}