Pith. sign in

Paper Citation Record · LEDGER

Max-Cut with Multiple Cardinality Constraints

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.

pith.paper-citation-record.v1
2507.12607 v1

Coverage vector

measured 25 of 25 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T17:08:13.544595Z

measured 25 of 25 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

25 of 25 outbound references displayed

  • verified exact0
  • verified fuzzy22
  • unresolved3
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 598460ae-589f-4197-a976-0d5d5fab0de4 · outbound

This paper cites Better balance by being biased: A 0.8776-approximation for max bisection.

Max-Cut with Multiple Cardinality Constraints Better balance by being biased: A 0.8776-approximation for max bisection

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:19.427866Z

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.

source=arxiv_source observed=2026-08-06T17:08:11.045965Z digest=sha256:44dd026c5e1cf393769c1838d02e2b7fa3d4251a24e31022dc6a3287a369725f

Observation 3a709c22-b3bc-4a10-a047-0a4733306ca3 · outbound

This paper cites Ageev and Maxim Sviridenko.

Max-Cut with Multiple Cardinality Constraints Ageev and Maxim Sviridenko

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:19.187139Z

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.

source=arxiv_source observed=2026-08-06T17:08:11.095797Z digest=sha256:08d726c86c0344079b3a9a986bcb0eedbf0154e97e5e1b585e31705cae3b301c

Observation bfca36ab-fd84-4111-947e-e8c150fe94cc · outbound

This paper cites Global cardinality constraints make approximating some max-2-csps harder.

Max-Cut with Multiple Cardinality Constraints Global cardinality constraints make approximating some max-2-csps harder

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:18.903271Z

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.

source=arxiv_source observed=2026-08-06T17:08:11.169874Z digest=sha256:787efd74562fcca5ca516ec48647e037ca882ec17291b013e128c9f03ed1a2c2

Observation f3bfca23-7b56-4626-bc82-836a1bf0cd2e · outbound

This paper cites Submodular maximization with cardinality constraints.

Max-Cut with Multiple Cardinality Constraints Submodular maximization with cardinality constraints

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:18.655660Z

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.

source=arxiv_source observed=2026-08-06T17:08:11.272388Z digest=sha256:eca9d72da3bab825a89c30cd9a708a5d7f27f95185a01e940fc29abaf379c506

Observation 6093db57-5746-4fa7-ad1b-1c6e79749106 · outbound

This paper cites Rounding semidefinite programming hierarchies via global correlation.

Max-Cut with Multiple Cardinality Constraints Rounding semidefinite programming hierarchies via global correlation

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:18.381465Z

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.

source=arxiv_source observed=2026-08-06T17:08:11.362127Z digest=sha256:3d68c024a513c43c184bb436746c40d9ce897dc81f4962fe3ce54d764192609b

Observation 4c048c1f-6ba6-438d-b29e-5a7992273284 · outbound

This paper cites Parameterized complexity of cardinality constrained optimization problems.

Max-Cut with Multiple Cardinality Constraints Parameterized complexity of cardinality constrained optimization problems

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:18.071306Z

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.

source=arxiv_source observed=2026-08-06T17:08:11.445056Z digest=sha256:d06a7d2b8fe1c70227f5d39a58156753ad878a42c986b32cf9125209ef2365e3

Observation 4de4ecac-2400-4277-8fb0-d52ef0dd604f · outbound

This paper cites Optimal pricing in networks with externalities.

Max-Cut with Multiple Cardinality Constraints Optimal pricing in networks with externalities

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:17.852751Z

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.

source=arxiv_source observed=2026-08-06T17:08:11.499060Z digest=sha256:262d69673ab9e879a6500c9504e48d92e3be6d652c4b601851de159333d696ff

Observation 7228b91a-f988-40cd-a660-d885e2f9405d · outbound

This paper cites Maximizing a monotone submodular function subject to a matroid constraint.

Max-Cut with Multiple Cardinality Constraints Maximizing a monotone submodular function subject to a matroid constraint

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:17.531253Z

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.

source=arxiv_source observed=2026-08-06T17:08:11.597698Z digest=sha256:119f87a5bfe884bc99b56c9a67604c936ca72b67db550cdc0ac96d793d0cb0f2

Observation 6d1c1438-dddc-4e37-9b2c-2c12f6ea7b0a · outbound

This paper cites Improved approximation algorithms for MAX k -CUT and MAX BISECTION.

Max-Cut with Multiple Cardinality Constraints Improved approximation algorithms for MAX k -CUT and MAX BISECTION

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:17.227205Z

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.

source=arxiv_source observed=2026-08-06T17:08:11.677411Z digest=sha256:9e6216acb38f0929e260b805ac1cfda3bb0612b89aa2fcdb8d95cb765036d15f

Observation 4c7ca994-0e04-4b70-979f-d3cf48b04643 · outbound

This paper cites A note on approximating max-bisection on regular graphs.

Max-Cut with Multiple Cardinality Constraints A note on approximating max-bisection on regular graphs

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:16.936209Z

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.

source=arxiv_source observed=2026-08-06T17:08:11.750641Z digest=sha256:792e1a46c621567061e5d3209871cc8190b5ced3266c21859aadd814f5ad295d

Observation f888a860-0e4c-4a0a-bd8a-1d3cb5130891 · outbound

This paper cites Semialgebraic proofs and efficient algorithm design.

Max-Cut with Multiple Cardinality Constraints Semialgebraic proofs and efficient algorithm design

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:16.672464Z

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.

source=arxiv_source observed=2026-08-06T17:08:11.830442Z digest=sha256:33cde2804508e073134cfe0c006c8ec57cc4f7c01f204d19821f6e97ecccaf87

Observation 817004e5-478d-4958-922b-82f51fd86498 · outbound

This paper cites Approximation algorithms for maximization problems arising in graph partitioning.

Max-Cut with Multiple Cardinality Constraints Approximation algorithms for maximization problems arising in graph partitioning

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:16.361703Z

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.

source=arxiv_source observed=2026-08-06T17:08:11.888024Z digest=sha256:f0ac84b76e8d1d44e3ab5742a320cb28941153f4033b23c3c051ed13af11ccf2

Observation 6e5fbc3f-d441-48a8-961e-b5076ba50f25 · outbound

This paper cites The RPR^2 rounding technique for semidefinite programs.

Max-Cut with Multiple Cardinality Constraints The RPR^2 rounding technique for semidefinite programs

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:16.128118Z

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.

source=arxiv_source observed=2026-08-06T17:08:11.941996Z digest=sha256:9f46c1c3d0137f6e06151164ad034112d8c03403921d4e23d15e170c28229d8d

Observation 5e5ee382-cafa-4005-a196-5695f6672900 · outbound

This paper cites On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities.

Max-Cut with Multiple Cardinality Constraints On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:15.924670Z

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.

source=arxiv_source observed=2026-08-06T17:08:11.989335Z digest=sha256:cb5f4e0ecdda5dbe4488a95485420a82c947be2bf2d88fd3b5994cf0e5044b36

Observation 8aa4d023-5666-480b-a9a6-8bd15dadf387 · outbound

This paper cites Finding almost-perfect graph bisections.

Max-Cut with Multiple Cardinality Constraints Finding almost-perfect graph bisections

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:15.577858Z

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.

source=arxiv_source observed=2026-08-06T17:08:12.076954Z digest=sha256:a2ced4de8e5248f76a13fbc2444b05d4ff5266a91e1306acde1db2b88fd04c48

Observation e8e4be73-2038-48f2-886e-775f0f95b228 · outbound

This paper cites Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming.

Max-Cut with Multiple Cardinality Constraints Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-06T17:08:12.156849Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T17:08:12.156849Z digest=sha256:ddf8f61afa5b220b12057e95f2c03b70c94e57a3cc6ea0e70193c5ce90a5b87a

Observation e3592dc7-9eb8-4087-9b49-c686a2811c96 · outbound

This paper cites A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems.

Max-Cut with Multiple Cardinality Constraints A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:15.377461Z

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.

source=arxiv_source observed=2026-08-06T17:08:12.208773Z digest=sha256:a4c5d7f1093419c57f2a1e6555f999ff729f8df25e2dfa15880d3d91020468d8

Observation 87cc648b-5783-44e0-a56b-655efc631928 · outbound

This paper cites Optimal inapproximability results for MAX-CUT and other 2 -variable CSPs ? SIAM Journal on Computing , 37(1):319--357, 2007.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:15.333255Z

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.

source=arxiv_source observed=2026-08-06T17:08:12.364394Z digest=sha256:94149eb813104104efc023acb2df225192e8c654ddafe45373692f41c55f8e2c

Observation 5c08194b-af3b-4fdb-99b2-98ee48b15c11 · outbound

This paper cites A comparison of the sherali-adams, lovász-schrijver, and lasserre relaxations for 0-1 programming.

Max-Cut with Multiple Cardinality Constraints A comparison of the sherali-adams, lovász-schrijver, and lasserre relaxations for 0-1 programming

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:15.293961Z

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.

source=arxiv_source observed=2026-08-06T17:08:12.620883Z digest=sha256:4fd0bc667ef6f353db244a619f8dee8e861d7e89128e1ccbd64d1965b8c8c3b0

Observation 15ab9774-5494-4d1c-83b4-ce7a9da81120 · outbound

This paper cites A Survey on Fairness for Machine Learning on Graphs.

Max-Cut with Multiple Cardinality Constraints A Survey on Fairness for Machine Learning on Graphs

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-06T17:08:12.874371Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T17:08:12.874371Z digest=sha256:86f0c341f3cf2e3bd146ed3f914cd20efc2ad6ca267482cd2bc293d2c3f0c11e

Observation 090d07c9-f7ce-4cf8-94ff-81bfd7ee3b21 · outbound

This paper cites Mirrokni, Viswanath Nagarajan, and Maxim Sviridenko.

Max-Cut with Multiple Cardinality Constraints Mirrokni, Viswanath Nagarajan, and Maxim Sviridenko

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-06T17:08:13.106909Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T17:08:13.106909Z digest=sha256:7291e5ab9eb4da9ff59651d0f080289b0aeba40581a8ab3c154734e0c2d9a73d

Observation 732f3674-cfb5-450d-bb68-27fcfabab234 · outbound

This paper cites The lasserre hierarchy in approximation algorithms.

Max-Cut with Multiple Cardinality Constraints The lasserre hierarchy in approximation algorithms

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:15.054032Z

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.

source=arxiv_source observed=2026-08-06T17:08:13.297591Z digest=sha256:84a5d1615837a6944e3e2f5d54ac02d441fbd4852ea6954b973558a344170b92

Observation f0351de4-14b2-407c-8d6a-366ac76f18e8 · outbound

This paper cites Approximating CSPs with global cardinality constraints using SDP hierarchies.

Max-Cut with Multiple Cardinality Constraints Approximating CSPs with global cardinality constraints using SDP hierarchies

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:14.631761Z

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.

source=arxiv_source observed=2026-08-06T17:08:13.415758Z digest=sha256:9b9920e1e93ff5aec9d49c133ce1cb06f2e56ac0b9adfdb842eb2048573667d7

Observation 32d5a534-54b5-43d4-9a98-75cde90a5bf7 · outbound

This paper cites ( k, n-k )-max-cut: An O ^ * (2^ p ) -time algorithm and a polynomial kernel.

Max-Cut with Multiple Cardinality Constraints ( k, n-k )-max-cut: An O ^ * (2^ p ) -time algorithm and a polynomial kernel

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:14.263088Z

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.

source=arxiv_source observed=2026-08-06T17:08:13.471756Z digest=sha256:410b6c144d5d68305ef56e448e459c0fd299fd092548d2c5d713a5d7977f3845

Observation 0d2c65b3-8ecd-4611-b414-ca7028868b04 · outbound

This paper cites A .699 -approximation algorithm for max-bisection.

Max-Cut with Multiple Cardinality Constraints A .699 -approximation algorithm for max-bisection

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:08:13.833506Z

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.

source=arxiv_source observed=2026-08-06T17:08:13.544595Z digest=sha256:86f7d6b2ccde14a0782da94ac83ecc2ba0ce46e96eb4bfa17c2992ab98349b9c

Pith citing papers

No inbound Pith citation observations are available.