Pith. sign in

Paper Citation Record · LEDGER

On the Complexity of Combinatorial Optimization on Fixed Structures

As of 19 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2411.16963.

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

pith.paper-citation-record.v1
2411.16963 v1

Coverage vector

measured 13 of 13 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T12:54:19.352353Z

measured 13 of 13 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+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

13 of 13 outbound references displayed

  • verified exact0
  • verified fuzzy9
  • unresolved4
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e64a8d8f-a809-4f86-b798-9e07c002bb0c · outbound

This paper cites an unresolved cited work.

On the Complexity of Combinatorial Optimization on Fixed Structures Unresolved cited work

Reference 1

Resolution
unresolved
raw_fallback, observed 2026-08-12T12:54:19.578070Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-12T12:54:19.292131Z digest=sha256:b0988e006e85369f076ef4747ed68a848fcd233ef59dacd0ef2ba1e3883e59d9

Observation 832b7653-2ad4-4b7a-8d70-c32546e4000c · outbound

This paper cites Chv´ atal.

On the Complexity of Combinatorial Optimization on Fixed Structures Chv´ atal

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T12:54:19.563152Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-12T12:54:19.298077Z digest=sha256:f1bf242b0052115d135e39304811dbe2166cb8e53d4454c82e462137722bc074

Observation 5d3c0581-1f7a-46ce-9111-6939fcbe283e · outbound

This paper cites an unresolved cited work.

On the Complexity of Combinatorial Optimization on Fixed Structures Unresolved cited work

Reference 3

Resolution
unresolved
raw_fallback, observed 2026-08-12T12:54:19.548645Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-12T12:54:19.302680Z digest=sha256:f548a36071e8626408d4146999a5ef858bc0c9fec4042eb5e7aee0218337ee68

Observation b8e270c6-12ff-4724-8457-16f8907db74f · outbound

This paper cites an unresolved cited work.

On the Complexity of Combinatorial Optimization on Fixed Structures Unresolved cited work

Reference 4

Resolution
unresolved
raw_fallback, observed 2026-08-12T12:54:19.533662Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-12T12:54:19.307221Z digest=sha256:baed4829abf7908932f088535e5f97b219c7cc33b1071a9f01fbc0e6fd65eb09

Observation 91d81098-4745-42e8-a224-181f8be94f87 · outbound

This paper cites an unresolved cited work.

On the Complexity of Combinatorial Optimization on Fixed Structures Unresolved cited work

Reference 5

Resolution
unresolved
raw_fallback, observed 2026-08-12T12:54:19.517946Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-12T12:54:19.312044Z digest=sha256:8c031cb89931a99f84e6e85388adb8aa032d830d6567616432253ebbfaf22e43

Observation 22084d3a-d431-4ab9-94ed-ef56a85efff2 · outbound

This paper cites Wikipedia article retrieved October 27, 2024, https://en.wikipedia.org/wiki/Boolean satisfiability problem#Exactly-1 3-satisfiability.

On the Complexity of Combinatorial Optimization on Fixed Structures Wikipedia article retrieved October 27, 2024, https://en.wikipedia.org/wiki/Boolean satisfiability problem#Exactly-1 3-satisfiability

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T12:54:19.502769Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-12T12:54:19.316738Z digest=sha256:8359afbbd71bf26988ba387731995d5b2957c8b080f13d6a453a601ce6bb0738

Observation 15d60d93-bb7c-4a9f-aa61-36408f4bbe6a · outbound

This paper cites The system reduces to a + b = 1 b + c = 1 c + d = 0 (26) and the solution is ( a, b, c, d) = (0, 1, 0, 0).

On the Complexity of Combinatorial Optimization on Fixed Structures The system reduces to a + b = 1 b + c = 1 c + d = 0 (26) and the solution is ( a, b, c, d) = (0, 1, 0, 0)

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T12:54:19.485467Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-12T12:54:19.322215Z digest=sha256:ab7aa69904a27918551ead129a44b8808cb88265f07e0ccbaed5229bf56f28f2

Observation 8c02743f-4fcb-4b27-ade5-07474b026d51 · outbound

This paper cites The system reduces to a + b = 0 b + c = 0 c + d = 0 (27) and the solution is ( a, b, c, d) = (0, 0, 0, 0).

On the Complexity of Combinatorial Optimization on Fixed Structures The system reduces to a + b = 0 b + c = 0 c + d = 0 (27) and the solution is ( a, b, c, d) = (0, 0, 0, 0)

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T12:54:19.469267Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-12T12:54:19.327066Z digest=sha256:4640f49affeb090846d9ea42e7bd705b495f843cb2164ab4a284cd07e977b6e4

Observation 345761d5-217b-403b-841b-92a7f4e377d5 · outbound

This paper cites a + b = 0 b + c = 1 c + d = 1 (28) and the solution is ( a, b, c, d) = (0, 0, 1, 0).

On the Complexity of Combinatorial Optimization on Fixed Structures a + b = 0 b + c = 1 c + d = 1 (28) and the solution is ( a, b, c, d) = (0, 0, 1, 0)

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T12:54:19.452231Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-12T12:54:19.331950Z digest=sha256:097188730a5887d822b86f62958b4c09a595cf0bf73fbfe7ed1b57b9e0544269

Observation 62698cbb-4b4e-4496-8398-0252813abb99 · outbound

This paper cites The system reduces to a + b = 1 b + c = 0 c + d = 0 (29) and the solution is ( a, b, c, d) = (1, 0, 0, 0).

On the Complexity of Combinatorial Optimization on Fixed Structures The system reduces to a + b = 1 b + c = 0 c + d = 0 (29) and the solution is ( a, b, c, d) = (1, 0, 0, 0)

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T12:54:19.436631Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-12T12:54:19.337080Z digest=sha256:f4f731635a0e6144eb700fa0584949fcb93bcf1b37c3cc8a4cea43a29320e6c7

Observation 2dde0046-f213-485e-bfff-b4c9bd4e1446 · outbound

This paper cites The system reduces to a + b = 1 b + c = 1 c + d = 1 (30) and the solutions are ( a, b, c, d) = (1, 0, 1, 0) and ( a, b, c, d) = (0, 1, 0, 1).

On the Complexity of Combinatorial Optimization on Fixed Structures The system reduces to a + b = 1 b + c = 1 c + d = 1 (30) and the solutions are ( a, b, c, d) = (1, 0, 1, 0) and ( a, b, c, d) = (0, 1, 0, 1)

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T12:54:19.421131Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-12T12:54:19.341848Z digest=sha256:7d91dfdc3b8b6947426c9b32e2fa80c481ea33a4a54842d85d17fed2860cf828

Observation 88450005-f629-4c16-ada8-1b6e22c4d712 · outbound

This paper cites The system reduces to a + b = 0 b + c = 0 c + d = 1 (31) and the solution is ( a, b, c, d) = (0, 0, 0, 1).

On the Complexity of Combinatorial Optimization on Fixed Structures The system reduces to a + b = 0 b + c = 0 c + d = 1 (31) and the solution is ( a, b, c, d) = (0, 0, 0, 1)

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T12:54:19.406018Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-12T12:54:19.346716Z digest=sha256:5d967c0f6d72e23b8945f5d44096ee2826f0f4afd3ebe657d8eeb9bf69e453c6

Observation 6ffc1c56-86aa-4cdc-afb8-16d051fcac33 · outbound

This paper cites The system reduces to a + b = 1 b + c = 0 c + d = 1 (32) and the solution is ( a, b, c, d) = (1, 0, 0, 1).

On the Complexity of Combinatorial Optimization on Fixed Structures The system reduces to a + b = 1 b + c = 0 c + d = 1 (32) and the solution is ( a, b, c, d) = (1, 0, 0, 1)

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T12:54:19.389243Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-12T12:54:19.352353Z digest=sha256:9efd9a8f73d00ac6a6c7493785b21338c8937df4b696c8f41d0cd66397a0545a

Pith citing papers

No inbound Pith citation observations are available.