{"as_of":"2026-08-10T06:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:265deb97ec17de710ed4ea01458e9c41ef8589a713dafe85e44ddb15cd5c3a3a","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:08:13.544595Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2507.12607/citation-record","integrity":"/paper/2507.12607/integrity","json":"/paper/2507.12607/citation-record.json","paper":"/paper/2507.12607"},"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-06T17:08:19.321989Z","title":"Better balance by being biased: A 0.8776-approximation for max bisection","venue":null,"work_id":"36d2c0ed-6624-4016-9060-90dcdb85f15c","year":2016},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:11.045965Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:cc14d59aeacb946e0e23e93726290d7e33efb44d393e7b566b085aeb45363da2","observation_id":"598460ae-589f-4197-a976-0d5d5fab0de4","resolution":{"observed_at":"2026-08-06T17:08:19.427866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:19.073932Z","title":"Ageev and Maxim Sviridenko","venue":null,"work_id":"55da861b-a525-482d-9c04-c58db46cd224","year":2004},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:11.095797Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:19072698d5234c5910373b75a1c9d214e58e1b7ce5facb80aaeb39c6debc08cf","observation_id":"3a709c22-b3bc-4a10-a047-0a4733306ca3","resolution":{"observed_at":"2026-08-06T17:08:19.187139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:18.767521Z","title":"Global cardinality constraints make approximating some max-2-csps harder","venue":null,"work_id":"6540c992-2dd5-400f-9fa7-854b559a74fa","year":2019},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:11.169874Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:66e4400dadea76685ac8f543640f84276861c3a29ea94792d630f032ba49a13e","observation_id":"bfca36ab-fd84-4111-947e-e8c150fe94cc","resolution":{"observed_at":"2026-08-06T17:08:18.903271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:18.494875Z","title":"Submodular maximization with cardinality constraints","venue":null,"work_id":"cbc7a459-8490-4716-bc36-d948a19d5f4b","year":2014},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:11.272388Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:a8f76b6f90cff0dd3ede35099f84ce5c662a069c5fa78c1ac0e5b8ec356d382f","observation_id":"f3bfca23-7b56-4626-bc82-836a1bf0cd2e","resolution":{"observed_at":"2026-08-06T17:08:18.655660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:18.231241Z","title":"Rounding semidefinite programming hierarchies via global correlation","venue":null,"work_id":"563898bf-2b80-4bab-bc6a-0e839100a07c","year":2011},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:11.362127Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:e51d5f76f8bf9eab414e75721298f35bd4381e176b813d5a4e1f4a3c1579d9fa","observation_id":"6093db57-5746-4fa7-ad1b-1c6e79749106","resolution":{"observed_at":"2026-08-06T17:08:18.381465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:17.969891Z","title":"Parameterized complexity of cardinality constrained optimization problems","venue":null,"work_id":"a6ebf42c-b82b-4c99-9593-df25fd2e520f","year":2008},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:11.445056Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:7fcd1d4062f01aa7ed1a7341b77f38ff5504b0c098d3439bbbd00537913f4eb8","observation_id":"4c048c1f-6ba6-438d-b29e-5a7992273284","resolution":{"observed_at":"2026-08-06T17:08:18.071306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:17.702000Z","title":"Optimal pricing in networks with externalities","venue":null,"work_id":"f2c14535-410e-4fd4-bccf-0844ecffbc5c","year":2012},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:11.499060Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:2e58917fc9075d997f4729d1065759632332de571401e495c508433d5e0bf7f1","observation_id":"4de4ecac-2400-4277-8fb0-d52ef0dd604f","resolution":{"observed_at":"2026-08-06T17:08:17.852751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:17.382468Z","title":"Maximizing a monotone submodular function subject to a matroid constraint","venue":null,"work_id":"3079db4f-8d0e-4025-87ac-2fbc3bc283cd","year":2011},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:11.597698Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:861dc31e86d598ed77cce1085ddab927a70326f579c3368673ade82e6b5bf7ce","observation_id":"7228b91a-f988-40cd-a660-d885e2f9405d","resolution":{"observed_at":"2026-08-06T17:08:17.531253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:17.087307Z","title":"Improved approximation algorithms for MAX k -CUT and MAX BISECTION","venue":null,"work_id":"3a1f2ea4-ad11-4613-883b-51ccf06abc01","year":1997},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:11.677411Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:1f22ea2ea7b45e929e042d62f1d7422a95579821fde63d0b2bc4c1303236dce8","observation_id":"6d1c1438-dddc-4e37-9b2c-2c12f6ea7b0a","resolution":{"observed_at":"2026-08-06T17:08:17.227205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:16.829340Z","title":"A note on approximating max-bisection on regular graphs","venue":null,"work_id":"31d75861-506a-4f8e-bc2e-dc77f1721724","year":2001},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:11.750641Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:707d868869bdfd34d162dc64a1aa390ba2e730c99498613d97306cf924005fbe","observation_id":"4c7ca994-0e04-4b70-979f-d3cf48b04643","resolution":{"observed_at":"2026-08-06T17:08:16.936209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:16.516797Z","title":"Semialgebraic proofs and efficient algorithm design","venue":null,"work_id":"447b8829-a205-4ce0-ae16-c3bd74a5e6e8","year":2019},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:11.830442Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:fcc88cf83538dfa0d1c17ddaef4ba9bb83a1fe00796888a5303e70e93f77df9e","observation_id":"f888a860-0e4c-4a0a-bd8a-1d3cb5130891","resolution":{"observed_at":"2026-08-06T17:08:16.672464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:16.263693Z","title":"Approximation algorithms for maximization problems arising in graph partitioning","venue":null,"work_id":"a24338ff-b246-4740-9145-a472e9d0c587","year":2001},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:11.888024Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:34e3e08ea74f86c408befe10f0393d9d2010b08013ddbd2a1449cd1f5cffbae7","observation_id":"817004e5-478d-4958-922b-82f51fd86498","resolution":{"observed_at":"2026-08-06T17:08:16.361703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:16.035170Z","title":"The RPR^2 rounding technique for semidefinite programs","venue":null,"work_id":"0fb1914a-7087-40bd-853a-a2a0d823953d","year":2006},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:11.941996Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:851434df323ba13c258fdd6b8c65459ebdf932eb8b727b93fe1302b338fa3620","observation_id":"6e5fbc3f-d441-48a8-961e-b5076ba50f25","resolution":{"observed_at":"2026-08-06T17:08:16.128118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:15.764746Z","title":"On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities","venue":null,"work_id":"b6a7ccdc-3181-4620-871a-2f1d18293e52","year":2014},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:11.989335Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:46019e6ab0e0b3aa9ddea51e3608733dd1bc03789446d0dd819ff22112b7452e","observation_id":"5e5ee382-cafa-4005-a196-5695f6672900","resolution":{"observed_at":"2026-08-06T17:08:15.924670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:15.484446Z","title":"Finding almost-perfect graph bisections","venue":null,"work_id":"55aec4fc-46c7-4543-ae71-09276f6116c9","year":2011},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:12.076954Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:38c653ec1ea6f07a2dd1fdef4d4efa98d4af4a433f5a6402a946fda9e6b883bf","observation_id":"8aa4d023-5666-480b-a9a6-8bd15dadf387","resolution":{"observed_at":"2026-08-06T17:08:15.577858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:12.156849Z","title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:12.156849Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:ddf8f61afa5b220b12057e95f2c03b70c94e57a3cc6ea0e70193c5ce90a5b87a","observation_id":"e8e4be73-2038-48f2-886e-775f0f95b228","resolution":{"observed_at":"2026-08-06T17:08:12.156849Z","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-06T17:08:15.358038Z","title":"A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems","venue":null,"work_id":"8d10ecf4-53bb-48a9-83c4-a0ba4c8c955f","year":2002},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:12.208773Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:7363e1c12948907bba6018fd15f557ff5a66b8c36c30ea668124f7e126daf188","observation_id":"e3592dc7-9eb8-4087-9b49-c686a2811c96","resolution":{"observed_at":"2026-08-06T17:08:15.377461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:15.316263Z","title":"Optimal inapproximability results for MAX-CUT and other 2 -variable CSPs ? SIAM Journal on Computing , 37(1):319--357, 2007","venue":null,"work_id":"130dcec2-7d5a-4605-b480-c5269d235321","year":2007},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:12.364394Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:6b7293ed7f43d1ba5caa702a3999f1e55304ecc45bf6c46d1c7d84aea856a091","observation_id":"87cc648b-5783-44e0-a56b-655efc631928","resolution":{"observed_at":"2026-08-06T17:08:15.333255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:15.268148Z","title":"A comparison of the sherali-adams, lovász-schrijver, and lasserre relaxations for 0-1 programming","venue":null,"work_id":"501c3ab5-6e1a-4da3-a95a-1d332832498e","year":2003},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:12.620883Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:dfb74b3fe0bbbfef960ab318c4d5e10e9d3b77ac5e0f089fbd91f6b221499862","observation_id":"5c08194b-af3b-4fdb-99b2-98ee48b15c11","resolution":{"observed_at":"2026-08-06T17:08:15.293961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.05396","last_updated":"2024-02-21T22:25:01Z","snapshot_observed_at":"2026-08-05T09:03:11.851427Z","submitted_at":"2022-05-11T10:40:56Z","title":"A Survey on Fairness for Machine Learning on Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.05396","snapshot_observed_at":"2026-08-06T17:08:12.874371Z","title":"A survey on fairness for machine learning on graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:12.874371Z"},"links":{"cited_paper":"/paper/2205.05396","citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:86f0c341f3cf2e3bd146ed3f914cd20efc2ad6ca267482cd2bc293d2c3f0c11e","observation_id":"15ab9774-5494-4d1c-83b4-ce7a9da81120","resolution":{"observed_at":"2026-08-06T17:08:12.874371Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:08:13.106909Z","title":"Mirrokni, Viswanath Nagarajan, and Maxim Sviridenko","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:13.106909Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:7291e5ab9eb4da9ff59651d0f080289b0aeba40581a8ab3c154734e0c2d9a73d","observation_id":"090d07c9-f7ce-4cf8-94ff-81bfd7ee3b21","resolution":{"observed_at":"2026-08-06T17:08:13.106909Z","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-06T17:08:14.789406Z","title":"The lasserre hierarchy in approximation algorithms","venue":null,"work_id":"aa0e01f7-78e6-4fa7-a216-92c6ff4c7ce7","year":2013},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:13.297591Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:f1f3ac0c66b8ae5320655d72d08537daf6511ad8bc07ba0b72c53ee04b70cf81","observation_id":"732f3674-cfb5-450d-bb68-27fcfabab234","resolution":{"observed_at":"2026-08-06T17:08:15.054032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:14.440835Z","title":"Approximating CSPs with global cardinality constraints using SDP hierarchies","venue":null,"work_id":"1960abb9-af24-4536-86ef-701e79cffcf1","year":2012},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:13.415758Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:dac51b3236392bca7a034e2480e533613b61dcf4c8b63ca9c1ad762b961ea731","observation_id":"f0351de4-14b2-407c-8d6a-366ac76f18e8","resolution":{"observed_at":"2026-08-06T17:08:14.631761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:14.038832Z","title":"( k, n-k )-max-cut: An O ^ * (2^ p ) -time algorithm and a polynomial kernel","venue":null,"work_id":"011296e1-0492-4040-bfa2-84e3fd7cb05e","year":2018},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:13.471756Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:563243cc75168e9adcd255ab6f5192bc261c9468963da2883da71848dc8dbf03","observation_id":"32d5a534-54b5-43d4-9a98-75cde90a5bf7","resolution":{"observed_at":"2026-08-06T17:08:14.263088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T17:08:13.656408Z","title":"A .699 -approximation algorithm for max-bisection","venue":null,"work_id":"dd750765-77f0-4fb3-98f6-cd51f8bc25aa","year":2001},"citing_paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T17:08:13.544595Z"},"links":{"citing_paper":"/paper/2507.12607"},"observation_digest":"sha256:126e1fcce0020d6f7cf560b44266db8ba00338a0909b49bb2205cd1ffc4fa5df","observation_id":"0d2c65b3-8ecd-4611-b414-ca7028868b04","resolution":{"observed_at":"2026-08-06T17:08:13.833506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.12607","last_updated":"2025-07-16T19:54:48Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T16:41:02.307946Z","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":22},"total_outbound_references":25},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2507.12607."}