{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E45SPQRCBD5SMRXMAA2NKW7XQ6","short_pith_number":"pith:E45SPQRC","canonical_record":{"source":{"id":"1803.11423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-30T11:39:10Z","cross_cats_sorted":[],"title_canon_sha256":"26d04cdfa0fc4b9cc5426e224688353cb560c6d9f68673be84f58bc30c271ecc","abstract_canon_sha256":"9c9cce9fe5ca234b18e0d1d3d821f01f4be80000a1e0971b7bd40c660618a162"},"schema_version":"1.0"},"canonical_sha256":"273b27c22208fb2646ec0034d55bf7879088b58a0212f3d77d99f2f9ea843e25","source":{"kind":"arxiv","id":"1803.11423","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.11423","created_at":"2026-05-18T00:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1803.11423v1","created_at":"2026-05-18T00:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11423","created_at":"2026-05-18T00:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"E45SPQRCBD5S","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E45SPQRCBD5SMRXM","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E45SPQRC","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E45SPQRCBD5SMRXMAA2NKW7XQ6","target":"record","payload":{"canonical_record":{"source":{"id":"1803.11423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-30T11:39:10Z","cross_cats_sorted":[],"title_canon_sha256":"26d04cdfa0fc4b9cc5426e224688353cb560c6d9f68673be84f58bc30c271ecc","abstract_canon_sha256":"9c9cce9fe5ca234b18e0d1d3d821f01f4be80000a1e0971b7bd40c660618a162"},"schema_version":"1.0"},"canonical_sha256":"273b27c22208fb2646ec0034d55bf7879088b58a0212f3d77d99f2f9ea843e25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:43.680251Z","signature_b64":"xw0Y8BQJKjMm7K5/dtE3FjDNo9ZV92EkL1xBVLJOFL0Q0EF07Wo26UggzCS5YsN5KrB63ScuEJFSLZx4oDayDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"273b27c22208fb2646ec0034d55bf7879088b58a0212f3d77d99f2f9ea843e25","last_reissued_at":"2026-05-18T00:19:43.679588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:43.679588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.11423","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-18T00:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CPG+GtRT/xvsU4m63kyxbxN18jw0u1JOVRBfTEktJorBUCiLIqrIy4Hk0TWf0aYPEgmDuJD43nA+zg+lNxXnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:59:53.084579Z"},"content_sha256":"82befec90fd1a01791334fe442ef3b93aac4d4ab6d5d8aae981de946d00a2b15","schema_version":"1.0","event_id":"sha256:82befec90fd1a01791334fe442ef3b93aac4d4ab6d5d8aae981de946d00a2b15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E45SPQRCBD5SMRXMAA2NKW7XQ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong geodetic cores and Cartesian product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sandi Klav\\v{z}ar, Valentin Gledel, Vesna Ir\\v{s}i\\v{c}","submitted_at":"2018-03-30T11:39:10Z","abstract_excerpt":"The strong geodetic problem on a graph $G$ is to determine a smallest set of vertices such that by fixing one shortest path between each pair of its vertices, all vertices of $G$ are covered. To do this as efficiently as possible, strong geodetic cores and related numbers are introduced. Sharp upper and lower bounds on the strong geodetic core number are proved. Using the strong geodetic core number an earlier upper bound on the strong geodetic number of Cartesian products is improved. It is also proved that ${\\rm sg}(G \\,\\square\\, K_2) \\geq {\\rm sg}(G)$ holds for different families of graphs,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11423","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-18T00:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B4RkUAZplJ4T43aNSde4GTaDXTBE6E5NV5B9bI4S7yFY3YlrcnBkWK6qO9G24e4rsO/eNb9sw8EM9jh5oqrrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:59:53.085196Z"},"content_sha256":"ef191c844767513386a84402fb29e80e301c1492bbb8218de090bb1743dbc249","schema_version":"1.0","event_id":"sha256:ef191c844767513386a84402fb29e80e301c1492bbb8218de090bb1743dbc249"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E45SPQRCBD5SMRXMAA2NKW7XQ6/bundle.json","state_url":"https://pith.science/pith/E45SPQRCBD5SMRXMAA2NKW7XQ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E45SPQRCBD5SMRXMAA2NKW7XQ6/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-11T06:59:53Z","links":{"resolver":"https://pith.science/pith/E45SPQRCBD5SMRXMAA2NKW7XQ6","bundle":"https://pith.science/pith/E45SPQRCBD5SMRXMAA2NKW7XQ6/bundle.json","state":"https://pith.science/pith/E45SPQRCBD5SMRXMAA2NKW7XQ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E45SPQRCBD5SMRXMAA2NKW7XQ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E45SPQRCBD5SMRXMAA2NKW7XQ6","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":"9c9cce9fe5ca234b18e0d1d3d821f01f4be80000a1e0971b7bd40c660618a162","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-30T11:39:10Z","title_canon_sha256":"26d04cdfa0fc4b9cc5426e224688353cb560c6d9f68673be84f58bc30c271ecc"},"schema_version":"1.0","source":{"id":"1803.11423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.11423","created_at":"2026-05-18T00:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1803.11423v1","created_at":"2026-05-18T00:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11423","created_at":"2026-05-18T00:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"E45SPQRCBD5S","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E45SPQRCBD5SMRXM","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E45SPQRC","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:ef191c844767513386a84402fb29e80e301c1492bbb8218de090bb1743dbc249","target":"graph","created_at":"2026-05-18T00:19:43Z","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 strong geodetic problem on a graph $G$ is to determine a smallest set of vertices such that by fixing one shortest path between each pair of its vertices, all vertices of $G$ are covered. To do this as efficiently as possible, strong geodetic cores and related numbers are introduced. Sharp upper and lower bounds on the strong geodetic core number are proved. Using the strong geodetic core number an earlier upper bound on the strong geodetic number of Cartesian products is improved. It is also proved that ${\\rm sg}(G \\,\\square\\, K_2) \\geq {\\rm sg}(G)$ holds for different families of graphs,","authors_text":"Sandi Klav\\v{z}ar, Valentin Gledel, Vesna Ir\\v{s}i\\v{c}","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-30T11:39:10Z","title":"Strong geodetic cores and Cartesian product graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11423","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:82befec90fd1a01791334fe442ef3b93aac4d4ab6d5d8aae981de946d00a2b15","target":"record","created_at":"2026-05-18T00:19:43Z","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":"9c9cce9fe5ca234b18e0d1d3d821f01f4be80000a1e0971b7bd40c660618a162","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-30T11:39:10Z","title_canon_sha256":"26d04cdfa0fc4b9cc5426e224688353cb560c6d9f68673be84f58bc30c271ecc"},"schema_version":"1.0","source":{"id":"1803.11423","kind":"arxiv","version":1}},"canonical_sha256":"273b27c22208fb2646ec0034d55bf7879088b58a0212f3d77d99f2f9ea843e25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"273b27c22208fb2646ec0034d55bf7879088b58a0212f3d77d99f2f9ea843e25","first_computed_at":"2026-05-18T00:19:43.679588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:43.679588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xw0Y8BQJKjMm7K5/dtE3FjDNo9ZV92EkL1xBVLJOFL0Q0EF07Wo26UggzCS5YsN5KrB63ScuEJFSLZx4oDayDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:43.680251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.11423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82befec90fd1a01791334fe442ef3b93aac4d4ab6d5d8aae981de946d00a2b15","sha256:ef191c844767513386a84402fb29e80e301c1492bbb8218de090bb1743dbc249"],"state_sha256":"d0c3ad7a9d59d2d1b3db60b3dc96adad9d9ecd2e5e080f1850fee528ae93dacd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSYJJzRIL0609gCKqwEM6+IcXe3GBrV75+hunghoyjZ0noN8O7FPl32FC+c9cnJuYDYNrjoPajduFacJUJWaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:59:53.088020Z","bundle_sha256":"9935ac5a7efc20b2327b6f059758ce023301d3b22bee62528dd06d9a03e9cff5"}}