Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-06T17:08:13.544595Z
Paper Citation Record · LEDGER
As of 7 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2507.12607.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-06T17:08:13.544595Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
25 of 25 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation 598460ae-589f-4197-a976-0d5d5fab0de4 · outbound
Max-Cut with Multiple Cardinality Constraints Better balance by being biased: A 0.8776-approximation for max bisection
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 3a709c22-b3bc-4a10-a047-0a4733306ca3 · outbound
Max-Cut with Multiple Cardinality Constraints Ageev and Maxim Sviridenko
Reference 2
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation bfca36ab-fd84-4111-947e-e8c150fe94cc · outbound
Max-Cut with Multiple Cardinality Constraints Global cardinality constraints make approximating some max-2-csps harder
Reference 3
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation f3bfca23-7b56-4626-bc82-836a1bf0cd2e · outbound
Max-Cut with Multiple Cardinality Constraints Submodular maximization with cardinality constraints
Reference 4
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 6093db57-5746-4fa7-ad1b-1c6e79749106 · outbound
Max-Cut with Multiple Cardinality Constraints Rounding semidefinite programming hierarchies via global correlation
Reference 5
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 4c048c1f-6ba6-438d-b29e-5a7992273284 · outbound
Max-Cut with Multiple Cardinality Constraints Parameterized complexity of cardinality constrained optimization problems
Reference 6
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 4de4ecac-2400-4277-8fb0-d52ef0dd604f · outbound
Max-Cut with Multiple Cardinality Constraints Optimal pricing in networks with externalities
Reference 7
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 7228b91a-f988-40cd-a660-d885e2f9405d · outbound
Max-Cut with Multiple Cardinality Constraints Maximizing a monotone submodular function subject to a matroid constraint
Reference 8
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 6d1c1438-dddc-4e37-9b2c-2c12f6ea7b0a · outbound
Max-Cut with Multiple Cardinality Constraints Improved approximation algorithms for MAX k -CUT and MAX BISECTION
Reference 9
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 4c7ca994-0e04-4b70-979f-d3cf48b04643 · outbound
Max-Cut with Multiple Cardinality Constraints A note on approximating max-bisection on regular graphs
Reference 10
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation f888a860-0e4c-4a0a-bd8a-1d3cb5130891 · outbound
Max-Cut with Multiple Cardinality Constraints Semialgebraic proofs and efficient algorithm design
Reference 11
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 817004e5-478d-4958-922b-82f51fd86498 · outbound
Max-Cut with Multiple Cardinality Constraints Approximation algorithms for maximization problems arising in graph partitioning
Reference 12
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 6e5fbc3f-d441-48a8-961e-b5076ba50f25 · outbound
Max-Cut with Multiple Cardinality Constraints The RPR^2 rounding technique for semidefinite programs
Reference 13
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 5e5ee382-cafa-4005-a196-5695f6672900 · outbound
Max-Cut with Multiple Cardinality Constraints On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities
Reference 14
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 8aa4d023-5666-480b-a9a6-8bd15dadf387 · outbound
Max-Cut with Multiple Cardinality Constraints Finding almost-perfect graph bisections
Reference 15
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation e8e4be73-2038-48f2-886e-775f0f95b228 · outbound
Max-Cut with Multiple Cardinality Constraints Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Reference 16
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e3592dc7-9eb8-4087-9b49-c686a2811c96 · outbound
Max-Cut with Multiple Cardinality Constraints A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
Reference 17
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 87cc648b-5783-44e0-a56b-655efc631928 · outbound
Max-Cut with Multiple Cardinality Constraints Optimal inapproximability results for MAX-CUT and other 2 -variable CSPs ? SIAM Journal on Computing , 37(1):319--357, 2007
Reference 18
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 5c08194b-af3b-4fdb-99b2-98ee48b15c11 · outbound
Max-Cut with Multiple Cardinality Constraints A comparison of the sherali-adams, lovász-schrijver, and lasserre relaxations for 0-1 programming
Reference 19
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 15ab9774-5494-4d1c-83b4-ce7a9da81120 · outbound
Max-Cut with Multiple Cardinality Constraints A Survey on Fairness for Machine Learning on Graphs
Reference 20
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 090d07c9-f7ce-4cf8-94ff-81bfd7ee3b21 · outbound
Max-Cut with Multiple Cardinality Constraints Mirrokni, Viswanath Nagarajan, and Maxim Sviridenko
Reference 21
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 732f3674-cfb5-450d-bb68-27fcfabab234 · outbound
Max-Cut with Multiple Cardinality Constraints The lasserre hierarchy in approximation algorithms
Reference 22
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation f0351de4-14b2-407c-8d6a-366ac76f18e8 · outbound
Max-Cut with Multiple Cardinality Constraints Approximating CSPs with global cardinality constraints using SDP hierarchies
Reference 23
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 32d5a534-54b5-43d4-9a98-75cde90a5bf7 · outbound
Max-Cut with Multiple Cardinality Constraints ( k, n-k )-max-cut: An O ^ * (2^ p ) -time algorithm and a polynomial kernel
Reference 24
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 0d2c65b3-8ecd-4611-b414-ca7028868b04 · outbound
Max-Cut with Multiple Cardinality Constraints A .699 -approximation algorithm for max-bisection
Reference 25
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
No inbound Pith citation observations are available.