Pith. sign in

Paper Citation Record · LEDGER

On the Complexity of Combinatorial Optimization on Fixed Structures

As of 12 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-12T06:34:41.77262+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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-12T12:54:19.312044Z digest=sha256:0c5b77c88b90f6d3f0403f033a3af6de629c88645f29b9feb44e173dfe4a1560

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-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-12T12:54:19.316738Z digest=sha256:00b755b51f06c4044af65e10a517e2ef104ef95d1f9691947e7d1b865b3360b6

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-12T12:54:19.327066Z digest=sha256:85abb8faaf4f8fc638305058ceea8cbf6a09901e3e87aaeecc59405c9fe2401c

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-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-12T12:54:19.331950Z digest=sha256:2d520949ed2bee08b16271d03ad053040ea6512230f011583ae9286498a30f7d

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-12T06:34:41.77262+00:00.

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

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-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-12T12:54:19.341848Z digest=sha256:1fc5a3cca15f26b09fd10b9fe475832ff4db7834e5e672ab8c48d975700b6e6f

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-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-12T12:54:19.346716Z digest=sha256:792ed16743f972559add4749d769da89ea5421cc61db1396d9d4dd8fad2f9dd0

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-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-12T12:54:19.352353Z digest=sha256:8b0bb5cb61d32bf4472082842951bb577b6b4a649bd3e01e1465d73cf77e6110

Pith citing papers

No inbound Pith citation observations are available.