{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:O5LH6BXVKSDYIOJDNMAXRWFDLS","short_pith_number":"pith:O5LH6BXV","canonical_record":{"source":{"id":"1006.3692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-18T13:38:56Z","cross_cats_sorted":[],"title_canon_sha256":"3520409aa57af4992227da55c26e5030ab1a9b7e4284b32e22fc9484f88adcd6","abstract_canon_sha256":"cdc61a700d7ff4dcf84a051ab603095751ed565dba67a8cfc5f6d6b3b1c6bce8"},"schema_version":"1.0"},"canonical_sha256":"77567f06f554878439236b0178d8a35ca762424d08189de89cebb70f78e18262","source":{"kind":"arxiv","id":"1006.3692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.3692","created_at":"2026-05-18T04:28:45Z"},{"alias_kind":"arxiv_version","alias_value":"1006.3692v1","created_at":"2026-05-18T04:28:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3692","created_at":"2026-05-18T04:28:45Z"},{"alias_kind":"pith_short_12","alias_value":"O5LH6BXVKSDY","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O5LH6BXVKSDYIOJD","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O5LH6BXV","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:O5LH6BXVKSDYIOJDNMAXRWFDLS","target":"record","payload":{"canonical_record":{"source":{"id":"1006.3692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-18T13:38:56Z","cross_cats_sorted":[],"title_canon_sha256":"3520409aa57af4992227da55c26e5030ab1a9b7e4284b32e22fc9484f88adcd6","abstract_canon_sha256":"cdc61a700d7ff4dcf84a051ab603095751ed565dba67a8cfc5f6d6b3b1c6bce8"},"schema_version":"1.0"},"canonical_sha256":"77567f06f554878439236b0178d8a35ca762424d08189de89cebb70f78e18262","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:45.606957Z","signature_b64":"tEpGSHpzunKNFdEO+AIAQV95q0Bd9hE2DGK5SUNESoRPPP5HGQy5r22Alh9MQbwfQZV24hod6gFu//fZeG/IBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77567f06f554878439236b0178d8a35ca762424d08189de89cebb70f78e18262","last_reissued_at":"2026-05-18T04:28:45.606291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:45.606291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.3692","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-18T04:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jZ5zZmn3D9Tnk9ESbaZMPDCWhPLz+/pRoF/5NIA8KkWaOoEXWuL8hQyiZEhZfef9nesZH0kyKiLu3gUNJscaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:37:27.494775Z"},"content_sha256":"ad767e84b6e97eb9e187e0faf97dd7ad985c3387a7c188888d4d35024966750a","schema_version":"1.0","event_id":"sha256:ad767e84b6e97eb9e187e0faf97dd7ad985c3387a7c188888d4d35024966750a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:O5LH6BXVKSDYIOJDNMAXRWFDLS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Covering line graphs with equivalence relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. King, J. Gimbel, L. Esperet","submitted_at":"2010-06-18T13:38:56Z","abstract_excerpt":"An equivalence graph is a disjoint union of cliques, and the equivalence number $\\mathit{eq}(G)$ of a graph $G$ is the minimum number of equivalence subgraphs needed to cover the edges of $G$. We consider the equivalence number of a line graph, giving improved upper and lower bounds: $\\frac 13 \\log_2\\log_2 \\chi(G) < \\mathit{eq}(L(G)) \\leq 2\\log_2\\log_2 \\chi(G) + 2$. This disproves a recent conjecture that $\\mathit{eq}(L(G))$ is at most three for triangle-free $G$; indeed it can be arbitrarily large.\n  To bound $\\mathit{eq}(L(G))$ we bound the closely-related invariant $\\sigma(G)$, which is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3692","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-18T04:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSbE4F9uBISMbLof+SjFsMMkeNbIOAOx+g4G2mcHlE6CwBUrNJYPkhICg8R9KSPXOfDB5liX66Ng+ZdXomHgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:37:27.495553Z"},"content_sha256":"e45e8258f25626cb88f96f372ec2cc217923e7d19d23a78e867fbd2d507980b7","schema_version":"1.0","event_id":"sha256:e45e8258f25626cb88f96f372ec2cc217923e7d19d23a78e867fbd2d507980b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5LH6BXVKSDYIOJDNMAXRWFDLS/bundle.json","state_url":"https://pith.science/pith/O5LH6BXVKSDYIOJDNMAXRWFDLS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5LH6BXVKSDYIOJDNMAXRWFDLS/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-06-11T17:37:27Z","links":{"resolver":"https://pith.science/pith/O5LH6BXVKSDYIOJDNMAXRWFDLS","bundle":"https://pith.science/pith/O5LH6BXVKSDYIOJDNMAXRWFDLS/bundle.json","state":"https://pith.science/pith/O5LH6BXVKSDYIOJDNMAXRWFDLS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5LH6BXVKSDYIOJDNMAXRWFDLS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:O5LH6BXVKSDYIOJDNMAXRWFDLS","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":"cdc61a700d7ff4dcf84a051ab603095751ed565dba67a8cfc5f6d6b3b1c6bce8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-18T13:38:56Z","title_canon_sha256":"3520409aa57af4992227da55c26e5030ab1a9b7e4284b32e22fc9484f88adcd6"},"schema_version":"1.0","source":{"id":"1006.3692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.3692","created_at":"2026-05-18T04:28:45Z"},{"alias_kind":"arxiv_version","alias_value":"1006.3692v1","created_at":"2026-05-18T04:28:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3692","created_at":"2026-05-18T04:28:45Z"},{"alias_kind":"pith_short_12","alias_value":"O5LH6BXVKSDY","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O5LH6BXVKSDYIOJD","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O5LH6BXV","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:e45e8258f25626cb88f96f372ec2cc217923e7d19d23a78e867fbd2d507980b7","target":"graph","created_at":"2026-05-18T04:28:45Z","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":"An equivalence graph is a disjoint union of cliques, and the equivalence number $\\mathit{eq}(G)$ of a graph $G$ is the minimum number of equivalence subgraphs needed to cover the edges of $G$. We consider the equivalence number of a line graph, giving improved upper and lower bounds: $\\frac 13 \\log_2\\log_2 \\chi(G) < \\mathit{eq}(L(G)) \\leq 2\\log_2\\log_2 \\chi(G) + 2$. This disproves a recent conjecture that $\\mathit{eq}(L(G))$ is at most three for triangle-free $G$; indeed it can be arbitrarily large.\n  To bound $\\mathit{eq}(L(G))$ we bound the closely-related invariant $\\sigma(G)$, which is the","authors_text":"A. King, J. Gimbel, L. Esperet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-18T13:38:56Z","title":"Covering line graphs with equivalence relations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3692","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:ad767e84b6e97eb9e187e0faf97dd7ad985c3387a7c188888d4d35024966750a","target":"record","created_at":"2026-05-18T04:28:45Z","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":"cdc61a700d7ff4dcf84a051ab603095751ed565dba67a8cfc5f6d6b3b1c6bce8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-18T13:38:56Z","title_canon_sha256":"3520409aa57af4992227da55c26e5030ab1a9b7e4284b32e22fc9484f88adcd6"},"schema_version":"1.0","source":{"id":"1006.3692","kind":"arxiv","version":1}},"canonical_sha256":"77567f06f554878439236b0178d8a35ca762424d08189de89cebb70f78e18262","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77567f06f554878439236b0178d8a35ca762424d08189de89cebb70f78e18262","first_computed_at":"2026-05-18T04:28:45.606291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:45.606291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tEpGSHpzunKNFdEO+AIAQV95q0Bd9hE2DGK5SUNESoRPPP5HGQy5r22Alh9MQbwfQZV24hod6gFu//fZeG/IBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:45.606957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.3692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad767e84b6e97eb9e187e0faf97dd7ad985c3387a7c188888d4d35024966750a","sha256:e45e8258f25626cb88f96f372ec2cc217923e7d19d23a78e867fbd2d507980b7"],"state_sha256":"c2067918cf72b4676aecc20dcead38e460b5bfb11df26e5f6c841c9d83d6b374"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aCwIWO3r2JHLGbgBE1R8iVvOO+2B0DkA+VqH+Mekl4akIDdJOuL7KJIeBCTg9Wmaz2qHhaa7ToDMo7XGU0ckBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:37:27.499307Z","bundle_sha256":"28cb3a8671c19c7357a076a67d8ce40d35fb6c5f68c254815ac3ef96f169dffe"}}