Paper Citation Record · LEDGER

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers

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

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

pith.paper-citation-record.v1
2507.12748 v2

Coverage vector

measured 21 of 21 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T16:58:55.946706Z

measured 21 of 21 standing notices

One-hop event checks from named stored sources.

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

21 of 21 outbound references displayed

verified exact2
verified fuzzy17
unresolved2
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 692d94f0-9b91-4b39-b126-2574ae3cf9a9 · outbound

This paper cites Covering and packing in graphs IV: Linear arboricity.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers Covering and packing in graphs IV: Linear arboricity

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:59:01.073240Z

Source-reported events for the cited work

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

Observation 8ed33c25-345f-443d-b0ae-46b0faf87e66 · outbound

This paper cites Path decompositions of digraphs.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers Path decompositions of digraphs

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:59:00.827434Z

Source-reported events for the cited work

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

Observation 407c6898-7813-41c7-aaa7-775fefafeb91 · outbound

This paper cites University of Chicago, 1988.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers University of Chicago, 1988

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:59:00.586200Z

Source-reported events for the cited work

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

Observation 001c390e-8b18-41e3-892b-199be360c96e · outbound

This paper cites On the assignment polytope.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers On the assignment polytope

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:59:00.271802Z

Source-reported events for the cited work

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

Observation e3b000b8-3787-4ab1-a9f5-d34ec451c451 · outbound

This paper cites A proof of a conjecture of bondy concerning paths in weighted digraphs.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers A proof of a conjecture of bondy concerning paths in weighted digraphs

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:58:59.969680Z

Source-reported events for the cited work

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

Observation 6f672ba3-5239-4b41-a88a-d7494cf905eb · outbound

This paper cites On the diameter of partition polytopes and vertex-disjoint cycle cover.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers On the diameter of partition polytopes and vertex-disjoint cycle cover

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:58:59.669536Z

Source-reported events for the cited work

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

Observation 17af7afd-d030-4e1a-a6c1-cc9cbf91d547 · outbound

This paper cites Path Odd-Covers of Graphs.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers Path Odd-Covers of Graphs

Reference 7

Resolution: verified exact; local_arxiv, observed 2026-08-06T16:58:56.448362Z

Source-reported events for the cited work

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

Observation c9691f75-495c-4695-b116-b0fb683add3c · outbound

This paper cites The diameters of network-flow polytopes satisfy the Hirsch conjecture.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers The diameters of network-flow polytopes satisfy the Hirsch conjecture

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:58:59.385423Z

Source-reported events for the cited work

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

Observation 756ed3ec-680a-4e66-855c-5c68bbbf46e8 · outbound

This paper cites Constructing Clustering Transformations.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers Constructing Clustering Transformations

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:58:59.152294Z

Source-reported events for the cited work

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

Observation 744652f1-f966-4ba9-b318-72a0bdb28944 · outbound

This paper cites On odd covers of cliques and disjoint unions.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers On odd covers of cliques and disjoint unions

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-06T16:58:54.716532Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3a7f4bf8-b914-4c06-88d9-8d77999554d3 · outbound

This paper cites Odd covers of graphs.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers Odd covers of graphs

Reference 11

Resolution: verified exact; doi, observed 2026-08-06T16:58:56.201360Z

Source-reported events for the cited work

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

Observation 4219043f-6751-4c71-896f-fbcaa8f6d1b3 · outbound

This paper cites On the coverings of graphs.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers On the coverings of graphs

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:58:58.926681Z

Source-reported events for the cited work

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

Observation 5df7ab86-ba1c-419b-8372-fd5f9f583ce3 · outbound

This paper cites On some of my conjectures in number theory and combinatorics.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers On some of my conjectures in number theory and combinatorics

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:58:58.618465Z

Source-reported events for the cited work

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

Observation c77c09c1-0223-424b-9b4d-d08cd1dc95a4 · outbound

This paper cites Covers of Eulerian graphs.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers Covers of Eulerian graphs

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:58:58.302045Z

Source-reported events for the cited work

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

Observation 622e2e39-8eea-45a5-b2c9-2355c02b626d · outbound

This paper cites On the addressing problem for loop switching.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers On the addressing problem for loop switching

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:58:57.992233Z

Source-reported events for the cited work

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

Observation 05e0d60c-d407-4ee9-b68e-8be813f20f15 · outbound

This paper cites On embedding graphs in squashed cubes.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers On embedding graphs in squashed cubes

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:58:57.733533Z

Source-reported events for the cited work

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

Observation 4a3d3f05-9b68-4ae8-8a6e-83a3b1043921 · outbound

This paper cites Facets and vertices of transportation polyhedra.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers Facets and vertices of transportation polyhedra

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:58:57.465958Z

Source-reported events for the cited work

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

Observation f3bfbc90-442b-4fe4-9627-07b65ee9ae76 · outbound

This paper cites Odd Covers of Complete Graphs and Hypergraphs.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers Odd Covers of Complete Graphs and Hypergraphs

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-06T16:58:55.564015Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ffb3376-a90c-4458-8c59-1920cfe3b55b · outbound

This paper cites On covering of graphs.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers On covering of graphs

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:58:57.188018Z

Source-reported events for the cited work

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

Observation 99c08e1c-2874-456e-8c66-c4ee5a387f3e · outbound

This paper cites Linear arboricity of digraphs.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers Linear arboricity of digraphs

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:58:56.932042Z

Source-reported events for the cited work

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

Observation e1ae43de-40b1-4ed9-9212-47bf8bafc6f7 · outbound

This paper cites Die Theorie der regul¨ aren Graphs.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers Die Theorie der regul¨ aren Graphs

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:58:56.644795Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.