{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4N3VLVIGN5FPZWNG7KGLL55XRS","short_pith_number":"pith:4N3VLVIG","canonical_record":{"source":{"id":"1906.00935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-03T17:25:01Z","cross_cats_sorted":[],"title_canon_sha256":"85a5997ee037b4fba0db2255ea491cc84aa0fa3b84d64d95a941c0e858723176","abstract_canon_sha256":"551dc66719becf22dab4014c34e844b819a9be8d3d11c67eda2e76615013357c"},"schema_version":"1.0"},"canonical_sha256":"e37755d5066f4afcd9a6fa8cb5f7b78cb20cf977362ac1397e99e392341f0a8b","source":{"kind":"arxiv","id":"1906.00935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00935","created_at":"2026-05-17T23:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00935v1","created_at":"2026-05-17T23:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00935","created_at":"2026-05-17T23:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"4N3VLVIGN5FP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4N3VLVIGN5FPZWNG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4N3VLVIG","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4N3VLVIGN5FPZWNG7KGLL55XRS","target":"record","payload":{"canonical_record":{"source":{"id":"1906.00935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-03T17:25:01Z","cross_cats_sorted":[],"title_canon_sha256":"85a5997ee037b4fba0db2255ea491cc84aa0fa3b84d64d95a941c0e858723176","abstract_canon_sha256":"551dc66719becf22dab4014c34e844b819a9be8d3d11c67eda2e76615013357c"},"schema_version":"1.0"},"canonical_sha256":"e37755d5066f4afcd9a6fa8cb5f7b78cb20cf977362ac1397e99e392341f0a8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:23.464051Z","signature_b64":"dDZfVNGZxx3udiulkHqmuCV4wjSN5s8cymgs+4FidVHhtQPSwlzJgp6hiL1f2irF5b18M0pc2YzbQqoZXrZBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e37755d5066f4afcd9a6fa8cb5f7b78cb20cf977362ac1397e99e392341f0a8b","last_reissued_at":"2026-05-17T23:44:23.463398Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:23.463398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.00935","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-17T23:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9PQ/kRq4dTQRCRUDKpRF1R786ZN1zb0k/mKEyFBkDtJ+LxmiHm0RGGZ/Y0LXOnEVStZx+M6Kj15ZZJr22934CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:04:03.865750Z"},"content_sha256":"2fe369f03a8401b259a259154320f8b20475b3ea3154d7e0f7fccf334f036302","schema_version":"1.0","event_id":"sha256:2fe369f03a8401b259a259154320f8b20475b3ea3154d7e0f7fccf334f036302"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4N3VLVIGN5FPZWNG7KGLL55XRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The general position problem and strong resolving graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ismael G. Yero, Sandi Klavzar","submitted_at":"2019-06-03T17:25:01Z","abstract_excerpt":"The general position number ${\\rm gp}(G)$ of a connected graph $G$ is the cardinality of a largest set $S$ of vertices such that no three pairwise distinct vertices from $S$ lie on a common geodesic. It is proved that ${\\rm gp}(G)\\ge \\omega(G_{\\rm SR}$, where $G_{\\rm SR}$ is the strong resolving graph of $G$, and $\\omega(G_{\\rm SR})$ is its clique number. That the bound is sharp is demonstrated with numerous constructions including for instance direct products of complete graphs and different families of strong products, of generalized lexicographic products, and of rooted product graphs. For "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00935","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-17T23:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v8U+dVBzE8sQx8faP+FxqKxMUp1YmXjfdLyq61/OHQglszYuEWxalom1yCNvcNEssIrGWh/m//6DM4pAHw7xDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:04:03.866093Z"},"content_sha256":"a3006602b376315af9b35060b55f521f504167cca4af5a6c9bb8a0238ed71866","schema_version":"1.0","event_id":"sha256:a3006602b376315af9b35060b55f521f504167cca4af5a6c9bb8a0238ed71866"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4N3VLVIGN5FPZWNG7KGLL55XRS/bundle.json","state_url":"https://pith.science/pith/4N3VLVIGN5FPZWNG7KGLL55XRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4N3VLVIGN5FPZWNG7KGLL55XRS/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-24T21:04:03Z","links":{"resolver":"https://pith.science/pith/4N3VLVIGN5FPZWNG7KGLL55XRS","bundle":"https://pith.science/pith/4N3VLVIGN5FPZWNG7KGLL55XRS/bundle.json","state":"https://pith.science/pith/4N3VLVIGN5FPZWNG7KGLL55XRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4N3VLVIGN5FPZWNG7KGLL55XRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4N3VLVIGN5FPZWNG7KGLL55XRS","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":"551dc66719becf22dab4014c34e844b819a9be8d3d11c67eda2e76615013357c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-03T17:25:01Z","title_canon_sha256":"85a5997ee037b4fba0db2255ea491cc84aa0fa3b84d64d95a941c0e858723176"},"schema_version":"1.0","source":{"id":"1906.00935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00935","created_at":"2026-05-17T23:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00935v1","created_at":"2026-05-17T23:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00935","created_at":"2026-05-17T23:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"4N3VLVIGN5FP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4N3VLVIGN5FPZWNG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4N3VLVIG","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:a3006602b376315af9b35060b55f521f504167cca4af5a6c9bb8a0238ed71866","target":"graph","created_at":"2026-05-17T23:44:23Z","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":"The general position number ${\\rm gp}(G)$ of a connected graph $G$ is the cardinality of a largest set $S$ of vertices such that no three pairwise distinct vertices from $S$ lie on a common geodesic. It is proved that ${\\rm gp}(G)\\ge \\omega(G_{\\rm SR}$, where $G_{\\rm SR}$ is the strong resolving graph of $G$, and $\\omega(G_{\\rm SR})$ is its clique number. That the bound is sharp is demonstrated with numerous constructions including for instance direct products of complete graphs and different families of strong products, of generalized lexicographic products, and of rooted product graphs. For ","authors_text":"Ismael G. Yero, Sandi Klavzar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-03T17:25:01Z","title":"The general position problem and strong resolving graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00935","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:2fe369f03a8401b259a259154320f8b20475b3ea3154d7e0f7fccf334f036302","target":"record","created_at":"2026-05-17T23:44:23Z","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":"551dc66719becf22dab4014c34e844b819a9be8d3d11c67eda2e76615013357c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-03T17:25:01Z","title_canon_sha256":"85a5997ee037b4fba0db2255ea491cc84aa0fa3b84d64d95a941c0e858723176"},"schema_version":"1.0","source":{"id":"1906.00935","kind":"arxiv","version":1}},"canonical_sha256":"e37755d5066f4afcd9a6fa8cb5f7b78cb20cf977362ac1397e99e392341f0a8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e37755d5066f4afcd9a6fa8cb5f7b78cb20cf977362ac1397e99e392341f0a8b","first_computed_at":"2026-05-17T23:44:23.463398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:23.463398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dDZfVNGZxx3udiulkHqmuCV4wjSN5s8cymgs+4FidVHhtQPSwlzJgp6hiL1f2irF5b18M0pc2YzbQqoZXrZBAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:23.464051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fe369f03a8401b259a259154320f8b20475b3ea3154d7e0f7fccf334f036302","sha256:a3006602b376315af9b35060b55f521f504167cca4af5a6c9bb8a0238ed71866"],"state_sha256":"a2d490f9c24780a14ab534a8ac20840c2ebbb3026f4db7d3ecda7a83e4e07041"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Ts06gJu/Rsi+KQ76JltmElWB6GX/B3apZBdNvPi7QAI063QcQ0iWlSFS75xbGZK9nvPhygFOxrI2CvEt9/MBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:04:03.868025Z","bundle_sha256":"605b9009546e681a07aa90f45eafd66c0592bff9dbeb75279d95bf9126d5290c"}}