Pith. sign in

Paper Citation Record · LEDGER

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs

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

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-09T06:31:02.800959+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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.302667Z digest=sha256:376c223c6bcc8d920ae694540ca9768e4adcf3aa6b3d5221a64b9bec1b52a32b

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.358320Z digest=sha256:8be7bf5d3d34462bc301583e1c9f8bae4d577f3b96e2c2509b5444c685f61495

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.446545Z digest=sha256:74985be2c9e0f80edba2962e204b6a37c53d163f8f9732dd2bf3c2bcbb551b0c

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:43.814152Z digest=sha256:168970f72f1ce193074b05cd81e0c55b8c0bd6d45a975bcc7b85c5211d8213f8

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:44.081482Z digest=sha256:3bb63eeebb4228c6fc2dbba0f90517779ec3f97e191134458fbc5a23dc12d80d

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-09T06:31:02.800959+00:00.

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

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:2e928880ce21a3806626d4d83af4d6b2280fe65e4d7e0c7c41f524d797c064b9

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:44.858995Z digest=sha256:8f2cfd7737e03fbd7175d073d6a93fdef0e8a7595fdd40786792d4db15a2ebe3

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:45.737467Z digest=sha256:281454478ba882aa4139c2ac2ab25336ad15f521722d3b2dacf282a65b9674d2

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.035070Z digest=sha256:0db8c666ae1d565be7c947c1f67839f1cbd0319699fadb640e9fc13dd35e1420

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.156468Z digest=sha256:2825754f5ca1e9d08b947ec0ab177824440c2d916e5b0e410ca86666795d2cae

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.300058Z digest=sha256:9439d1895d0286acbc4a4f8d68d463cf6c13982ea693b16ecc098c69ba1bdf72

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.349429Z digest=sha256:7b5ad6847378ee350e91b850c5057a5601542d9492069672d4704b4c9d6632d8

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.491963Z digest=sha256:0fc858d951e79e1235d7eadfb3a504d5851f8eac407761c6677df71426b12730

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:46.714366Z digest=sha256:0bd687cbc1ede4c59836b48cdeed7b3d581af61338194b3c391c9d8c6a081d0d

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:47.267589Z digest=sha256:27531006410f674f6da725bf6cd8669f5305a0e2a58ff39c806fcf12ea4872fb

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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:38b27bbac9117fd0004894a78303af2df10e003d1451c52a29c2cdedfce7d7cf

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:47.692108Z digest=sha256:858480fcf5427673e9999a92ecc64fdf43df5c5f8ad1827d44ac35acc495f196

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:47.771085Z digest=sha256:7901cdbfd315fb2cf13d7a427437fa3fc5a6e2456e78f03994dee953265f5c0f

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:47.845186Z digest=sha256:8fe01eaa7acaf9465eed9321e046028df5438820751e8670502d761a5803d22c

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:48.203286Z digest=sha256:34bc7911081d9ed543fbdd376fda1c4667e7888ba66cf93a22975986aeee5b15

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:48.338899Z digest=sha256:67ffbea64d75ccc65874b97b906b843078a054f7952c2a22da5fea00b48c9e2d

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T22:01:48.427569Z digest=sha256:0354129b2d1365a8949e2490917366b9a1e354fcdaeb481516120fa1e39f8e0d

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-09T06:31:02.800959+00:00.

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

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-09T06:31:02.800959+00:00.

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