{"as_of":"2026-08-08T08:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7349c1549314f9538b6f84f0a98d5b21e9de9fb9205bb8217c1334c093f8dca7","coverage":[{"denominator":64,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":64,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:44:14.724894Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.01826/citation-record","integrity":"/paper/2506.01826/integrity","json":"/paper/2506.01826/citation-record.json","paper":"/paper/2506.01826"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.826618Z","title":"The emerging field of signal processing on graphs: Extending high- dimensional data analysis to networks and other irregular domains,","venue":null,"work_id":"411e3f0e-73cb-497e-a852-0e781e3554ae","year":2013},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.287646Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:dd95e9aaf3f23ea7571b762d1be49d152994f5b044ea4f8ed3423847745f924b","observation_id":"1e236dc3-cc14-4a17-b12d-7d90e6bf816e","resolution":{"observed_at":"2026-08-07T11:44:17.833575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.809969Z","title":"Graph Signal Processing: Overview, Challenges, and Applications,","venue":null,"work_id":"221f60d4-1c90-4ef7-abc5-9777e820ca26","year":2018},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.304806Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:cb1c11f479ba51294fd51e70d49fa574e773de1c7a15baae92c4a37634e675fe","observation_id":"65cc0d6a-9742-494c-9748-eb5c04a42be5","resolution":{"observed_at":"2026-08-07T11:44:17.814978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.792275Z","title":"Sampling Signals on Graphs: From Theory to Applications,","venue":null,"work_id":"4e8ebd99-8ca7-475e-9988-e5e6841997b3","year":2020},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.326571Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:954345a2ff25dd44a93c56122a720c7058a3e6a8c43955d0415fe4df2c9179eb","observation_id":"ae00e582-f289-40fe-bec9-4f4c87c829b1","resolution":{"observed_at":"2026-08-07T11:44:17.797925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.775515Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":"5e7bdaf3-f609-47f9-8116-41dc5445833d","year":2017},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.357150Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:b345653867c80db516c125c814907250943794c831ade615043a40637b0d34cc","observation_id":"a52219b2-8492-434a-a418-650e7bcbedbd","resolution":{"observed_at":"2026-08-07T11:44:17.780928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.758199Z","title":"Sparse inverse covariance estimation with the graphical lasso,","venue":null,"work_id":"d3ba1a89-4b47-494a-9b82-9c896b57b7ee","year":2008},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.385826Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:f36523072763d5ccb8b8c43a62bd3e01b2e405b6228a974e1958e4aec21a99be","observation_id":"7446408e-0f08-4af6-817a-b4500c83037c","resolution":{"observed_at":"2026-08-07T11:44:17.764426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.741364Z","title":"How to Learn a Graph from Smooth Signals,","venue":null,"work_id":"fc69e9a6-9bf2-4565-82d0-81d169cce93a","year":2016},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.398869Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:7e674575ba9c3a74afa4269ebc56e164f5d69dc9d43a5293be87aec6c51fac5a","observation_id":"9206d96c-cc18-4a95-ab2b-402929e7576b","resolution":{"observed_at":"2026-08-07T11:44:17.747175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.718755Z","title":"Learning heat diffusion graphs,","venue":null,"work_id":"beaf5e40-89df-427a-a7f8-ea3547bc3914","year":2016},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.419102Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:dcf6c9ae14e568cece663b8677fcb16a015cd8670cd1610aac704f5dbfae577e","observation_id":"f41b0e3b-74d3-4799-a32a-967d621d6ad4","resolution":{"observed_at":"2026-08-07T11:44:17.730303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.701697Z","title":"Graph Signal Denoising via Trilateral Filter on Graph Spectral Domain,","venue":null,"work_id":"436d79af-b322-48f2-845e-d4c00faf3154","year":2016},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.434527Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:011ab229e1498dab2b2a31f171a66e7a68953bd1a441c3b4c4e0383dcb104c52","observation_id":"b49ca4fe-8736-4b34-9fa6-bc127d4f3886","resolution":{"observed_at":"2026-08-07T11:44:17.707389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.684387Z","title":"Graph Laplacian regularization for inverse imaging: Analysis in the continuous domain,","venue":null,"work_id":"fa4187a7-b19d-4756-83b4-3f117829e2be","year":2017},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.454746Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:02ee9a68ccd3636a2e4232f25f1e87eb3154c36dad9d419bf72de934ded9e74e","observation_id":"2c9a7b38-b676-45da-9769-1ae90046546c","resolution":{"observed_at":"2026-08-07T11:44:17.690054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.665245Z","title":"Localized spectral graph filter frames: A unifying framework, survey of design considerations, and numerical comparison,","venue":null,"work_id":"6e53ad73-d64b-4b9a-9aff-b23b5b34be30","year":2020},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.475642Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:e86c2c12dedc974018971a0453d9b25da21e5b6ac5a2081c95de473abb8c2dd3","observation_id":"001bf919-354f-44de-a969-edebbc54336f","resolution":{"observed_at":"2026-08-07T11:44:17.671048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.647360Z","title":"Wavelets on graphs via spectral graph theory,","venue":null,"work_id":"9cc8d299-f9e4-420f-acb6-a0fef653469d","year":2011},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.500561Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:002efdf5538fc1e14a37e20f84f302d7be653602f0505ef9658f9f1ccaf33e97","observation_id":"b248a273-ef32-4bee-94d5-4e29caa79823","resolution":{"observed_at":"2026-08-07T11:44:17.653299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.630650Z","title":"Bilateral filter: Graph spectral interpretation and extensions,","venue":null,"work_id":"53a8de77-80a5-47b3-8eaa-b7852c244ba2","year":2013},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.521286Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:6dbef52c1b4ad8598ef15882b19d822f410f490f276e789def67071e71c78012","observation_id":"960a2dc1-e7ca-42aa-bac8-8fa7ff01602a","resolution":{"observed_at":"2026-08-07T11:44:17.636075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.610783Z","title":"Signal recovery on graphs: Variation minimization,","venue":null,"work_id":"2b911293-1f0c-4c30-b140-5d6dd2c3bbeb","year":2015},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.542007Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:e4c28f006ffa7b61a24dd7d5f977081376ac16f0d8389ab8bc6cd98b0ff8580f","observation_id":"91f3faa5-b6a7-45e9-b1be-a5dc0049e796","resolution":{"observed_at":"2026-08-07T11:44:17.618208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.590269Z","title":"Graph-based joint dequantization and contrast enhancement of poorly lit jpeg images,","venue":null,"work_id":"1074b210-3c11-4dd1-be6d-06e157dfe0be","year":2019},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.559987Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:07cee81b5db8558dd12742f8a310cb34190be6e2aa8cae759961ab589e19842e","observation_id":"dfa7b527-c46b-4bb0-bc54-892e930b1649","resolution":{"observed_at":"2026-08-07T11:44:17.596813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.572918Z","title":"Interpolation and denoising of graph signals using plug-and-play admm,","venue":null,"work_id":"ccee780f-78a6-4fcf-a401-71e2c74ce407","year":2019},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.579681Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:58588db1e7d6095b6500bd9186f0c0a5a47541e83519b8c4a7d66ee23e6a7426","observation_id":"7f079f54-3ffc-42cc-b489-a7ae74d1d2c8","resolution":{"observed_at":"2026-08-07T11:44:17.578921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:12.602114Z","title":"Graph signal restoration using nested deep algorithm unrolling,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:12.602114Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:9b0de44577b43d15c9275ae791cc5886cc311f4b2c8ca366b8b58313ea318307","observation_id":"4a052015-27f5-4769-820f-bd5ace8e785f","resolution":{"observed_at":"2026-08-07T11:44:12.602114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.546592Z","title":"On the Laplacian Eigenvalues of Signed Graphs,","venue":null,"work_id":"25fe79f2-409c-4c3e-a400-38259df3ade0","year":2003},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:13.879328Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:8621f69c97d5869edd25718d5ffcc0e29ac9e65de374079064f48e5a17569bc5","observation_id":"b2f48b8d-91f8-4600-ba85-69cfb4c1de93","resolution":{"observed_at":"2026-08-07T11:44:17.551052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.529799Z","title":"Spectral Analysis of k- Balanced Signed Graphs,","venue":null,"work_id":"70221d55-10ec-4e2a-b5cb-ad61ec963912","year":2011},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:13.908647Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:4a82b38f144b989731ae09a4856b4add63e4e9b426660e5bf8afd8df8367c977","observation_id":"ddae6656-2b26-470b-b0eb-2a5209051b09","resolution":{"observed_at":"2026-08-07T11:44:17.534570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.511872Z","title":"Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization,","venue":null,"work_id":"e3d6cb0b-1c2c-4872-997e-9fa43ae2a5ba","year":2010},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:13.928568Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:2f1e107945ae32b5f243ef0945fd62c1f0b83ed925236d9f0edf8cf8c1262031","observation_id":"22c49c01-ee2b-4ec3-9af9-e1cf490e071d","resolution":{"observed_at":"2026-08-07T11:44:17.517108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.494420Z","title":"Signal Processing on Signed Graphs: Funda- mentals and Potentials,","venue":null,"work_id":"514c984f-1836-42e0-b59f-c497e226f996","year":2020},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:13.944443Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:a8375d7fd29f5033d51ea88bc43920868795d4f8345ae7f56dcbff58669e5634","observation_id":"4f4a0951-111b-4d25-b082-0c09367ede46","resolution":{"observed_at":"2026-08-07T11:44:17.499697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.477765Z","title":"Discrete nodal domain theorems,","venue":null,"work_id":"fe03a784-a8d0-4d21-9b13-5d4c2745ba59","year":2000},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:13.959874Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:3ec284423d42aacc365e09dfa307d4675e5145f2f824614582365ea1abd770b8","observation_id":"730614a6-d0be-4846-b99f-225364a20e92","resolution":{"observed_at":"2026-08-07T11:44:17.483120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.462061Z","title":"Efficient signed graph sampling via balancing & gershgorin disc perfect alignment,","venue":null,"work_id":"f7ca5ec8-93f9-42ea-8a35-cad82eebffeb","year":2025},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:13.973213Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:3647be7f78b063b382f52b9a8ea2d6143338d071656397bc4dc9064f8398618c","observation_id":"f8492111-9da9-4291-90b0-4a91c088418d","resolution":{"observed_at":"2026-08-07T11:44:17.467427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.444409Z","title":"Efficient learning of balanced signature graphs,","venue":null,"work_id":"bbb2a318-6b6e-480c-88dc-fa9f6a4850ea","year":2023},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:13.990810Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:ab099ff797ab2dc8884f9115ca4f34afa6e534ee0a0fddcd6f362899f2279ab3","observation_id":"adcb64c7-2db9-490b-ad3d-febddbbf7499","resolution":{"observed_at":"2026-08-07T11:44:17.450705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.426329Z","title":"The graphical lasso: New insights and alternatives,","venue":null,"work_id":"57490242-b1ad-475b-b7ca-9fca99b618c1","year":2012},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.010853Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:6b545b6a204ca6633ea5660893de51488b9f303107c46e9133927d3e8c30a972","observation_id":"ca202b35-efff-4dc5-b3be-7db2a0cab632","resolution":{"observed_at":"2026-08-07T11:44:17.431840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.409295Z","title":"Balancing signed graphs,","venue":null,"work_id":"28a90745-0068-45b9-8740-1f7c6ba7a2da","year":1981},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.026957Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:27129349cfb0a88ebf030b0ef70712362a467ef0a9881c659593f58d71734907","observation_id":"77f17615-339f-4ab2-87b3-ce878eca94f9","resolution":{"observed_at":"2026-08-07T11:44:17.415028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.392972Z","title":"Linear-Time Sampling on Signed Graphs Via Gershgorin Disc Perfect Alignment,","venue":null,"work_id":"657faa84-045c-4215-87e1-40f0b247c326","year":2022},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.043960Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:d82303ca8874d44ead6046fb4137b09da45afb88a4faf1814225e62a919c2352","observation_id":"2ac33abc-8208-4be7-b80f-ba8ed263ebc1","resolution":{"observed_at":"2026-08-07T11:44:17.397864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.375183Z","title":"Signed graph balancing with graph cut,","venue":null,"work_id":"fcf951a9-c063-41bd-99be-fd0f03a3cca5","year":2023},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.062427Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:96bd1ba9ef212a94af5e44b8f2aff8b8d74954121ca05973bc585d6719952ac0","observation_id":"48039b14-592e-4961-bf07-4edafc902c9b","resolution":{"observed_at":"2026-08-07T11:44:17.381188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.357364Z","title":"A constrained ℓ1 minimization approach to sparse precision matrix estimation,","venue":null,"work_id":"22ce3ba7-cb4f-430e-a279-eab5eb28f3d1","year":2011},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.089066Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:b7cd765b2bdbba52a2098395485abbaab2ff05cfa1c9ae24f4c3355fd9990528","observation_id":"e4e290ef-a791-465d-92b2-dbfbe395db2f","resolution":{"observed_at":"2026-08-07T11:44:17.363389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.339030Z","title":"On the notion of balance of a signed graph","venue":null,"work_id":"0fedaa4f-cf0c-4791-b8b0-d79ba76059dd","year":1953},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.108607Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:a3bf170b70572fa4c2f2ca25260f87521c5415156a6424e002b73554d5df48b4","observation_id":"f1765fb5-aaca-463d-b8f4-d54d84344feb","resolution":{"observed_at":"2026-08-07T11:44:17.344475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.295038Z","title":"A new alternating direction method for linear programming,","venue":null,"work_id":"2cca3218-5d83-445c-9af3-aa49a1fa448a","year":2017},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.126180Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:46b2e503b7fdd822304987df125d45d198f8ead836eeb94bd2b5b9fec36604d6","observation_id":"0422e295-6408-4ad9-aaa7-faa6725ca454","resolution":{"observed_at":"2026-08-07T11:44:17.314898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.241332Z","title":"The determination of the order of an autoregression,","venue":null,"work_id":"ec9412d0-47fe-481f-bd6f-2fd098adf345","year":1979},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.143618Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:7d161b89e88cfd36d774a23117c6cb8af87516e26b053f02fd9cc90d9b77756f","observation_id":"cce37127-55f3-4ff5-9729-d67d8d5cd33b","resolution":{"observed_at":"2026-08-07T11:44:17.263978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.163176Z","title":"Variational Splines and Paley–Wiener Spaces on Combina- torial Graphs,","venue":null,"work_id":"f3a5561d-6147-4889-9b9a-1f88c24c53d6","year":2009},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.159404Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:f03f7fc6c8ae5db1b7f5fd9b8cbf87066bb0a7324a07c79cf3f691ed215da4d0","observation_id":"744a42c4-6b0b-4353-8bef-be1434c9bb97","resolution":{"observed_at":"2026-08-07T11:44:17.193145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.121952Z","title":"Graph attention networks,","venue":null,"work_id":"5cb70fb8-7ec1-408d-80ff-c2499fd90719","year":2018},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.176788Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:7799b7d59677d5f1569d15360c353c8c03443f3754063b0234b6d20c822da283","observation_id":"e9572a55-75af-4d6e-9dc3-6c499012cf13","resolution":{"observed_at":"2026-08-07T11:44:17.136634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.074406Z","title":"Graph Learning From Data Under Laplacian and Structural Constraints,","venue":null,"work_id":"426c4e17-9a0c-4d99-9395-dec24e2709b3","year":2017},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.189273Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:53c71dbd5c18be8d217f0928ed617ea6560059c0fa219fc01b0d2f4c7fdd5f0c","observation_id":"6bab92ca-478a-4791-b6d1-d475b2b4870c","resolution":{"observed_at":"2026-08-07T11:44:17.091901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:17.036259Z","title":"Kumar, J","venue":null,"work_id":"bb6d2083-d447-4c22-909c-9e93564ec7db","year":2019},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.204371Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:42f3b7d3107d8cb9a994f63c6498e29392c3a89860dc2597a7d48a100e9f2fda","observation_id":"dd6d0f03-ab56-4e4f-9c6d-0ef7e49cca21","resolution":{"observed_at":"2026-08-07T11:44:17.050802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.996224Z","title":"Spectral graph learning with core eigenvectors prior via iterative GLASSO and projection,","venue":null,"work_id":"b91e3294-4c74-4830-bbf0-5288e081a509","year":2024},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.226728Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:4f1c74d70af683a5e6193df474cdc3d916d7891a7f71b430abb9aad26aec0da9","observation_id":"8d239883-eb8a-4548-bd73-8b81ac513685","resolution":{"observed_at":"2026-08-07T11:44:17.012999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.956051Z","title":"Learning lapla- cian matrix in smooth graph signal representations,","venue":null,"work_id":"34a3dcf4-4ccc-4673-9100-344bbc79dc40","year":2016},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.245183Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:09fa01f2a85d7380e236767e1c72de50d3e1943633bb834105033e2fdf6b632f","observation_id":"a3b5281c-6a9b-43f5-b9fb-5666101035b6","resolution":{"observed_at":"2026-08-07T11:44:16.976393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.916418Z","title":"Learning graphs from data: A signal representation perspective,","venue":null,"work_id":"dfc9b343-2943-4fb6-8229-83289d3286c5","year":2019},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.259959Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:4a01a36172119bce45504c3bfc6265b230c2a9e6f3f887f488fbefedd53708a4","observation_id":"45259283-5a8f-491b-a07f-80f67825fadf","resolution":{"observed_at":"2026-08-07T11:44:16.934452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.883495Z","title":"Joint signal interpolation / time-varying graph estimation via smoothness and low-rank priors,","venue":null,"work_id":"6642e91e-623b-4db3-84c8-e71466cfec31","year":2024},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.280636Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:6b9c355d45d3a67c8fd767866d354f99975cb29d32276490a19184fbac25ceef","observation_id":"c0d96934-2640-47cb-8424-0dd62719d2ad","resolution":{"observed_at":"2026-08-07T11:44:16.898263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:14.299727Z","title":"Feature graph learning for 3d point cloud denoising,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.299727Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:c792f3c49839cdfad91db552a0c1ac9e6ff8be8ddbe2beb3c564d481e7f5f112","observation_id":"0837887b-b81a-4136-b6a5-6430f1f0dccd","resolution":{"observed_at":"2026-08-07T11:44:14.299727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.826105Z","title":"Signed Graph Metric Learning via Gershgorin Disc Perfect Alignment,","venue":null,"work_id":"373d2968-38b4-486e-90f3-77846ffc25cd","year":2022},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.328446Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:fc6b769cfa2a81d814613ea31f6be40ce16084e96fb1e9f1995f85edd7113e86","observation_id":"1f468e9e-abaa-4f76-82c2-36015654400d","resolution":{"observed_at":"2026-08-07T11:44:16.842445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.790026Z","title":"Interpretable lightweight transformer via unrolling of learned graph smoothness priors,","venue":null,"work_id":"8a9d59c9-d7bb-4a24-a953-33c01d08fbcb","year":2024},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.344303Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:e12ef16c1c8624da6761149bfe33207c99927405a548cf16f8232a7b395b4ff9","observation_id":"dfbdab8c-3de8-4372-a8bc-1b57e1bcac87","resolution":{"observed_at":"2026-08-07T11:44:16.803186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.759393Z","title":"Bilateral filtering for gray and color images,","venue":null,"work_id":"0023ec3a-2185-4aca-839a-ee3a92d05fea","year":1998},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.355478Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:7f7143fb53e3b20b5aa0dff3b3d598ea636387db6bdcdb81dfb829eda2f7645c","observation_id":"b0e96916-f2a1-465a-9d24-463f3be8105a","resolution":{"observed_at":"2026-08-07T11:44:16.771088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:14.370325Z","title":"Spectral analysis of signed graphs for clustering, prediction and visualization,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.370325Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:a68aaf270fe04b63052c569897067f8f4fadee973b0c02797c4d47c2f961366e","observation_id":"f69854da-42ea-4434-9871-ea4b1505db3a","resolution":{"observed_at":"2026-08-07T11:44:14.370325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.730060Z","title":"Efficient learning of balanced signed graphs via iterative linear programming,","venue":null,"work_id":"e218af4a-184c-46e7-9601-5a8997bd533c","year":2025},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.390381Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:1eb81df82be8d280817ab1d42dba10f18aef680f180deb28dccaba99bd5ce5bb","observation_id":"224ec2bc-4218-437d-a2e4-ffb644bc7296","resolution":{"observed_at":"2026-08-07T11:44:16.740790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.691581Z","title":"A faster algorithm for solving general LPs,","venue":null,"work_id":"ea81085c-d3aa-4031-8144-c7f3f7cef401","year":2021},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.415052Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:dcaef78db1258c01fcdc6a0957a84e9b641f77be8bdafe9d0d6e3602b1510d97","observation_id":"2b0740f0-8a93-4070-9de5-a7518b6801a4","resolution":{"observed_at":"2026-08-07T11:44:16.708958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.659717Z","title":"Graph Fourier transform with negative edges for depth image coding,","venue":null,"work_id":"be25e0f1-7fdb-4132-81ed-1e4c813f36b5","year":2017},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.438396Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:92b177774e3c63b3a96158f43bb6812a5acbee2d6e54c89e72dd35e46cfb778d","observation_id":"d39ca012-9299-4af4-a311-20fb69d99801","resolution":{"observed_at":"2026-08-07T11:44:16.671139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.613157Z","title":null,"venue":null,"work_id":"ffeff80d-d9bb-4b3f-874a-d1944bf495de","year":2004},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.453889Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:b680e816450ab08e941739c1fac88f11b31e350c7d0b32e9a4696e48ed06f5e6","observation_id":"dfa3b4ef-1dcc-418a-8a74-f18546fb9192","resolution":{"observed_at":"2026-08-07T11:44:16.631100Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.574668Z","title":"Graph spectral image processing,","venue":null,"work_id":"9520c085-12f0-4958-9be6-19d97aaebf91","year":2018},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.473280Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:82afcc98c3d0964c47961badd1797496f0b01450f8ec5a2c7a80fcd0e21aba56","observation_id":"468c3c18-b8ff-4fe3-a33d-ac0a0df9ea7d","resolution":{"observed_at":"2026-08-07T11:44:16.589542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.526825Z","title":"Complex graph Lapla- cian regularizer for inferencing grid states,","venue":null,"work_id":"9ab8b876-dd04-4b9d-8813-95478919ceb8","year":2023},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.490572Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:d15161ed5358d70b07d9617aa70d201a6b61c98b6c17f102a4526c24ce048ff2","observation_id":"a21b514f-8047-4132-9e10-3114f5306466","resolution":{"observed_at":"2026-08-07T11:44:16.548704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:14.505440Z","title":"Semidefinite relaxation of quadratic optimization problems,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.505440Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:6e774b06a2cf2df61b22460feab5eb240607ea3facd6333a3c3ae54cc5e2b1f8","observation_id":"ad9b0360-8069-45d1-8b06-9c40aaef73c1","resolution":{"observed_at":"2026-08-07T11:44:14.505440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.480818Z","title":"Dynamics of social balance on networks,","venue":null,"work_id":"22a1e98e-7586-46cc-ab09-92252498f0bc","year":2005},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.523819Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:8428f4607c5d674d549a7f11b66d798943f8057909e9419aaf6934c99cbdf07a","observation_id":"58bb3205-245c-480f-8605-11332383d624","resolution":{"observed_at":"2026-08-07T11:44:16.498875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.445607Z","title":"Bipartite consensus for multi-agent systems on directed signed networks,","venue":null,"work_id":"314e8adf-412e-473f-8232-cdb543e9b215","year":2013},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.547001Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:a8696ac2974f30ea577f2b1ab057a1d0b680958c23b80bef3fb13461cdec3ef3","observation_id":"7e66f83a-074c-4fcb-9b32-92ebdec50470","resolution":{"observed_at":"2026-08-07T11:44:16.461695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:16.409050Z","title":"The Structural Balance Theory of Sentiment Networks: Elaboration and Test,","venue":null,"work_id":"322e2016-3f2e-47ee-ae67-e57421f69f3c","year":2017},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.564257Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:7548ef498038e9d830327c3e951bd87f2a144e7187bc66890661bd006b14b0cc","observation_id":"357066c2-1e5a-439f-883e-b08b919592ab","resolution":{"observed_at":"2026-08-07T11:44:16.424092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:15.122619Z","title":"Testing structural balance theories in heterogeneous signed networks,","venue":null,"work_id":"b781caec-0a2c-4087-92d1-b6393cd1492e","year":2024},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.581415Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:29f1d00f09f4e5165c559dbc355e723a4b2e571dfad296c8ec1a5274be189d7d","observation_id":"679a78fb-1acc-419d-b672-f6f17f5da465","resolution":{"observed_at":"2026-08-07T11:44:16.316171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:15.083679Z","title":null,"venue":null,"work_id":"1aecb8d3-3c72-49a3-a400-19fe70011f38","year":2005},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.597187Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:b7ad2f04de7ee3dc5faee39afb6f2c6d801ea800e94c2ee9a65645484af2f3d3","observation_id":"f67f04d4-7527-402c-b2cf-f5c5d00626e4","resolution":{"observed_at":"2026-08-07T11:44:15.098439Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:15.052925Z","title":"Information Theory and an Extension of the Maximum Likelihood Principle,","venue":null,"work_id":"edce70eb-ab30-4e2b-a1ee-2f5746f9760a","year":1998},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.608809Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:6b090a9da76d67e5d1c18e252d34895e42195472dd13ede12ed93283fa66c1a2","observation_id":"f335296a-9e78-4e2c-9409-1a04dbd762f3","resolution":{"observed_at":"2026-08-07T11:44:15.065131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:14.987653Z","title":"Estimating the dimension of a model,","venue":null,"work_id":"71f14d32-4ce0-4e10-8948-baedb610d15a","year":1978},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.624632Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:bdd23347ae131f096f409de0c4c6c24ade95c777f5bfbf778419a4029b6301f5","observation_id":"185ede38-e736-4252-9db8-0da7ddf1e775","resolution":{"observed_at":"2026-08-07T11:44:15.012524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:14.950275Z","title":"Graph learning information criterion,","venue":null,"work_id":"5b5aa88d-69ea-4f10-b281-13c74ce2135d","year":2022},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.640186Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:867249be76e104f9370b90f755e6c23eb141fcdda5ba0db40bea196a139850a2","observation_id":"4c4de849-9f07-4d8f-a1e3-48fee487fe46","resolution":{"observed_at":"2026-08-07T11:44:14.969284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:14.657829Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.657829Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:ebd18e20ffe869e102c67bc65dc410510a015aabc80f128a0b8a64625f0f8068","observation_id":"d95124d2-153d-48b7-bdef-7c0afd1cdfa9","resolution":{"observed_at":"2026-08-07T11:44:14.657829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:14.897269Z","title":"An introduction to the conjugate gradient method without the agonizing pain,","venue":null,"work_id":"60e2bb41-beba-4bc9-baf3-e0f643415752","year":1994},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.676268Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:a0063eaf7cfdb8fe0dbf59f854ca59845c6b654905e649eb2bb1c365cf67e9e6","observation_id":"fc5d0ef1-9534-4468-a5dd-8603f8821156","resolution":{"observed_at":"2026-08-07T11:44:14.912140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:14.861145Z","title":"On random graphs i,","venue":null,"work_id":"b52944c6-0cf3-4398-8f91-e074019d0594","year":1959},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.692176Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:74567d9455c1e7e6753189ad6ccdd23db91645dd366517ce640e167d06e383db","observation_id":"4e7c4de0-c1a1-4120-9eff-158a4b407f7d","resolution":{"observed_at":"2026-08-07T11:44:14.875646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:14.822033Z","title":"Untrained Graph Neural Networks for Denoising,","venue":null,"work_id":"dbdb06ff-f011-4548-b679-643f074973b8","year":2022},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.707499Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:514493219b8a2af58be2998302d8233731d0bc7b99e0014ef7fa0efa7b60becb","observation_id":"4f6aec36-461f-43b7-876f-87d5bed4543e","resolution":{"observed_at":"2026-08-07T11:44:14.838896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:44:14.784944Z","title":"Biggs, Algebraic graph theory","venue":null,"work_id":"d18c4f19-a7a3-487f-8551-a1312769fefa","year":1993},"citing_paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:14.724894Z"},"links":{"citing_paper":"/paper/2506.01826"},"observation_digest":"sha256:7798abc74187dbaf038011c16b819906f72ccb727e9b63c8c4b5846451d261d6","observation_id":"80aa9089-746c-4272-99f0-be87c9243dc8","resolution":{"observed_at":"2026-08-07T11:44:14.801816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.01826","last_updated":"2025-06-02T16:09:51Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T11:30:33.428662Z","submitted_at":"2025-06-02T16:09:51Z","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming"},"reference_resolution":{"displayed":64,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":57},"total_outbound_references":64},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 64 of 64 outbound references and 0 inbound Pith citation observations for arXiv:2506.01826."}