Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-12T12:54:19.352353Z
Paper Citation Record · LEDGER
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.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-12T12:54:19.352353Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+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
13 of 13 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation e64a8d8f-a809-4f86-b798-9e07c002bb0c · outbound
On the Complexity of Combinatorial Optimization on Fixed Structures Unresolved cited work
Reference 1
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.
Observation 832b7653-2ad4-4b7a-8d70-c32546e4000c · outbound
On the Complexity of Combinatorial Optimization on Fixed Structures Chv´ atal
Reference 2
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.
Observation 5d3c0581-1f7a-46ce-9111-6939fcbe283e · outbound
On the Complexity of Combinatorial Optimization on Fixed Structures Unresolved cited work
Reference 3
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.
Observation b8e270c6-12ff-4724-8457-16f8907db74f · outbound
On the Complexity of Combinatorial Optimization on Fixed Structures Unresolved cited work
Reference 4
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.
Observation 91d81098-4745-42e8-a224-181f8be94f87 · outbound
On the Complexity of Combinatorial Optimization on Fixed Structures Unresolved cited work
Reference 5
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.
Observation 22084d3a-d431-4ab9-94ed-ef56a85efff2 · outbound
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
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.
Observation 15d60d93-bb7c-4a9f-aa61-36408f4bbe6a · outbound
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
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.
Observation 8c02743f-4fcb-4b27-ade5-07474b026d51 · outbound
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
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.
Observation 345761d5-217b-403b-841b-92a7f4e377d5 · outbound
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
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.
Observation 62698cbb-4b4e-4496-8398-0252813abb99 · outbound
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
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.
Observation 2dde0046-f213-485e-bfff-b4c9bd4e1446 · outbound
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
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.
Observation 88450005-f629-4c16-ada8-1b6e22c4d712 · outbound
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
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.
Observation 6ffc1c56-86aa-4cdc-afb8-16d051fcac33 · outbound
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
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.
No inbound Pith citation observations are available.