{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WBIVFRHA2NHA5ABXUIQMMKCY3F","short_pith_number":"pith:WBIVFRHA","canonical_record":{"source":{"id":"1812.08460","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-20T10:16:54Z","cross_cats_sorted":[],"title_canon_sha256":"aa197c13b7de3ad85ea531da87403af3c2e678216bab4c4794490fa60c7cc891","abstract_canon_sha256":"f613f662646ee4ce9f2497420c130528e7262931e555e8cb840f049cacc740ef"},"schema_version":"1.0"},"canonical_sha256":"b05152c4e0d34e0e8037a220c62858d947ac65458c11261edc9f7751b5c15981","source":{"kind":"arxiv","id":"1812.08460","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08460","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08460v2","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08460","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"pith_short_12","alias_value":"WBIVFRHA2NHA","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WBIVFRHA2NHA5ABX","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WBIVFRHA","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WBIVFRHA2NHA5ABXUIQMMKCY3F","target":"record","payload":{"canonical_record":{"source":{"id":"1812.08460","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-20T10:16:54Z","cross_cats_sorted":[],"title_canon_sha256":"aa197c13b7de3ad85ea531da87403af3c2e678216bab4c4794490fa60c7cc891","abstract_canon_sha256":"f613f662646ee4ce9f2497420c130528e7262931e555e8cb840f049cacc740ef"},"schema_version":"1.0"},"canonical_sha256":"b05152c4e0d34e0e8037a220c62858d947ac65458c11261edc9f7751b5c15981","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:31.105181Z","signature_b64":"Nq+R2iLW7ka0nHG9fjQvcxYCmcJGYHxPXXdEZDbx2iTwxOVAUaaW+ii2rhMBj4Yk0DrY51yjGOoYUUUGeiWGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b05152c4e0d34e0e8037a220c62858d947ac65458c11261edc9f7751b5c15981","last_reissued_at":"2026-05-17T23:48:31.104641Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:31.104641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.08460","source_version":2,"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:48:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mIMmco+qAkG8KW1Lg4p/FetQQ5XLn0aDZZyGL7KOkdeuoHEREkGzXbwC3yVfofP4Rxeti6QFsUkdO3wAgaipDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:30:34.818023Z"},"content_sha256":"59b2a9b62d5d77a64a65d7bf60ac22dd6ba6b47270732280a86ec685bc12f017","schema_version":"1.0","event_id":"sha256:59b2a9b62d5d77a64a65d7bf60ac22dd6ba6b47270732280a86ec685bc12f017"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WBIVFRHA2NHA5ABXUIQMMKCY3F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterization of general position sets and its applications to cographs and bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bijo S. Anand, Elias John Thomas, Manoj Changat, Sandi Klav\\v{z}ar, Ullas Chandran S. V.","submitted_at":"2018-12-20T10:16:54Z","abstract_excerpt":"A vertex subset $S$ of a graph $G$ is a general position set of $G$ if no vertex of $S$ lies on a geodesic between two other vertices of $S$. The cardinality of a largest general position set of $G$ is the general position number ${\\rm gp}(G)$ of $G$. It is proved that $S\\subseteq V(G)$ is in general position if and only if the components of $G[S]$ are complete subgraphs, the vertices of which form an in-transitive, distance-constant partition of $S$. If ${\\rm diam}(G) = 2$, then ${\\rm gp}(G)$ is the maximum of $\\omega(G)$ and the maximum order of an induced complete multipartite subgraph of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08460","kind":"arxiv","version":2},"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:48:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9xIHYVRyEq0XovRnI82nMYVWrxs1VqtvNkA3cC72sQV501wEk5vc5IRiqKDHJaoNVPo8kF7OCEJTP1WVegf+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:30:34.818403Z"},"content_sha256":"4a700d50d367d582af8edd3ac187c7ccb684f59ebf5c30900c6df13180fac2b2","schema_version":"1.0","event_id":"sha256:4a700d50d367d582af8edd3ac187c7ccb684f59ebf5c30900c6df13180fac2b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBIVFRHA2NHA5ABXUIQMMKCY3F/bundle.json","state_url":"https://pith.science/pith/WBIVFRHA2NHA5ABXUIQMMKCY3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBIVFRHA2NHA5ABXUIQMMKCY3F/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-23T21:30:34Z","links":{"resolver":"https://pith.science/pith/WBIVFRHA2NHA5ABXUIQMMKCY3F","bundle":"https://pith.science/pith/WBIVFRHA2NHA5ABXUIQMMKCY3F/bundle.json","state":"https://pith.science/pith/WBIVFRHA2NHA5ABXUIQMMKCY3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBIVFRHA2NHA5ABXUIQMMKCY3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WBIVFRHA2NHA5ABXUIQMMKCY3F","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":"f613f662646ee4ce9f2497420c130528e7262931e555e8cb840f049cacc740ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-20T10:16:54Z","title_canon_sha256":"aa197c13b7de3ad85ea531da87403af3c2e678216bab4c4794490fa60c7cc891"},"schema_version":"1.0","source":{"id":"1812.08460","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08460","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08460v2","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08460","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"pith_short_12","alias_value":"WBIVFRHA2NHA","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WBIVFRHA2NHA5ABX","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WBIVFRHA","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:4a700d50d367d582af8edd3ac187c7ccb684f59ebf5c30900c6df13180fac2b2","target":"graph","created_at":"2026-05-17T23:48:31Z","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 vertex subset $S$ of a graph $G$ is a general position set of $G$ if no vertex of $S$ lies on a geodesic between two other vertices of $S$. The cardinality of a largest general position set of $G$ is the general position number ${\\rm gp}(G)$ of $G$. It is proved that $S\\subseteq V(G)$ is in general position if and only if the components of $G[S]$ are complete subgraphs, the vertices of which form an in-transitive, distance-constant partition of $S$. If ${\\rm diam}(G) = 2$, then ${\\rm gp}(G)$ is the maximum of $\\omega(G)$ and the maximum order of an induced complete multipartite subgraph of t","authors_text":"Bijo S. Anand, Elias John Thomas, Manoj Changat, Sandi Klav\\v{z}ar, Ullas Chandran S. V.","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-20T10:16:54Z","title":"Characterization of general position sets and its applications to cographs and bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08460","kind":"arxiv","version":2},"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:59b2a9b62d5d77a64a65d7bf60ac22dd6ba6b47270732280a86ec685bc12f017","target":"record","created_at":"2026-05-17T23:48:31Z","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":"f613f662646ee4ce9f2497420c130528e7262931e555e8cb840f049cacc740ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-20T10:16:54Z","title_canon_sha256":"aa197c13b7de3ad85ea531da87403af3c2e678216bab4c4794490fa60c7cc891"},"schema_version":"1.0","source":{"id":"1812.08460","kind":"arxiv","version":2}},"canonical_sha256":"b05152c4e0d34e0e8037a220c62858d947ac65458c11261edc9f7751b5c15981","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b05152c4e0d34e0e8037a220c62858d947ac65458c11261edc9f7751b5c15981","first_computed_at":"2026-05-17T23:48:31.104641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:31.104641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nq+R2iLW7ka0nHG9fjQvcxYCmcJGYHxPXXdEZDbx2iTwxOVAUaaW+ii2rhMBj4Yk0DrY51yjGOoYUUUGeiWGCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:31.105181Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.08460","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59b2a9b62d5d77a64a65d7bf60ac22dd6ba6b47270732280a86ec685bc12f017","sha256:4a700d50d367d582af8edd3ac187c7ccb684f59ebf5c30900c6df13180fac2b2"],"state_sha256":"ad0b121b1b84cf39abd2b3c25095010099ad315e0fcd07e452e3f88a9e5a421f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EEC/ZbPoQaRlFHcUWmUR1l9u1wBHr3QbLJwRJnbs1dIk+2mBRFNQk60caf8Batbpp6B2OAI8ZcEXr1JE0qkKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T21:30:34.824799Z","bundle_sha256":"b8331b2870d04f3f2e3da3b9dcaf8d36facea60dd16ab806cff640b2891a5971"}}