Pith. sign in

Paper Citation Record · LEDGER

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs

As of 19 August 2026, this Paper Citation Record lists 71 of 71 outbound references and 1 inbound Pith citation observation for arXiv:2506.23186.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2506.23186 v1

Coverage vector

measured 71 of 71 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T22:01:48.528382Z

measured 72 of 72 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-05-10T07:46:13.522793Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-10T07:47:12.241046Z

Reference resolution

71 of 71 outbound references displayed

  • verified exact0
  • verified fuzzy51
  • unresolved20
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 4d72cb92-eecb-4b2f-8b72-f475cfb51d4f · outbound

This paper cites Afshani, E.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Afshani, E

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:55.046575Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:42.588156Z digest=sha256:2407dc709dcc3a8703d8a390fddf4abccc153ddee24a3781d10fd6b8d1951fe8

Observation 59376537-a758-40ea-9a92-95d29460cec7 · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 2

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:55.036622Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:42.655920Z digest=sha256:c9be0a138785a723974d253440a62b69b95046010db81725145bf1885184577d

Observation 890ea0f7-fb69-4875-b218-fd15a2abd066 · outbound

This paper cites Aspvall, M.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Aspvall, M

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:55.026715Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:42.717898Z digest=sha256:b0c930180d74fa4a56c26140642bb48002b3558341e5d7cbdfca707c519fc4d3

Observation 05c85bdf-9630-47fa-ab4a-515b7a06d7c8 · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 4

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:55.016478Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:42.808209Z digest=sha256:f7db4a90a663b7dfd00a137a1a2a2e5b51ac9ea67e67007f6cf6ffea4b7fdf9c

Observation 14cdeed2-1988-44b0-af73-e2f042cebf7a · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 5

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:55.007351Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:42.900629Z digest=sha256:a2e67b7a0632ab30962b3d34f01baca287236224b895dcd058247e87c44eb3c0

Observation 2508c249-a9ec-4899-bbae-f74502f62dfb · outbound

This paper cites Ben - David and A.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Ben - David and A

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.997925Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:42.975143Z digest=sha256:3fc3c7bda11691af6483b365c14c40b92ab151a8a8214e78592de05050ca9d97

Observation 5cfa3965-dfdd-4c44-9e9c-ffc0c3743f49 · outbound

This paper cites Bj\"orner, M.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Bj\"orner, M

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.988363Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.086213Z digest=sha256:e49be008a457bbedd1d8f418a6afef489be51d6715f5020e7cd43d95f3b7dc26

Observation b1d654ce-b0df-46ed-832b-2250376cf751 · outbound

This paper cites Blumer, A.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Blumer, A

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.979790Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.159452Z digest=sha256:dc1b359869cdb40f01d854a05aa48be144e9682ccc1fc90ad324b6a7bfa57578

Observation 4e87d97f-4a34-4e70-ac2d-11304fc03b10 · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 9

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:54.970742Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.225979Z digest=sha256:a203f53343e2f3f38d9f75efc3f22fa5238f7779128e9740b2f687c720f2e3aa

Observation 59a441b8-161e-4e48-ab0c-c99c1995fbf1 · outbound

This paper cites Bousquet, S.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Bousquet, S

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.961673Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.302667Z digest=sha256:04c94f163d535547c882353c57f019f088f7c2fa5097b2c09d9792e29bf3290b

Observation 00619ec3-1e5c-4ff2-89fc-6d7f863b0024 · outbound

This paper cites Bressan, N.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Bressan, N

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.951960Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.358320Z digest=sha256:27dc914eb1ce44f890d0d611b42dd5f505c8512b3e147f024beec0a60f346a65

Observation 7ef900a8-fdd2-4d1e-8ded-8a3f67ef9b56 · outbound

This paper cites Bressan, E.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Bressan, E

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.942190Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.446545Z digest=sha256:79eb460319b4147867c18cf8a620b5a4038ac58db845d9064deaa335c1ae058e

Observation 13bff329-0351-4e51-bdc3-2675672b850e · outbound

This paper cites Cesa-Bianchi, C.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Cesa-Bianchi, C

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.932839Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.533848Z digest=sha256:f6f4d6d82ce5c79ed028836b3fd88f4a56462007bb7f188100e0f2ec1c644bd5

Observation c7d39fff-bfd0-4941-a740-564c807cdd8a · outbound

This paper cites Cesa-Bianchi, C.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Cesa-Bianchi, C

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.923093Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.619489Z digest=sha256:75c22a72e732b7ad724419afc114c3bfc2d15ce4485c414f8ca6ea5546dbf3ef

Observation c1c0e907-6052-4917-9c79-28c69e0b3b96 · outbound

This paper cites Chalopin, V.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Chalopin, V

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.913018Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.719626Z digest=sha256:6d40b60a7edd8a93becc54d30a90a9053418678903de7795c9114b8d59649054

Observation 58d35bcf-18a3-4205-8d21-a704613e78e5 · outbound

This paper cites Chalopin, V.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Chalopin, V

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.903623Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.814152Z digest=sha256:33020ff6c69f4d397c59cb6f262edea0fcda9decb41dbd3a3c8aa2e14df407b3

Observation 2a345a82-a91c-4cff-8393-a6eed5985aad · outbound

This paper cites Chalopin, V.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Chalopin, V

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.894041Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.887445Z digest=sha256:d5bbb9b058e4c8904ec2b9b6aa4a234fb07b444290449c9edcde7a5f9d94f8ad

Observation ff6965bf-771e-4851-823f-cebce4253d92 · outbound

This paper cites Changat, H.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Changat, H

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.885160Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.995267Z digest=sha256:b7ec4010e940911fc1ec4196860fd360326822981da684d11b7da7a4926f6519

Observation 3f325769-68db-4791-bf57-4fa1869aee7d · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 19

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:54.875972Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:44.081482Z digest=sha256:5f114030265d043c130bd1ad09573f4e9589088bfaeceb30c116131086c5a384

Observation faa91f26-8ee3-4994-9165-f27a026b2899 · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 20

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:54.867469Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:44.176724Z digest=sha256:aee34b7a73a12bd2f6e0b9c10884b7bc65ba622cd444fd33ee8ca7ee8dea12d5

Observation e1a5d575-323d-4bb0-9e27-1c4c89ee3b15 · outbound

This paper cites Separation axiom $S_3$ for geodesic convexity in graphs.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Separation axiom $S_3$ for geodesic convexity in graphs

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-06T22:01:44.291719Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T22:01:44.291719Z digest=sha256:ee60a9702fb6eae44b768382ef92a4bcee554a248fb4b950d1cce39395787ab0

Observation 951910b0-83ed-4c34-9990-721e3a37f86c · outbound

This paper cites Chepoi, B.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Chepoi, B

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.858724Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:44.383438Z digest=sha256:fcd18ad7e96a8dc4c86e84c00092b22ca7dd9b27e5c0dab3b76b8cbabefc405a

Observation ef74e05c-b73b-4e80-84f5-2d946b45e4f9 · outbound

This paper cites Chepoi, K.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Chepoi, K

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.849153Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:44.504811Z digest=sha256:5008777a1ee46e208e56d465a0d25e78a431c8e8da396ac50f36a390dff2e54b

Observation 4b90bf56-e77f-4ae4-ae5f-0bc64dca4cda · outbound

This paper cites Coudert, M.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Coudert, M

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.840096Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:44.595265Z digest=sha256:7f0e82bf0e1186a4cb72ae9ba6bd98771dc849e781b3c2e08553d3ecf8209d97

Observation ccf6dcd7-3fc2-415c-8df4-9280744a6b8b · outbound

This paper cites Darnst \"a dt.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Darnst \"a dt

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.829915Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:44.678877Z digest=sha256:e7d6873f7d09bd31586ef3974b2b79e56fea02806258efc634a8c352cb25be2e

Observation 3df0a472-a029-49c3-8478-98ffce3856b4 · outbound

This paper cites Dasarathy, R.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Dasarathy, R

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.820860Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:44.770822Z digest=sha256:d3fef2b038ad0642866b9678c4b5fde709c5c27c0a887eaad164c4c7d4e2b1a3

Observation a16aeee7-5776-4551-8665-f2735301f812 · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 27

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:54.812055Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:44.858995Z digest=sha256:1d2bffdb428fc61ed22fce6aba8caf732341e675bf8c9efedc036c2542681e48

Observation d70ea87b-2271-44f5-b31a-9bd97dc4087b · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 28

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:54.802976Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:44.948614Z digest=sha256:9c658c5f9e7f1ea792ce82400151827fb917604f7879bac54cc0944649e7eb44

Observation 45af5597-1c07-4065-8ac0-48e3d22ce090 · outbound

This paper cites Duchet and H.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Duchet and H

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.793826Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:45.023940Z digest=sha256:fac893b40eb99336426b5c6c2954a14b25970d4e979c336fc75e400fc86e8554

Observation 885982a6-a68a-4b41-a134-7eeaaac8991d · outbound

This paper cites A general lower bound on the number of examples needed for learning.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs A general lower bound on the number of examples needed for learning

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.784742Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:45.109450Z digest=sha256:ddf90ead8a0df1d0853fa132bb981126dc7b76c0ca9e574cee30b13b22812197

Observation 0a4a446b-b719-47f2-9d6d-e1dfa3a0292f · outbound

This paper cites Elaroussi, L.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Elaroussi, L

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.775291Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:45.194333Z digest=sha256:541239a0e737db8ca9a9abb27b3b521661d4f6f5ececfb8bc9b09cbe4198e18b

Observation 5717c5d9-ea17-4126-9553-2dd98b463612 · outbound

This paper cites Farber and R.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Farber and R

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.766874Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:45.271552Z digest=sha256:f4e7215ed996021aeb34ec423434e9ad5cd111d038c76c5add5f6cc3e476ee62

Observation 29b1ca7c-973d-4b94-85bb-51f44c00e905 · outbound

This paper cites Stable networks and product graphs.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Stable networks and product graphs

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.758140Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:45.355480Z digest=sha256:d8f08d0f9c4aab56fd60a14dd3793678a96aa59513d535ce680b13ae1435d321

Observation ffb912e0-2a00-43ac-8783-5f8ded96527a · outbound

This paper cites Floyd and M.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Floyd and M

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.748457Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:45.426365Z digest=sha256:4139b4ecdf8c7a2dcf785437be10706a24428d37a2f511aafa37a83439d90948

Observation 3e47fad4-8bee-470e-9777-13b59c86033a · outbound

This paper cites Gentile, M.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Gentile, M

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.738568Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:45.509644Z digest=sha256:bdcfde87e95b3f5f84f2bb2bd23f25d775728da1f3b238fc614eb02e0f6eb01e

Observation f224466e-920f-4e5a-87ec-674b1d9aa373 · outbound

This paper cites Glantz and H.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Glantz and H

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:54.729404Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:45.609866Z digest=sha256:bb519b872d6ae8a75ecd5ae9999d7d2dcdd00d7b82ddcd88c46f4f970f8d58b4

Observation 79b91660-a495-41f2-89d7-4af43dadde7c · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 37

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:54.686164Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:45.689339Z digest=sha256:de3e7ffe1d2addb6774aafc8f611a0f1c12f22d3559df2fb6fdab5f927ea0625

Observation 17b6e729-9838-4182-8b66-e1365847a654 · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 38

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:54.289414Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:45.737467Z digest=sha256:75ff4de9f9664fa55c06ecc3087fbb9e2c4a248c40e8947972e06d2de7c7f81f

Observation 0a72baf7-50b5-4cb1-bd5f-fe5df31df186 · outbound

This paper cites Guillory and J.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Guillory and J

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:53.926251Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:45.836516Z digest=sha256:d43a4d67533dffe76268de69bf4e0537cab0fe0ee1e3a76944fef3c94604bec8

Observation 82d84eea-2ed0-47f3-80d8-16cec4d85aca · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 40

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:53.635266Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:45.952955Z digest=sha256:fe9641736ef779ce41cc92397b822dcc44d83ebf125dd7f5cda3910ef9f0cc91

Observation 608c81bd-c51c-4785-841d-503425cfe6aa · outbound

This paper cites Heged u s.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Heged u s

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:53.463174Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.035070Z digest=sha256:7597ea61703eaf71ee279937c3ff87a57518df372cb0fa0841256d0acb8de0e0

Observation 2aee94cc-76eb-4b6b-b113-839016ef9e45 · outbound

This paper cites Herbster, M.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Herbster, M

Reference 42

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:53.323565Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.156468Z digest=sha256:1f101c2ebe83a099d3bad5b407e1d0bc945e56fa3a1b3d04cb06bf3a32e2eb5d

Observation 3f3d14a7-d1e5-42f8-ad7f-5d1ece57c7bd · outbound

This paper cites Herbster, S.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Herbster, S

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:53.192852Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.225634Z digest=sha256:e21d45d5e2c94c5252a3cb9044375a018fb7e011a7fb5a7a03e8ba107713aebd

Observation 2eab41a2-0c6c-4740-8080-531bbd5f34ec · outbound

This paper cites Kleinberg.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Kleinberg

Reference 44

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:53.075561Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.300058Z digest=sha256:58e2ca29b0942b94d0b782e0532b47410720bd6a78807fd99e2f6709f15bb024

Observation 919756b6-a327-42fe-b1e9-186a3d2afe1e · outbound

This paper cites Kuzmin and M.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Kuzmin and M

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:52.901857Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.349429Z digest=sha256:3135b4aaa4feb021218a31d7cfc8bee5af12cbf5de53a6d44a0b9d2dc2a67e95

Observation 384a48d8-87c8-415f-8b0c-c09369c2cb6e · outbound

This paper cites Le and C.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Le and C

Reference 46

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:52.720143Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.423338Z digest=sha256:159d40738137f01874ba2257def57edf53afc99bf29bba1625521fc74dfc5d48

Observation b2d69842-20fa-4991-b5c6-1ce7b5e79f77 · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 47

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:52.595276Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.491963Z digest=sha256:99527db326e8b7415272e622f342798cae9f1e17aae0f27531c026f54282a36b

Observation 8d5923ae-9b7c-48af-b734-918683fa1fe7 · outbound

This paper cites Littlestone.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Littlestone

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:52.435596Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.572748Z digest=sha256:9f9806b7f268c37f2159ebef172f506113f6322c69220191d357443b4ffc3cf0

Observation 63db6ab9-1f6c-45eb-b155-cfab8351fe35 · outbound

This paper cites Littlestone and M.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Littlestone and M

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:52.313693Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.674963Z digest=sha256:a2a3f4d8f0dbe555ba3a23fea501b2785a9a9229c1cd616703e42eb4f8ada054

Observation 7e12af1d-0a2d-44c1-9710-054d3a1bbe4a · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 50

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:52.169547Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.678509Z digest=sha256:ccb53831250dec2433a39e4d01c1db8049defc72e50fa390040e91bac2ee47cb

Observation 95982f81-68d9-4088-ab40-bc19231be37b · outbound

This paper cites Minsky and S.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Minsky and S

Reference 51

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:52.040336Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.714366Z digest=sha256:5e307aa1a768ce5c159f05c4bbdee8e065e8af59dc3e00648466e40977e83011

Observation ce6f9b2e-63fb-463e-98c3-b41ac708a614 · outbound

This paper cites Moran and M.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Moran and M

Reference 52

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:51.859893Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.779427Z digest=sha256:f767d2261713256bb29bd1b21bcf4ed6fc19c6866e2ffdfa0bca50201b7be6e6

Observation 201609e8-bec5-428c-a794-822c32d2bbf5 · outbound

This paper cites Moran and A.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Moran and A

Reference 53

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:51.733292Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.898326Z digest=sha256:ffa4ea5b342deed2f423e56d992c6d6c7760084e433b6e6a3c4334a1acc43019

Observation 7c5ee1c5-bf3b-4f01-9801-56044c4b4aa0 · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 54

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:51.605542Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.996316Z digest=sha256:6c9057b8a28366e7b44b91ad1be29d008bd208e86bb80b59f548bd3b424fad07

Observation 1857312e-1c50-49c4-96ec-6c0cfcf04d2d · outbound

This paper cites Pelckmans, J.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Pelckmans, J

Reference 55

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:51.487176Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:47.095879Z digest=sha256:6a24f691ca9ad0a7fceae122ab5f1fcfc509e6ab9f12f649258c0156789bec54

Observation 1cef50c4-4bda-4ab7-96da-4ee069efb7ec · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 56

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:51.333861Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:47.175875Z digest=sha256:008f49b16efb8ac692728fce9ea301b88a87698431f77823699bfb194a9b2268

Observation 306c6164-e54d-4a6e-bcce-04d3ea13e15c · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 57

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:51.164720Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:47.267589Z digest=sha256:7f2caa22bea295c716e4958db9a4f7ce30f84b8938d8bfee1483acbee3ed6007

Observation 06973b3b-16bc-418b-90ce-ab93ce8cb069 · outbound

This paper cites Seiffarth, T.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Seiffarth, T

Reference 58

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:50.885737Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:47.344131Z digest=sha256:6e601abd4a2718fbea2dd95cbca1f97599db3bfbfa064ac61c0140826262db6d

Observation 633a3a8a-b1c0-4acd-b754-3822342bfc72 · outbound

This paper cites Shalev-Shwartz and S.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Shalev-Shwartz and S

Reference 59

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:50.673569Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:47.427144Z digest=sha256:bdaacc1df5cf07de05a322074698c01d96e1ae82f353f2af132254666e44901d

Observation e4a35d72-1399-4737-ab4a-c72cbe1bb44f · outbound

This paper cites LLM-Powered Decentralized Generative Agents with Adaptive Hierarchical Knowledge Graph for Cooperative Planning.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs LLM-Powered Decentralized Generative Agents with Adaptive Hierarchical Knowledge Graph for Cooperative Planning

Reference 60

Resolution
unresolved
no resolver link, observed 2026-08-06T22:01:47.518001Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T22:01:47.518001Z digest=sha256:420587aefae044b1f855130f7b6765bf1135d245badb9757474e1a139e3605bf

Observation b9e4d04c-83c8-4af5-8be7-100ab94296a4 · outbound

This paper cites Simon and S.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Simon and S

Reference 61

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:50.494221Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:47.613073Z digest=sha256:b11b92b93eaf88a451f801255af8cb69ebaeb5da74ff5fdb292ce9c00f125ebd

Observation 2227f527-f06c-4722-a77c-d9a9fd628249 · outbound

This paper cites Self-directed node classification on graphs.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Self-directed node classification on graphs

Reference 62

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:50.336791Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:47.692108Z digest=sha256:1f61519d63b7919ea79a6ab18bd796a5f86f7b3e95574ea9634b4e260d0a787e

Observation 3b350c36-0e77-479d-b4b8-9ddb51b1a008 · outbound

This paper cites S ubelj, D.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs S ubelj, D

Reference 63

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:50.190309Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:47.771085Z digest=sha256:9a4793e8a4ccf33187611853a416c722b25a2d42c2cd29d37c417e4ff1a7aeb7

Observation 09dd5065-cf7e-4964-b9a9-20f475dacecd · outbound

This paper cites Talagrand.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Talagrand

Reference 64

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:49.984208Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:47.845186Z digest=sha256:99c0a7b442a947aeeeac8b0ce08b5f5268d1f823691835586d7ed3fa3d6ac341

Observation 7cd4877d-5c41-4501-a4ef-4bf41a384cf2 · outbound

This paper cites Thiessen and T.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Thiessen and T

Reference 65

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:49.812227Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:47.929185Z digest=sha256:6c9189d53b472480534578dc7fa0114693a0b1df8de82228155a24e50c144163

Observation aa90d751-54d0-42b3-b34b-2c80593663be · outbound

This paper cites Thiessen and T.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Thiessen and T

Reference 66

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:49.647351Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:48.009165Z digest=sha256:8f05f841efd0f00484ba95ff60562a21445b6bac48618ea2f48b2d04755a7c0b

Observation 62ca66f1-d2d8-4a65-82be-358f8d5113aa · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 67

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:49.464682Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:48.111740Z digest=sha256:fc150a28b50a80589e398ff22df8c832e23a7a4add23acd694cf4d98cb6c414b

Observation a607a377-9ef1-4139-b842-b2bf1938e4e6 · outbound

This paper cites an unresolved cited work.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Unresolved cited work

Reference 68

Resolution
unresolved
raw_fallback, observed 2026-08-06T22:01:49.254972Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:48.203286Z digest=sha256:4adaeb05530c636f234cdbf5d3a948d0ccf87670cd7c03b46aed44025a425b09

Observation b1775841-39ee-486b-939e-ecc56bb40cf7 · outbound

This paper cites Vapnik and A.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Vapnik and A

Reference 69

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:49.100239Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:48.338899Z digest=sha256:8149b99cdf2ddca6bdc35cee05d2b2dd9bef4b10f22d3816f55ecd0668116152

Observation a0281b5d-ea16-4817-bf09-bc70c4449e54 · outbound

This paper cites Zhou, M.-C.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Zhou, M.-C

Reference 70

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:48.914929Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:48.427569Z digest=sha256:37a7ad20b93a3284e2024a1fccfb7a1ffef460711fb82959742c7cb418294d8a

Observation 4a9f35cc-38a1-4cfe-8d15-c6dd078b8058 · outbound

This paper cites Zilles, S.

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Zilles, S

Reference 71

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T22:01:48.732291Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-06T22:01:48.528382Z digest=sha256:ee2adcaa0b27de49db78d4777278e15d611fc21462caf2a83f3cf0720bfb25dc

Pith citing papers

Observation 634ba2f1-df7e-411c-93f1-e0f4aaec6ae7 · inbound

Halfspace separation in geodesic convexity cites this paper.

Halfspace separation in geodesic convexity Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs

Reference 9

Resolution
verified exact
arxiv_id, observed 2026-05-10T07:47:12.242305Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-05-10T07:46:13.522793Z digest=sha256:dddf41ef7fc9caa3bcb4cca9219847015485043d5e6bff35b49ac2085de6b2f3