{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WXD5B6WL35CAUJTFVN2BVRTSP5","short_pith_number":"pith:WXD5B6WL","canonical_record":{"source":{"id":"1102.0874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-04T10:58:50Z","cross_cats_sorted":[],"title_canon_sha256":"88123de91d05a7c7c58cf70252b74b53442f0e2f56d69ee68acf9aeddbb65e43","abstract_canon_sha256":"3012b70b15c97fd3030624951a5f748a2e093a8d06684a8b49e34f792884b238"},"schema_version":"1.0"},"canonical_sha256":"b5c7d0facbdf440a2665ab741ac6727f4a9e23e7197ef07f62fe032f5c0b54eb","source":{"kind":"arxiv","id":"1102.0874","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0874","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0874v1","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0874","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"WXD5B6WL35CA","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WXD5B6WL35CAUJTF","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WXD5B6WL","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WXD5B6WL35CAUJTFVN2BVRTSP5","target":"record","payload":{"canonical_record":{"source":{"id":"1102.0874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-04T10:58:50Z","cross_cats_sorted":[],"title_canon_sha256":"88123de91d05a7c7c58cf70252b74b53442f0e2f56d69ee68acf9aeddbb65e43","abstract_canon_sha256":"3012b70b15c97fd3030624951a5f748a2e093a8d06684a8b49e34f792884b238"},"schema_version":"1.0"},"canonical_sha256":"b5c7d0facbdf440a2665ab741ac6727f4a9e23e7197ef07f62fe032f5c0b54eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:38.867112Z","signature_b64":"+8e4JYUo/5CKe/S4lOo3gsv7PgHFLzATWxdP6yb2bYSSiDhq+4BaidLXhpBuPyvtqe/miJHTK05zGUHUgdiiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5c7d0facbdf440a2665ab741ac6727f4a9e23e7197ef07f62fe032f5c0b54eb","last_reissued_at":"2026-05-18T03:35:38.866345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:38.866345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.0874","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-18T03:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"idQcSAEVxQuQSXIJrhxFuXh9CkMETH6FEIT5mwCbKidN9AovApUfZieYUrSa2kpZcnBDPDvYTbvM4NUzMdHdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:13:58.331197Z"},"content_sha256":"bbb4b8aa70daca0c2f9413f8a0312d83ca6c94f10ffdad5a340c269c1344ff13","schema_version":"1.0","event_id":"sha256:bbb4b8aa70daca0c2f9413f8a0312d83ca6c94f10ffdad5a340c269c1344ff13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WXD5B6WL35CAUJTFVN2BVRTSP5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Sets for Straight-Line Embeddings of Bicolored Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jan Kyncl, Josef Cibulka, Pavel Valtr, Rudolf Stolar, Viola M\\'esz\\'aros","submitted_at":"2011-02-04T10:58:50Z","abstract_excerpt":"A set S of n points is 2-color universal for a graph G on n vertices if for every proper 2-coloring of G and for every 2-coloring of S with the same sizes of color classes as G has, G is straight-line embeddable on S. We show that the so-called double chain is 2-color universal for paths if each of the two chains contains at least one fifth of all the points, but not if one of the chains is more than approximately 28 times longer than the other. A 2-coloring of G is equitable if the sizes of the color classes differ by at most 1. A bipartite graph is equitable if it admits an equitable proper "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0874","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-18T03:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDMn1+IMm9z7SkbU91/YoxEEYCJFqdwM+gc/urBfdNCZHqwFKyvwpSaMezTPf3pNcWRQ+Ae+h6OcXydRb+TiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:13:58.331897Z"},"content_sha256":"294399379eacf5e37f094e72a3edcf6c94dab2037527bd9620f8128bd8e221bf","schema_version":"1.0","event_id":"sha256:294399379eacf5e37f094e72a3edcf6c94dab2037527bd9620f8128bd8e221bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WXD5B6WL35CAUJTFVN2BVRTSP5/bundle.json","state_url":"https://pith.science/pith/WXD5B6WL35CAUJTFVN2BVRTSP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WXD5B6WL35CAUJTFVN2BVRTSP5/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-05-28T20:13:58Z","links":{"resolver":"https://pith.science/pith/WXD5B6WL35CAUJTFVN2BVRTSP5","bundle":"https://pith.science/pith/WXD5B6WL35CAUJTFVN2BVRTSP5/bundle.json","state":"https://pith.science/pith/WXD5B6WL35CAUJTFVN2BVRTSP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WXD5B6WL35CAUJTFVN2BVRTSP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WXD5B6WL35CAUJTFVN2BVRTSP5","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":"3012b70b15c97fd3030624951a5f748a2e093a8d06684a8b49e34f792884b238","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-04T10:58:50Z","title_canon_sha256":"88123de91d05a7c7c58cf70252b74b53442f0e2f56d69ee68acf9aeddbb65e43"},"schema_version":"1.0","source":{"id":"1102.0874","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0874","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0874v1","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0874","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"WXD5B6WL35CA","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WXD5B6WL35CAUJTF","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WXD5B6WL","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:294399379eacf5e37f094e72a3edcf6c94dab2037527bd9620f8128bd8e221bf","target":"graph","created_at":"2026-05-18T03:35:38Z","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":"A set S of n points is 2-color universal for a graph G on n vertices if for every proper 2-coloring of G and for every 2-coloring of S with the same sizes of color classes as G has, G is straight-line embeddable on S. We show that the so-called double chain is 2-color universal for paths if each of the two chains contains at least one fifth of all the points, but not if one of the chains is more than approximately 28 times longer than the other. A 2-coloring of G is equitable if the sizes of the color classes differ by at most 1. A bipartite graph is equitable if it admits an equitable proper ","authors_text":"Jan Kyncl, Josef Cibulka, Pavel Valtr, Rudolf Stolar, Viola M\\'esz\\'aros","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-04T10:58:50Z","title":"Universal Sets for Straight-Line Embeddings of Bicolored Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0874","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:bbb4b8aa70daca0c2f9413f8a0312d83ca6c94f10ffdad5a340c269c1344ff13","target":"record","created_at":"2026-05-18T03:35:38Z","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":"3012b70b15c97fd3030624951a5f748a2e093a8d06684a8b49e34f792884b238","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-04T10:58:50Z","title_canon_sha256":"88123de91d05a7c7c58cf70252b74b53442f0e2f56d69ee68acf9aeddbb65e43"},"schema_version":"1.0","source":{"id":"1102.0874","kind":"arxiv","version":1}},"canonical_sha256":"b5c7d0facbdf440a2665ab741ac6727f4a9e23e7197ef07f62fe032f5c0b54eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5c7d0facbdf440a2665ab741ac6727f4a9e23e7197ef07f62fe032f5c0b54eb","first_computed_at":"2026-05-18T03:35:38.866345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:38.866345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+8e4JYUo/5CKe/S4lOo3gsv7PgHFLzATWxdP6yb2bYSSiDhq+4BaidLXhpBuPyvtqe/miJHTK05zGUHUgdiiAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:38.867112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.0874","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbb4b8aa70daca0c2f9413f8a0312d83ca6c94f10ffdad5a340c269c1344ff13","sha256:294399379eacf5e37f094e72a3edcf6c94dab2037527bd9620f8128bd8e221bf"],"state_sha256":"4796c7d617f4652ecc559467413f9394a89c42f1c93f75a5313bfcd84d315a7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IQj4hRxggPMWgOzlHwrVToq8i9Un8O2z6IcF0RtrSa0Ws7YLjHA+KmbLOWWyQ8KHTBH85o+YnBiujwwvpuWQCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:13:58.335713Z","bundle_sha256":"486c24185cecb418ee17fb053744f7c35c1dc520bf06dd7f1b75e741e8968264"}}