{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3RIPXWB577TNYHEK2BRI7MUWBT","short_pith_number":"pith:3RIPXWB5","canonical_record":{"source":{"id":"1312.1678","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-05T20:55:26Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"05b23e1584e968d9ac18abbccae44de93797026193f1a95abd32db78e9873264","abstract_canon_sha256":"4f6abf83327349140cc0dc79f8450f88b2455c320cfe52875f564cb47b3e6f30"},"schema_version":"1.0"},"canonical_sha256":"dc50fbd83dffe6dc1c8ad0628fb2960ce7dd809546fe694c37c72ce3aa057eed","source":{"kind":"arxiv","id":"1312.1678","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1678","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1678v3","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1678","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"3RIPXWB577TN","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3RIPXWB577TNYHEK","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3RIPXWB5","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3RIPXWB577TNYHEK2BRI7MUWBT","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1678","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-05T20:55:26Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"05b23e1584e968d9ac18abbccae44de93797026193f1a95abd32db78e9873264","abstract_canon_sha256":"4f6abf83327349140cc0dc79f8450f88b2455c320cfe52875f564cb47b3e6f30"},"schema_version":"1.0"},"canonical_sha256":"dc50fbd83dffe6dc1c8ad0628fb2960ce7dd809546fe694c37c72ce3aa057eed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:48.528027Z","signature_b64":"I+fMqT/E+KD75bKXO5QclmGqWFdFB+Y2y86zhr6O0VP/8AeOHUOF1ONJFnnpoJnHIlsLWI19wRJOiPTZjelKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc50fbd83dffe6dc1c8ad0628fb2960ce7dd809546fe694c37c72ce3aa057eed","last_reissued_at":"2026-05-18T02:39:48.527561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:48.527561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1678","source_version":3,"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-18T02:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dFKCEUQnwydFE1+8Ya8a/HmslqAwSXdK8rBuFhIzjFQIz39UCjNVFEUm/W+MAOKFNT7AlU7CsqSjMynfdYD8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:24:23.783135Z"},"content_sha256":"d54e6a5ef83e380297057ba3b1d80bfca2fd58c45bc64522218c6675e980e93c","schema_version":"1.0","event_id":"sha256:d54e6a5ef83e380297057ba3b1d80bfca2fd58c45bc64522218c6675e980e93c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3RIPXWB577TNYHEK2BRI7MUWBT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Note on the number of edges in families with linear union-complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Piotr Micek, Rom Pinchasi","submitted_at":"2013-12-05T20:55:26Z","abstract_excerpt":"We give a simple argument showing that the number of edges in the intersection graph $G$ of a family of $n$ sets in the plane with a linear union-complexity is $O(\\omega(G)n)$. In particular, we prove $\\chi(G)\\leq \\text{col}(G)< 19\\omega(G)$ for intersection graph $G$ of a family of pseudo-discs, which improves a previous bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1678","kind":"arxiv","version":3},"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-18T02:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m9hNkS6Dy4uAR5/ObEK8F5Z3v2daWe/Aw4o6bwT7Jx+l1ba6gCgN1ecX3tC8F+wWH8R0zLX0imVgDLRO3BaWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:24:23.783499Z"},"content_sha256":"5ed87fa4f3e0cf692bb91ec41e44e4d62dae63fe6ddce754a3bb6d1ed7879579","schema_version":"1.0","event_id":"sha256:5ed87fa4f3e0cf692bb91ec41e44e4d62dae63fe6ddce754a3bb6d1ed7879579"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RIPXWB577TNYHEK2BRI7MUWBT/bundle.json","state_url":"https://pith.science/pith/3RIPXWB577TNYHEK2BRI7MUWBT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RIPXWB577TNYHEK2BRI7MUWBT/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-05T09:24:23Z","links":{"resolver":"https://pith.science/pith/3RIPXWB577TNYHEK2BRI7MUWBT","bundle":"https://pith.science/pith/3RIPXWB577TNYHEK2BRI7MUWBT/bundle.json","state":"https://pith.science/pith/3RIPXWB577TNYHEK2BRI7MUWBT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RIPXWB577TNYHEK2BRI7MUWBT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3RIPXWB577TNYHEK2BRI7MUWBT","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":"4f6abf83327349140cc0dc79f8450f88b2455c320cfe52875f564cb47b3e6f30","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-05T20:55:26Z","title_canon_sha256":"05b23e1584e968d9ac18abbccae44de93797026193f1a95abd32db78e9873264"},"schema_version":"1.0","source":{"id":"1312.1678","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1678","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1678v3","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1678","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"3RIPXWB577TN","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3RIPXWB577TNYHEK","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3RIPXWB5","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:5ed87fa4f3e0cf692bb91ec41e44e4d62dae63fe6ddce754a3bb6d1ed7879579","target":"graph","created_at":"2026-05-18T02:39:48Z","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":"We give a simple argument showing that the number of edges in the intersection graph $G$ of a family of $n$ sets in the plane with a linear union-complexity is $O(\\omega(G)n)$. In particular, we prove $\\chi(G)\\leq \\text{col}(G)< 19\\omega(G)$ for intersection graph $G$ of a family of pseudo-discs, which improves a previous bound.","authors_text":"Piotr Micek, Rom Pinchasi","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-05T20:55:26Z","title":"Note on the number of edges in families with linear union-complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1678","kind":"arxiv","version":3},"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:d54e6a5ef83e380297057ba3b1d80bfca2fd58c45bc64522218c6675e980e93c","target":"record","created_at":"2026-05-18T02:39:48Z","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":"4f6abf83327349140cc0dc79f8450f88b2455c320cfe52875f564cb47b3e6f30","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-05T20:55:26Z","title_canon_sha256":"05b23e1584e968d9ac18abbccae44de93797026193f1a95abd32db78e9873264"},"schema_version":"1.0","source":{"id":"1312.1678","kind":"arxiv","version":3}},"canonical_sha256":"dc50fbd83dffe6dc1c8ad0628fb2960ce7dd809546fe694c37c72ce3aa057eed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc50fbd83dffe6dc1c8ad0628fb2960ce7dd809546fe694c37c72ce3aa057eed","first_computed_at":"2026-05-18T02:39:48.527561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:48.527561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I+fMqT/E+KD75bKXO5QclmGqWFdFB+Y2y86zhr6O0VP/8AeOHUOF1ONJFnnpoJnHIlsLWI19wRJOiPTZjelKBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:48.528027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1678","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d54e6a5ef83e380297057ba3b1d80bfca2fd58c45bc64522218c6675e980e93c","sha256:5ed87fa4f3e0cf692bb91ec41e44e4d62dae63fe6ddce754a3bb6d1ed7879579"],"state_sha256":"b162bc59e1f8824c9953a0b963d85762f3755811f1aada1bed024face5d8985c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zxZ4wCO73DOhwGozC1c0jLbYg7xYW2kU0UmqjWH7CTY2OhX7O/deOLaBVlWXDby6Q7dPJRgnC72QSCjBo0NiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:24:23.785298Z","bundle_sha256":"1fc71c0ec6cb5bc46af0d2f3c31119287cdf2d5c35b83557f475e18c81152bed"}}