{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZSBEE5A4T4OHBE52FRWJ54TMBT","short_pith_number":"pith:ZSBEE5A4","canonical_record":{"source":{"id":"1608.07056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-25T09:05:30Z","cross_cats_sorted":[],"title_canon_sha256":"2a7ed7895da98e1bed511374a11f80a9f0b93ae622d61ba0ecdb499bfcdf64c6","abstract_canon_sha256":"bcde3bbee2e882ae626a49ad33b4a115cd5d30f5715c74bfbb0b0e77f31a5afc"},"schema_version":"1.0"},"canonical_sha256":"cc8242741c9f1c7093ba2c6c9ef26c0cffe7f0e017539ea7d641d6f919975c32","source":{"kind":"arxiv","id":"1608.07056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07056","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07056v1","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07056","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZSBEE5A4T4OH","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZSBEE5A4T4OHBE52","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZSBEE5A4","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZSBEE5A4T4OHBE52FRWJ54TMBT","target":"record","payload":{"canonical_record":{"source":{"id":"1608.07056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-25T09:05:30Z","cross_cats_sorted":[],"title_canon_sha256":"2a7ed7895da98e1bed511374a11f80a9f0b93ae622d61ba0ecdb499bfcdf64c6","abstract_canon_sha256":"bcde3bbee2e882ae626a49ad33b4a115cd5d30f5715c74bfbb0b0e77f31a5afc"},"schema_version":"1.0"},"canonical_sha256":"cc8242741c9f1c7093ba2c6c9ef26c0cffe7f0e017539ea7d641d6f919975c32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:54.926996Z","signature_b64":"DyzFGKmT3OHKIfKbyWXb8MxttDbtZsAEM2M6EskZhhKIenCYrnplWTkw7lb+ga2Y6x15zTgGv9NKmXwFlDbXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc8242741c9f1c7093ba2c6c9ef26c0cffe7f0e017539ea7d641d6f919975c32","last_reissued_at":"2026-05-18T01:07:54.926617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:54.926617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.07056","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-18T01:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZHwWJhzwhMaJWccX9lbljoD7iAg7U1gfggl8kGJllb4FH0RW5InYvdnKXC7xmmBEaDZmJ+M+pBSOO6rVW5FLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:24:30.124266Z"},"content_sha256":"f8063f93599e6836c239ba1fd727bdc38a8b64b61370c8b16433f41d27b6437b","schema_version":"1.0","event_id":"sha256:f8063f93599e6836c239ba1fd727bdc38a8b64b61370c8b16433f41d27b6437b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZSBEE5A4T4OHBE52FRWJ54TMBT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Colored Spanning Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Csaba D. T\\'oth, Hugo A. Akitaya, Maarten L\\\"offler","submitted_at":"2016-08-25T09:05:30Z","abstract_excerpt":"We study a problem proposed by Hurtado et al. (2016) motivated by sparse set visualization. Given $n$ points in the plane, each labeled with one or more primary colors, a \\emph{colored spanning graph} (CSG) is a graph such that for each primary color, the vertices of that color induce a connected subgraph. The \\textsc{Min-CSG} problem asks for the minimum sum of edge lengths in a colored spanning graph. We show that the problem is NP-hard for $k$ primary colors when $k\\ge 3$ and provide a $(2-\\frac{1}{3+2\\varrho})$-approximation algorithm for $k=3$ that runs in polynomial time, where $\\varrho$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07056","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-18T01:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mqK4EzXzMMFOoCDH8IOnUYr9Ihi/NhtN+ZG7+nEzP34fnUzEbrlkREvipTJXbWMKM1TlG+YoJfr030aCzzzuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:24:30.124636Z"},"content_sha256":"50999e07f9e1b6813eec47d0a0d7855c843c7900217eef08838d96ea7cd324aa","schema_version":"1.0","event_id":"sha256:50999e07f9e1b6813eec47d0a0d7855c843c7900217eef08838d96ea7cd324aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSBEE5A4T4OHBE52FRWJ54TMBT/bundle.json","state_url":"https://pith.science/pith/ZSBEE5A4T4OHBE52FRWJ54TMBT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSBEE5A4T4OHBE52FRWJ54TMBT/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-28T06:24:30Z","links":{"resolver":"https://pith.science/pith/ZSBEE5A4T4OHBE52FRWJ54TMBT","bundle":"https://pith.science/pith/ZSBEE5A4T4OHBE52FRWJ54TMBT/bundle.json","state":"https://pith.science/pith/ZSBEE5A4T4OHBE52FRWJ54TMBT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSBEE5A4T4OHBE52FRWJ54TMBT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZSBEE5A4T4OHBE52FRWJ54TMBT","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":"bcde3bbee2e882ae626a49ad33b4a115cd5d30f5715c74bfbb0b0e77f31a5afc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-25T09:05:30Z","title_canon_sha256":"2a7ed7895da98e1bed511374a11f80a9f0b93ae622d61ba0ecdb499bfcdf64c6"},"schema_version":"1.0","source":{"id":"1608.07056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07056","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07056v1","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07056","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZSBEE5A4T4OH","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZSBEE5A4T4OHBE52","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZSBEE5A4","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:50999e07f9e1b6813eec47d0a0d7855c843c7900217eef08838d96ea7cd324aa","target":"graph","created_at":"2026-05-18T01:07:54Z","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 study a problem proposed by Hurtado et al. (2016) motivated by sparse set visualization. Given $n$ points in the plane, each labeled with one or more primary colors, a \\emph{colored spanning graph} (CSG) is a graph such that for each primary color, the vertices of that color induce a connected subgraph. The \\textsc{Min-CSG} problem asks for the minimum sum of edge lengths in a colored spanning graph. We show that the problem is NP-hard for $k$ primary colors when $k\\ge 3$ and provide a $(2-\\frac{1}{3+2\\varrho})$-approximation algorithm for $k=3$ that runs in polynomial time, where $\\varrho$","authors_text":"Csaba D. T\\'oth, Hugo A. Akitaya, Maarten L\\\"offler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-25T09:05:30Z","title":"Multi-Colored Spanning Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07056","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:f8063f93599e6836c239ba1fd727bdc38a8b64b61370c8b16433f41d27b6437b","target":"record","created_at":"2026-05-18T01:07:54Z","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":"bcde3bbee2e882ae626a49ad33b4a115cd5d30f5715c74bfbb0b0e77f31a5afc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-25T09:05:30Z","title_canon_sha256":"2a7ed7895da98e1bed511374a11f80a9f0b93ae622d61ba0ecdb499bfcdf64c6"},"schema_version":"1.0","source":{"id":"1608.07056","kind":"arxiv","version":1}},"canonical_sha256":"cc8242741c9f1c7093ba2c6c9ef26c0cffe7f0e017539ea7d641d6f919975c32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc8242741c9f1c7093ba2c6c9ef26c0cffe7f0e017539ea7d641d6f919975c32","first_computed_at":"2026-05-18T01:07:54.926617Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:54.926617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DyzFGKmT3OHKIfKbyWXb8MxttDbtZsAEM2M6EskZhhKIenCYrnplWTkw7lb+ga2Y6x15zTgGv9NKmXwFlDbXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:54.926996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8063f93599e6836c239ba1fd727bdc38a8b64b61370c8b16433f41d27b6437b","sha256:50999e07f9e1b6813eec47d0a0d7855c843c7900217eef08838d96ea7cd324aa"],"state_sha256":"e8da3ce17913b647b5dc994374dd92f5a1fe49227064430a611c2bca47086324"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sYAQl2vv6qU8CicEOp9RBmqQ84q/2Y7z26AkWtusU7WVo+uPBElQxNzNdW7UQDWm/5JuM+ot4rdMVpDbEYwSDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:24:30.126635Z","bundle_sha256":"b797169777c1fdda39b55022767957184b34f9299723d1007bf4649800e0dead"}}