{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:P5FSO3IT7XBEIXS5NA4X57SJB2","short_pith_number":"pith:P5FSO3IT","canonical_record":{"source":{"id":"1010.6036","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-28T18:15:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"148fde4f74809a11d393df150fd703382705874550cdf773de48085e7157e592","abstract_canon_sha256":"60ea09a97f428220003aecd49bbde51d48964f35a3f5da0954943b25ef3ce790"},"schema_version":"1.0"},"canonical_sha256":"7f4b276d13fdc2445e5d68397efe490e9ab43b86fc76b06718ff392c9a8673b3","source":{"kind":"arxiv","id":"1010.6036","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.6036","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"arxiv_version","alias_value":"1010.6036v4","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.6036","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"pith_short_12","alias_value":"P5FSO3IT7XBE","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"P5FSO3IT7XBEIXS5","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"P5FSO3IT","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:P5FSO3IT7XBEIXS5NA4X57SJB2","target":"record","payload":{"canonical_record":{"source":{"id":"1010.6036","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-28T18:15:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"148fde4f74809a11d393df150fd703382705874550cdf773de48085e7157e592","abstract_canon_sha256":"60ea09a97f428220003aecd49bbde51d48964f35a3f5da0954943b25ef3ce790"},"schema_version":"1.0"},"canonical_sha256":"7f4b276d13fdc2445e5d68397efe490e9ab43b86fc76b06718ff392c9a8673b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:02.613376Z","signature_b64":"uPrJxBD3gXcQkEwXGAL8FnnImvRLQhiI4y3Kki5Wl7P3iBcV6QDhCduxmJqDt79Ett4k/q+64d2FbGLvQGr4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f4b276d13fdc2445e5d68397efe490e9ab43b86fc76b06718ff392c9a8673b3","last_reissued_at":"2026-05-18T00:25:02.612962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:02.612962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.6036","source_version":4,"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:25:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfAi+SNnhaTnZNvQr4doIhQn/fFfphMf2QAf4ok7cNbASydmXlfh9f4jn38IQKVl9Bra5v5JuyD84XGEce4YDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:39:21.858209Z"},"content_sha256":"c8c18c019026cc6da16a47e52d29b248036b804fa56a6f9ce94fee1df50abf19","schema_version":"1.0","event_id":"sha256:c8c18c019026cc6da16a47e52d29b248036b804fa56a6f9ce94fee1df50abf19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:P5FSO3IT7XBEIXS5NA4X57SJB2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization Problems over Unit-Distance Representations of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Levent Tun\\c{c}el, Marcel K. de Carli Silva","submitted_at":"2010-10-28T18:15:05Z","abstract_excerpt":"We study the relationship between unit-distance representations and Lovasz theta number of graphs, originally established by Lovasz. We derive and prove min-max theorems. This framework allows us to derive a weighted version of the hypersphere number of a graph and a related min-max theorem. Then, we connect to sandwich theorems via graph homomorphisms. We present and study a generalization of the hypersphere number of a graph and the related optimization problems. The generalized problem involves finding the smallest ellipsoid of a given shape which contains a unit-distance representation of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.6036","kind":"arxiv","version":4},"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:25:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ii7EUwvkByPMBb3wHK4HMbJLnGNpnzgHOUKfkBK8rnEphQq92m4h0wUGw0BXfmV9Y3jw5DLIN2ZSHb8JJ6L4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:39:21.858654Z"},"content_sha256":"d2d7a5bb418fc462bce3d66ba784ac09567017fe098944d73b0ce177b6e89296","schema_version":"1.0","event_id":"sha256:d2d7a5bb418fc462bce3d66ba784ac09567017fe098944d73b0ce177b6e89296"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5FSO3IT7XBEIXS5NA4X57SJB2/bundle.json","state_url":"https://pith.science/pith/P5FSO3IT7XBEIXS5NA4X57SJB2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5FSO3IT7XBEIXS5NA4X57SJB2/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-23T17:39:21Z","links":{"resolver":"https://pith.science/pith/P5FSO3IT7XBEIXS5NA4X57SJB2","bundle":"https://pith.science/pith/P5FSO3IT7XBEIXS5NA4X57SJB2/bundle.json","state":"https://pith.science/pith/P5FSO3IT7XBEIXS5NA4X57SJB2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5FSO3IT7XBEIXS5NA4X57SJB2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:P5FSO3IT7XBEIXS5NA4X57SJB2","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":"60ea09a97f428220003aecd49bbde51d48964f35a3f5da0954943b25ef3ce790","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-28T18:15:05Z","title_canon_sha256":"148fde4f74809a11d393df150fd703382705874550cdf773de48085e7157e592"},"schema_version":"1.0","source":{"id":"1010.6036","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.6036","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"arxiv_version","alias_value":"1010.6036v4","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.6036","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"pith_short_12","alias_value":"P5FSO3IT7XBE","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"P5FSO3IT7XBEIXS5","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"P5FSO3IT","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:d2d7a5bb418fc462bce3d66ba784ac09567017fe098944d73b0ce177b6e89296","target":"graph","created_at":"2026-05-18T00:25:02Z","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 the relationship between unit-distance representations and Lovasz theta number of graphs, originally established by Lovasz. We derive and prove min-max theorems. This framework allows us to derive a weighted version of the hypersphere number of a graph and a related min-max theorem. Then, we connect to sandwich theorems via graph homomorphisms. We present and study a generalization of the hypersphere number of a graph and the related optimization problems. The generalized problem involves finding the smallest ellipsoid of a given shape which contains a unit-distance representation of ","authors_text":"Levent Tun\\c{c}el, Marcel K. de Carli Silva","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-28T18:15:05Z","title":"Optimization Problems over Unit-Distance Representations of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.6036","kind":"arxiv","version":4},"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:c8c18c019026cc6da16a47e52d29b248036b804fa56a6f9ce94fee1df50abf19","target":"record","created_at":"2026-05-18T00:25:02Z","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":"60ea09a97f428220003aecd49bbde51d48964f35a3f5da0954943b25ef3ce790","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-28T18:15:05Z","title_canon_sha256":"148fde4f74809a11d393df150fd703382705874550cdf773de48085e7157e592"},"schema_version":"1.0","source":{"id":"1010.6036","kind":"arxiv","version":4}},"canonical_sha256":"7f4b276d13fdc2445e5d68397efe490e9ab43b86fc76b06718ff392c9a8673b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f4b276d13fdc2445e5d68397efe490e9ab43b86fc76b06718ff392c9a8673b3","first_computed_at":"2026-05-18T00:25:02.612962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:02.612962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uPrJxBD3gXcQkEwXGAL8FnnImvRLQhiI4y3Kki5Wl7P3iBcV6QDhCduxmJqDt79Ett4k/q+64d2FbGLvQGr4Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:02.613376Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.6036","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8c18c019026cc6da16a47e52d29b248036b804fa56a6f9ce94fee1df50abf19","sha256:d2d7a5bb418fc462bce3d66ba784ac09567017fe098944d73b0ce177b6e89296"],"state_sha256":"109b3b67a297dd1c63a95a77e4b3676fae72cc274f3c93fc890d39a6ba3abbf4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rFErF61cn9DVXAGA52WeOTJ8sSLXDutJQ0giPFYGHobb4YYdz9ujKxdHkRDbzL/szHbrl5MKqirbCTY7zpnDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:39:21.860846Z","bundle_sha256":"5252e3a907767216d66b2f630a353cb6f47b7e61f8b72655765b788085eba9b3"}}