{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QGLLRLQLGACEHPVOGKB6WYQHRE","short_pith_number":"pith:QGLLRLQL","canonical_record":{"source":{"id":"1304.5378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-19T11:32:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4c5c63537237a43423175d623f097d23427afc3d1d9623347975150c1e9b229a","abstract_canon_sha256":"80679728fcc82ed914b102ec6958d7b1a97c1b58c19185a65592892441c55591"},"schema_version":"1.0"},"canonical_sha256":"8196b8ae0b300443beae3283eb620789078998bfdb7d3b562a522837e1a041bc","source":{"kind":"arxiv","id":"1304.5378","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5378","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5378v2","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5378","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"QGLLRLQLGACE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QGLLRLQLGACEHPVO","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QGLLRLQL","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QGLLRLQLGACEHPVOGKB6WYQHRE","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-19T11:32:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4c5c63537237a43423175d623f097d23427afc3d1d9623347975150c1e9b229a","abstract_canon_sha256":"80679728fcc82ed914b102ec6958d7b1a97c1b58c19185a65592892441c55591"},"schema_version":"1.0"},"canonical_sha256":"8196b8ae0b300443beae3283eb620789078998bfdb7d3b562a522837e1a041bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:13.227238Z","signature_b64":"8S2XpjbOEs1udLr39eePBpnXELpbaQbGFDHnwgseLFD1AmgCMfWwdimYHD7baGWoWHlFtEh5XfNFr5mgx1KeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8196b8ae0b300443beae3283eb620789078998bfdb7d3b562a522837e1a041bc","last_reissued_at":"2026-05-18T03:27:13.226524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:13.226524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5378","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-18T03:27:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQCMysxW4H3uYzsGlJAoJK5/tt7SHeLFZtpgSNyu20vjJEwkUBZdMbzPVok6PLrWZsIhqshGk/dXGvM/Y7diCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:20:35.172621Z"},"content_sha256":"c84d4b8797a8f4e03c0f90c0f0af2052020efc6636ba948ef47c12f1d0b69b6e","schema_version":"1.0","event_id":"sha256:c84d4b8797a8f4e03c0f90c0f0af2052020efc6636ba948ef47c12f1d0b69b6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QGLLRLQLGACEHPVOGKB6WYQHRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fair Sets of Some Class of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Kannan Balakrishnan, Prasanth G. Narasimha-Shenoi, R. Ram Kumar","submitted_at":"2013-04-19T11:32:42Z","abstract_excerpt":"Given a non empty set $S$ of vertices of a graph, the partiality of a vertex with respect to $S$ is the difference between maximum and minimum of the distances of the vertex to the vertices of $S$. The vertices with minimum partiality constitute the fair center of the set. Any vertex set which is the fair center of some set of vertices is called a fair set. In this paper we prove that the induced subgraph of any fair set is connected in the case of trees and characterise block graphs as the class of chordal graphs for which the induced subgraph of all fair sets are connected. The fair sets of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5378","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-18T03:27:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WMqv55iga2G3PpUo3EyJfdwa+WjWGbjtYKw+PAOy9b4aLfPOgh3sQTrBZDs9R8jGsOpx+JCzSSo8W8LAAqPiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:20:35.172965Z"},"content_sha256":"2805370cb5349d2874b2272791fefcc2549cf33e4e1b45faca5c2ac85a738e2a","schema_version":"1.0","event_id":"sha256:2805370cb5349d2874b2272791fefcc2549cf33e4e1b45faca5c2ac85a738e2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QGLLRLQLGACEHPVOGKB6WYQHRE/bundle.json","state_url":"https://pith.science/pith/QGLLRLQLGACEHPVOGKB6WYQHRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QGLLRLQLGACEHPVOGKB6WYQHRE/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-05T09:20:35Z","links":{"resolver":"https://pith.science/pith/QGLLRLQLGACEHPVOGKB6WYQHRE","bundle":"https://pith.science/pith/QGLLRLQLGACEHPVOGKB6WYQHRE/bundle.json","state":"https://pith.science/pith/QGLLRLQLGACEHPVOGKB6WYQHRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QGLLRLQLGACEHPVOGKB6WYQHRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QGLLRLQLGACEHPVOGKB6WYQHRE","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":"80679728fcc82ed914b102ec6958d7b1a97c1b58c19185a65592892441c55591","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-19T11:32:42Z","title_canon_sha256":"4c5c63537237a43423175d623f097d23427afc3d1d9623347975150c1e9b229a"},"schema_version":"1.0","source":{"id":"1304.5378","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5378","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5378v2","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5378","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"QGLLRLQLGACE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QGLLRLQLGACEHPVO","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QGLLRLQL","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:2805370cb5349d2874b2272791fefcc2549cf33e4e1b45faca5c2ac85a738e2a","target":"graph","created_at":"2026-05-18T03:27:13Z","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":"Given a non empty set $S$ of vertices of a graph, the partiality of a vertex with respect to $S$ is the difference between maximum and minimum of the distances of the vertex to the vertices of $S$. The vertices with minimum partiality constitute the fair center of the set. Any vertex set which is the fair center of some set of vertices is called a fair set. In this paper we prove that the induced subgraph of any fair set is connected in the case of trees and characterise block graphs as the class of chordal graphs for which the induced subgraph of all fair sets are connected. The fair sets of ","authors_text":"Kannan Balakrishnan, Prasanth G. Narasimha-Shenoi, R. Ram Kumar","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-19T11:32:42Z","title":"Fair Sets of Some Class of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5378","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:c84d4b8797a8f4e03c0f90c0f0af2052020efc6636ba948ef47c12f1d0b69b6e","target":"record","created_at":"2026-05-18T03:27:13Z","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":"80679728fcc82ed914b102ec6958d7b1a97c1b58c19185a65592892441c55591","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-19T11:32:42Z","title_canon_sha256":"4c5c63537237a43423175d623f097d23427afc3d1d9623347975150c1e9b229a"},"schema_version":"1.0","source":{"id":"1304.5378","kind":"arxiv","version":2}},"canonical_sha256":"8196b8ae0b300443beae3283eb620789078998bfdb7d3b562a522837e1a041bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8196b8ae0b300443beae3283eb620789078998bfdb7d3b562a522837e1a041bc","first_computed_at":"2026-05-18T03:27:13.226524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:13.226524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8S2XpjbOEs1udLr39eePBpnXELpbaQbGFDHnwgseLFD1AmgCMfWwdimYHD7baGWoWHlFtEh5XfNFr5mgx1KeAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:13.227238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5378","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c84d4b8797a8f4e03c0f90c0f0af2052020efc6636ba948ef47c12f1d0b69b6e","sha256:2805370cb5349d2874b2272791fefcc2549cf33e4e1b45faca5c2ac85a738e2a"],"state_sha256":"4d749856478f80eada0e538295388a8a6f79ab2b0bca6df6990137f47d840bdb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QwTY4QcMb7XiE9XKLDdY++/7+dgELcvunKdK5jT9PHBbD05NDpZvVxzrfZVdhdg52T4xmXmOIoZ0qtf7PJaqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:20:35.174875Z","bundle_sha256":"dadd6017860f255057b6ba062a340c1879118fe1c0a83539eabfd057a14beeb9"}}