Pith. sign in

Paper Citation Record · LEDGER

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms

As of 10 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2601.22943.

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

pith.paper-citation-record.v1
2601.22943 v2

Coverage vector

measured 50 of 50 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T06:35:50.617733Z

measured 50 of 50 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

50 of 50 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved50
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 964cbf87-fc0e-4d72-a7fc-1acc93f2bea0 · outbound

This paper cites write newline.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms write newline

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:47.385778Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:47.385778Z digest=sha256:dcdadfaeefc35294e65f245761b43d2a61f6e8ef4546118690bbf7ba0d743161

Observation fed51704-fe75-4d34-bda6-50f38d24a554 · outbound

This paper cites and Periwal, V.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms and Periwal, V

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:47.429211Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:47.429211Z digest=sha256:416c91c28a943da38905635d0a42fd64780dc79a11d04df18401e9e65b0f6eac

Observation 24d4bef2-8f4e-4133-85da-cc74ba07f137 · outbound

This paper cites an unresolved cited work.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Unresolved cited work

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:47.523373Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:47.523373Z digest=sha256:4789fcd6c0439f93e5f6e7c95d748d528a37e9e1abbd2fc647763cf728fffb9a

Observation 60c86eb1-01f3-47e8-9c51-8d17eaa9efeb · outbound

This paper cites and Pritam, S.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms and Pritam, S

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:47.590934Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:47.590934Z digest=sha256:9f8b11f9643e3bc633b2d91d7e5f493a7dd3282495f6316639dbca40e3d5c5f3

Observation 53861f43-89eb-4fca-9d74-66c1a072916a · outbound

This paper cites and Pritam, S.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms and Pritam, S

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:47.643516Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:47.643516Z digest=sha256:3721754ba9b9cef02203509f59dcff0de5742702075236a8148f2f9a988efe78

Observation e294732a-0497-4d00-98a4-0f90d11b3594 · outbound

This paper cites Positional dominance: Concepts and algorithms.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Positional dominance: Concepts and algorithms

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:47.710355Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:47.710355Z digest=sha256:61dc12368caffcca0823b36f14a57b4de9bffd31c5d05d1b5f0575e144aa3a0c

Observation 793159d9-087a-47ab-88b6-6b8228b05760 · outbound

This paper cites and Gunderson, L.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms and Gunderson, L

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:47.765475Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:47.765475Z digest=sha256:aba3edf200bbfa762a08948055d50d5d8792649cd5d8b6838b70d269436f6261

Observation 35ff1bb8-3e0a-4117-9471-cbb7592b53e2 · outbound

This paper cites Graph Coarsening with Neural Networks.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Graph Coarsening with Neural Networks

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:47.786968Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:47.786968Z digest=sha256:9a3ebe49d7f468ec9bae097ce9da9ebf63d4647440f10edc135d5713805bc83d

Observation afaf1317-8947-40e4-b9ef-0850f9abdfa5 · outbound

This paper cites Computing a near-maximum independent set in linear time by reducing-peeling.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Computing a near-maximum independent set in linear time by reducing-peeling

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:47.852212Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:47.852212Z digest=sha256:bfbd7a4c6a5e7df33b760003214322e5531f004530f4361183311ef8b784bd68

Observation 3d949c40-af7b-4ffe-8c90-fa29286da45d · outbound

This paper cites and Safro, I.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms and Safro, I

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:47.905480Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:47.905480Z digest=sha256:d4e168b88d64a71402e60ee23765854c6989c018c14eafa5a91269e224963ba1

Observation 5bd20fee-eab6-4716-8bdf-c18a73485790 · outbound

This paper cites A unified lottery ticket hypothesis for graph neural networks.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms A unified lottery ticket hypothesis for graph neural networks

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:48.005011Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:48.005011Z digest=sha256:98ae653e2a94d7ff891064f88376e82cf785881c64eeedb9c53c5f2ce3e4ea52

Observation 076c63d3-73ab-4282-a643-655852f0ed13 · outbound

This paper cites Topological relational learning on graphs.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Topological relational learning on graphs

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:48.102344Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:48.102344Z digest=sha256:615ed6688c65e7287594e97660d511b47b87ed65f5f10d0029e520e203f3701f

Observation 1a2d1b77-a6a0-4234-a7f5-a90f8449472a · outbound

This paper cites an unresolved cited work.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Unresolved cited work

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:48.173244Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:48.173244Z digest=sha256:31843d759596b8d0200e4ea2f063432f15c31c7fa922117da567d76bab697fe7

Observation d20b9d9b-9d7a-4d1e-8321-52c928b676d4 · outbound

This paper cites Graph coarsening via convolution matching for scalable graph neural network training.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Graph coarsening via convolution matching for scalable graph neural network training

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:48.219941Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:48.219941Z digest=sha256:f909955be35be677f564a7798e7511f8bf46b019e27cba8f602791df4517027f

Observation 85a4f94d-95a9-4108-843a-c0adc75c35a2 · outbound

This paper cites and Gonzalez, T.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms and Gonzalez, T

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:48.267356Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:48.267356Z digest=sha256:b7ae65b67a49e9e96546ef5635d65966a223001a8f1d4d3244a9e4f1811798ba

Observation ec8b8f79-453d-4d4f-9340-f9f6f017c795 · outbound

This paper cites and Steenrod, N.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms and Steenrod, N

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:48.331068Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:48.331068Z digest=sha256:915801f23591d0297b98f3d2292060d82106de5984d7de24d9f57d6231f3197d

Observation cfb839b2-5717-4fd9-96cb-0d1c31b8ebda · outbound

This paper cites Exgc: Bridging efficiency and explainability in graph condensation.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Exgc: Bridging efficiency and explainability in graph condensation

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:48.378275Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:48.378275Z digest=sha256:9e7dbc083e3500693902a3b0138d0625e3cd1a73eb4ce151f72c5997ccae587e

Observation 22dad4fc-b8f3-49c6-9055-3260b885d8fb · outbound

This paper cites Efficient computation of the characteristic polynomial of a threshold graph.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Efficient computation of the characteristic polynomial of a threshold graph

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:48.491493Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:48.491493Z digest=sha256:013fcf61b56205d86e113e748ed3d5864eda47e5bdc58d0a54e7bc8bbd08fa3f

Observation ed2ee696-4dcd-4ae4-9793-8cafd680d19a · outbound

This paper cites Predict then Propagate: Graph Neural Networks meet Personalized PageRank.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Predict then Propagate: Graph Neural Networks meet Personalized PageRank

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:48.545179Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:48.545179Z digest=sha256:902f5066d61b75e3a166886ef6ef731b445704e741e91ea1157627187edcb0ab

Observation da2ae94c-6f9f-441e-b9ed-bb22dfad7487 · outbound

This paper cites Inductive representation learning on large graphs.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Inductive representation learning on large graphs

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:48.611389Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:48.611389Z digest=sha256:2d7be774066ae53c2241410838a9feeb4646ceb6d61fb774e47ed9d4d65ef74c

Observation 0f8ae941-d899-49ae-b0cb-a9b17ce4b225 · outbound

This paper cites A topology-aware graph coarsening framework for continual graph learning.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms A topology-aware graph coarsening framework for continual graph learning

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:48.706993Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:48.706993Z digest=sha256:6f13e776b352bb1e7d80759746006b80a7d33dd8f816305e6f8f6ede7024f278

Observation 583839fb-da29-4135-b3bb-68865bbe6280 · outbound

This paper cites Topological node2vec: Enhanced graph embedding via persistent homology.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Topological node2vec: Enhanced graph embedding via persistent homology

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:48.774496Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:48.774496Z digest=sha256:7bd83a09769d862303cfa704a7ecfab1e74dc92c2e88a9cd2540c0283fc93920

Observation 95359c16-1920-420c-bc14-b7c5d5dbeebf · outbound

This paper cites Topological graph neural networks.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Topological graph neural networks

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:48.817965Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:48.817965Z digest=sha256:157d6928ea3dd4b3b26018f5257199bdca907c6ff17d5bdeb1168957ecd3cf94

Observation 3ac0b2b9-83c1-4f76-afe6-2260bbc1b0b4 · outbound

This paper cites Scaling up graph neural networks via graph coarsening.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Scaling up graph neural networks via graph coarsening

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:48.890314Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:48.890314Z digest=sha256:3927e0cc03a882ba2302809c3804bc35b6ab474655da427dda6bd61031100ce4

Observation b7f90929-e9e4-4ce6-ae41-37f9089d0712 · outbound

This paper cites Rethinking Graph Lottery Tickets: Graph Sparsity Matters.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Rethinking Graph Lottery Tickets: Graph Sparsity Matters

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:48.942355Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:48.942355Z digest=sha256:7a5ea519f32572cf25955452ba8b6d4d80ccd01d0ed399ad90d406110eb6a01b

Observation 8dda3b3c-fcdd-4ea8-b3bc-ae16561b543f · outbound

This paper cites Going beyond persistent homology using persistent homology.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Going beyond persistent homology using persistent homology

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:49.041272Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:49.041272Z digest=sha256:726ccdfea887afd8f332108f209bd49dbcc4dbdcc2e93969fdbfc46990bcaa3c

Observation f1df1273-4d6d-4a92-b607-3b309e350f38 · outbound

This paper cites Graph Condensation for Graph Neural Networks.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Graph Condensation for Graph Neural Networks

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:49.109883Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:49.109883Z digest=sha256:b321bb49d8b3923e199e62e43e5b493b99c2bad0819655a17a0ab583a2bfc534

Observation 37e051c9-1f03-4557-8985-3bc703d73ed5 · outbound

This paper cites an unresolved cited work.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Unresolved cited work

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:49.192256Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:49.192256Z digest=sha256:230575f25bbe4e5364f6c56ef21954e155b4592c2ced216a381894ec6fcc5b61

Observation 42f057be-5a18-4e17-9e39-6ab5650d618f · outbound

This paper cites Featured graph coarsening with similarity guarantees.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Featured graph coarsening with similarity guarantees

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:49.235823Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:49.235823Z digest=sha256:d9621fe56480c677b9f9266894aa7b2f5e586fcfff348f2230e2e2093738b240

Observation efc24aa5-a8dc-4dfe-85b7-c6c07a31c7e6 · outbound

This paper cites and Terzi, E.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms and Terzi, E

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:49.312493Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:49.312493Z digest=sha256:6369ea612cdbebff3a77da4eb947b4ee0db5417c89586190f6ea9e1a24f6761c

Observation fda0b27d-fc8b-46cf-baa4-a5cdd36743ad · outbound

This paper cites Scaling distance labeling on small-world networks.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Scaling distance labeling on small-world networks

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:49.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:49.385080Z digest=sha256:614fc1556bd639bfbb455f15796e5ffd8be13a1176db804d5a0c28b3cae91273

Observation e9335e0b-8baf-436d-b04d-385a4ff7d082 · outbound

This paper cites Graph reduction with spectral and cut guarantees.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Graph reduction with spectral and cut guarantees

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:49.452256Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:49.452256Z digest=sha256:9ee9288c35654db887511ec56ec5def218e0720486e357afd68642f41851ded4

Observation c02a7e29-ce53-47bc-87a6-0eee04dacae7 · outbound

This paper cites and Vandergheynst, P.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms and Vandergheynst, P

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:49.521596Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:49.521596Z digest=sha256:0bb5ecdb706a4f46c27b4b290ac5a9ebf42c6fa3caf2d23ac9f1bc52871100d9

Observation 26dc19b5-ee9a-4250-9290-161ae7859daf · outbound

This paper cites Improving graph neural networks with structural adaptive receptive fields.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Improving graph neural networks with structural adaptive receptive fields

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:49.562755Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:49.562755Z digest=sha256:f0b575d47a6cca793abb29dac939ffecd6ad4afe32b73e1fce1efaf99d0f1684

Observation af70be7c-ab08-42a9-ba4d-c7a3e8aabead · outbound

This paper cites an unresolved cited work.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Unresolved cited work

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:49.633330Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:49.633330Z digest=sha256:d84c4e5739262331d5d25df98ce0bd311188f2b2d385ad3b01ab585a08b624ee

Observation 3c43c8b3-87cd-4372-95c0-aac5f926f235 · outbound

This paper cites Topology-preserving graph coarsening: An elementary collapse-based approach.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Topology-preserving graph coarsening: An elementary collapse-based approach

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:49.690331Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:49.690331Z digest=sha256:d77bdf129d24aa5851762e01f1f9b8eba8867ee3d289bbd930ec28e187a53e2f

Observation 6867fff3-bd58-4c3e-8ab9-c4b95e2df110 · outbound

This paper cites Encoding group interests with persistent homology for personalized search.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Encoding group interests with persistent homology for personalized search

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:49.732150Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:49.732150Z digest=sha256:253f5e49c8bcb72ae2448761a411de526cd9e4c870e3bc94cf8805d231a171dc

Observation 63a58303-2e71-4118-8eb9-ed8f3893e695 · outbound

This paper cites an unresolved cited work.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Unresolved cited work

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:49.800562Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:49.800562Z digest=sha256:9e1cd6fc7179a697028b3fe2adc72bd43018717bd0efd444bc5901686c070dc7

Observation e88d0983-92f5-4035-a36c-25ee71d13e0b · outbound

This paper cites Topological machine learning for low data medical imaging.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Topological machine learning for low data medical imaging

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:49.846102Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:49.846102Z digest=sha256:f1bbd59ea8ff76f09ac609f847be9cc4b514f8091e75c68270cb6fa8d5a9b6a7

Observation 50c7cdca-05d1-4e0c-b477-6b02a3b1770c · outbound

This paper cites Maximizing the reduction ability for near-maximum independent set computation.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Maximizing the reduction ability for near-maximum independent set computation

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:49.919540Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:49.919540Z digest=sha256:86980969ee71cc06082eff7c24e3c8c33d16d0241cf1ecc7b5232a2fedb780ed

Observation d116f516-13c0-4d57-821e-5443b33c095a · outbound

This paper cites A., Kang, C., Zhang, Y., and Subrahmanian, V.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms A., Kang, C., Zhang, Y., and Subrahmanian, V

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:50.003894Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:50.003894Z digest=sha256:9cb5889527f6e53933245574b4ce1c4483425506224de1d2ceedf80c6158b8f7

Observation cbc9d8c3-b04e-421c-a842-3117a043c5e8 · outbound

This paper cites P., Hymel, J.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms P., Hymel, J

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:50.069902Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:50.069902Z digest=sha256:f44fd7bfd546e760bd99d30b420056e4a2d79864a628f68fba4ac8cd24ed9f6d

Observation f5747aa4-8e5a-4b05-ac69-313477d3a897 · outbound

This paper cites an unresolved cited work.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Unresolved cited work

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:50.137800Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:50.137800Z digest=sha256:d4daa1b5b1c6cd8c03236065b4bc6c5b5573e9f3ca7cecf16e3369735b291ab2

Observation 00063216-d326-44da-af82-b6374761c6e7 · outbound

This paper cites Link prediction with persistent homology: An interactive view.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Link prediction with persistent homology: An interactive view

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:50.193519Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:50.193519Z digest=sha256:cd46ed98ff4281aa640a32f0a95b863de0c26785cf7faac6668d14f9f3a58344

Observation 777b02fb-198c-4415-a50e-5578c367416c · outbound

This paper cites Cycle representation learning for inductive relation prediction.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Cycle representation learning for inductive relation prediction

Reference 45

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:50.243832Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:50.243832Z digest=sha256:6b66b1697adfef0d5073062132679f5716e4fa4d6cce594caea2f34d8c533ae1

Observation fbeb0782-2e8b-42d6-898d-c18599387145 · outbound

This paper cites Neural approximation of graph topological features.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Neural approximation of graph topological features

Reference 46

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:50.299123Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:50.299123Z digest=sha256:9592e7824d904679170f149b242db74d040e51f74c58a752213b321991c9f414

Observation ba41e4ed-ebe6-47bb-9e2e-fc58b8bd6f39 · outbound

This paper cites Cycle invariant positional encoding for graph representation learning.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Cycle invariant positional encoding for graph representation learning

Reference 47

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:50.337163Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:50.337163Z digest=sha256:aacd2245dd214f5445716070ca360cecd9fbb715f25af8d51c6c11f92299e272

Observation 8f8923ba-ac78-405f-98c8-d42fe56e1101 · outbound

This paper cites Graphsaint: Graph sampling based inductive learning method.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Graphsaint: Graph sampling based inductive learning method

Reference 48

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:50.434773Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:50.434773Z digest=sha256:d18ff3b7d3dc6f855cd1f30a5c4884cdf94f9fadab533a0be7b3951540695f5b

Observation 2b628907-18f4-47e1-97a1-b176016d8cdf · outbound

This paper cites Neighborhood skyline on graphs: Concepts, algorithms and applications.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Neighborhood skyline on graphs: Concepts, algorithms and applications

Reference 49

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:50.504911Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:50.504911Z digest=sha256:b98264f48f4789fcc92584dabac6e0cd0be9f17330621e2a012c97ddc1b22773

Observation 441795e6-617d-47d8-a85d-020696198f3c · outbound

This paper cites Gnn: incorporating ring priors into molecular modeling.

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms Gnn: incorporating ring priors into molecular modeling

Reference 50

Resolution
unresolved
no resolver link, observed 2026-08-03T06:35:50.617733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T06:35:50.617733Z digest=sha256:220fed28bf127cc7f0c1089fa6f090c6e1c6aa46f7efb018bfa6b66f1f5ff7c8

Pith citing papers

No inbound Pith citation observations are available.