{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CXBBEJ7I6D7H44CP7H2FVRIA3E","short_pith_number":"pith:CXBBEJ7I","canonical_record":{"source":{"id":"1612.08347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-26T09:15:59Z","cross_cats_sorted":[],"title_canon_sha256":"80e87a4b77a2aefdfad52f005f35c4eb1f072f6c75183b3422c22459bb57cbfa","abstract_canon_sha256":"9940b16e54f78c1a22a8fd965e81baf584e2afe190dc1dd5019fbc0b05536c69"},"schema_version":"1.0"},"canonical_sha256":"15c21227e8f0fe7e704ff9f45ac500d9374cd7baf3d1b7a40af7edde71339602","source":{"kind":"arxiv","id":"1612.08347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08347","created_at":"2026-05-18T00:53:56Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08347v1","created_at":"2026-05-18T00:53:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08347","created_at":"2026-05-18T00:53:56Z"},{"alias_kind":"pith_short_12","alias_value":"CXBBEJ7I6D7H","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CXBBEJ7I6D7H44CP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CXBBEJ7I","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CXBBEJ7I6D7H44CP7H2FVRIA3E","target":"record","payload":{"canonical_record":{"source":{"id":"1612.08347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-26T09:15:59Z","cross_cats_sorted":[],"title_canon_sha256":"80e87a4b77a2aefdfad52f005f35c4eb1f072f6c75183b3422c22459bb57cbfa","abstract_canon_sha256":"9940b16e54f78c1a22a8fd965e81baf584e2afe190dc1dd5019fbc0b05536c69"},"schema_version":"1.0"},"canonical_sha256":"15c21227e8f0fe7e704ff9f45ac500d9374cd7baf3d1b7a40af7edde71339602","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:56.886086Z","signature_b64":"blEXRnNCDPUnf+usnRaZhH2YpMOMBTpIwY7p1fwcXCwEzRS7tO5GZ9kyDNZ1i5p7EAc5fO8OXT8R96uJWvl2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15c21227e8f0fe7e704ff9f45ac500d9374cd7baf3d1b7a40af7edde71339602","last_reissued_at":"2026-05-18T00:53:56.885631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:56.885631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.08347","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:53:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5P5XdqZO9E7cYCofkkE9eZIxulXdi5yfl+9R5eSDWdgWgJ8X72PzEgNLIAHtCVwVYtVTvFOEKkFPFR0Flpr8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:15:12.210823Z"},"content_sha256":"7fbd1f19abcc2c121b272a5121b299b7db6534113c63d8da116d590c3316b1c2","schema_version":"1.0","event_id":"sha256:7fbd1f19abcc2c121b272a5121b299b7db6534113c63d8da116d590c3316b1c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CXBBEJ7I6D7H44CP7H2FVRIA3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Track number of line graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deepak Rajendraprasad","submitted_at":"2016-12-26T09:15:59Z","abstract_excerpt":"The track number $\\tau(G)$ of a graph $G$ is the minimum number of interval graphs whose union is $G$. We show that the track number of the line graph $L(G)$ of a triangle-free graph $G$ is at least $\\lg \\lg \\chi(G) + 1$, where $\\chi(G)$ is the chromatic number of $G$. Using this lower bound and two classical Ramsey-theoretic results from literature, we answer two questions posed by Milans, Stolee, and West [J. Combinatorics, 2015] (MSW15). First we show that the track number $\\tau(L(K_n))$ of the line graph of the complete graphs $K_n$ is at least $\\lg\\lg n - o(1)$. This is asymptotically tig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08347","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:53:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S1/8zjiF3TwN9qXzXK/oMmji3tgf43EtLq5wuIwm1jITw2HYZuGizPQnHbEq/65L7PWvjuahDNbKk5LF7/PVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:15:12.211157Z"},"content_sha256":"c5e1095d9b00339b906b11406a2a2a62078e9e2f9488178c09846e68c133fec0","schema_version":"1.0","event_id":"sha256:c5e1095d9b00339b906b11406a2a2a62078e9e2f9488178c09846e68c133fec0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CXBBEJ7I6D7H44CP7H2FVRIA3E/bundle.json","state_url":"https://pith.science/pith/CXBBEJ7I6D7H44CP7H2FVRIA3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CXBBEJ7I6D7H44CP7H2FVRIA3E/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T08:15:12Z","links":{"resolver":"https://pith.science/pith/CXBBEJ7I6D7H44CP7H2FVRIA3E","bundle":"https://pith.science/pith/CXBBEJ7I6D7H44CP7H2FVRIA3E/bundle.json","state":"https://pith.science/pith/CXBBEJ7I6D7H44CP7H2FVRIA3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CXBBEJ7I6D7H44CP7H2FVRIA3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CXBBEJ7I6D7H44CP7H2FVRIA3E","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9940b16e54f78c1a22a8fd965e81baf584e2afe190dc1dd5019fbc0b05536c69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-26T09:15:59Z","title_canon_sha256":"80e87a4b77a2aefdfad52f005f35c4eb1f072f6c75183b3422c22459bb57cbfa"},"schema_version":"1.0","source":{"id":"1612.08347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08347","created_at":"2026-05-18T00:53:56Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08347v1","created_at":"2026-05-18T00:53:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08347","created_at":"2026-05-18T00:53:56Z"},{"alias_kind":"pith_short_12","alias_value":"CXBBEJ7I6D7H","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CXBBEJ7I6D7H44CP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CXBBEJ7I","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:c5e1095d9b00339b906b11406a2a2a62078e9e2f9488178c09846e68c133fec0","target":"graph","created_at":"2026-05-18T00:53:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The track number $\\tau(G)$ of a graph $G$ is the minimum number of interval graphs whose union is $G$. We show that the track number of the line graph $L(G)$ of a triangle-free graph $G$ is at least $\\lg \\lg \\chi(G) + 1$, where $\\chi(G)$ is the chromatic number of $G$. Using this lower bound and two classical Ramsey-theoretic results from literature, we answer two questions posed by Milans, Stolee, and West [J. Combinatorics, 2015] (MSW15). First we show that the track number $\\tau(L(K_n))$ of the line graph of the complete graphs $K_n$ is at least $\\lg\\lg n - o(1)$. This is asymptotically tig","authors_text":"Deepak Rajendraprasad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-26T09:15:59Z","title":"Track number of line graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08347","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7fbd1f19abcc2c121b272a5121b299b7db6534113c63d8da116d590c3316b1c2","target":"record","created_at":"2026-05-18T00:53:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9940b16e54f78c1a22a8fd965e81baf584e2afe190dc1dd5019fbc0b05536c69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-26T09:15:59Z","title_canon_sha256":"80e87a4b77a2aefdfad52f005f35c4eb1f072f6c75183b3422c22459bb57cbfa"},"schema_version":"1.0","source":{"id":"1612.08347","kind":"arxiv","version":1}},"canonical_sha256":"15c21227e8f0fe7e704ff9f45ac500d9374cd7baf3d1b7a40af7edde71339602","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15c21227e8f0fe7e704ff9f45ac500d9374cd7baf3d1b7a40af7edde71339602","first_computed_at":"2026-05-18T00:53:56.885631Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:56.885631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"blEXRnNCDPUnf+usnRaZhH2YpMOMBTpIwY7p1fwcXCwEzRS7tO5GZ9kyDNZ1i5p7EAc5fO8OXT8R96uJWvl2AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:56.886086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fbd1f19abcc2c121b272a5121b299b7db6534113c63d8da116d590c3316b1c2","sha256:c5e1095d9b00339b906b11406a2a2a62078e9e2f9488178c09846e68c133fec0"],"state_sha256":"747e5670ee0ecbc2c8f01a580da7a7d914f3d8fb336fda56a53de6cffc755efb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3gTk7S9hpWNEqsNbYqQ/6E3cWmQEbJqEKjKXMP2PwZpI+8t1NY7tRL3PQxM0PVCar3gxfIi8OuvII7POA+pAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T08:15:12.212974Z","bundle_sha256":"6574ee8f2970741cbe82cbaa23517c24e67bd421a7ff2a9a49696c8c70b86ff9"}}