{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4F27E3WEV2MNBVHGZV4WF2HHA6","short_pith_number":"pith:4F27E3WE","canonical_record":{"source":{"id":"1407.5488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-21T13:26:54Z","cross_cats_sorted":[],"title_canon_sha256":"a4e1a319239f83536f1612b3dd5c93089c450b8c12ae31332f4c73cf7a10183d","abstract_canon_sha256":"77a70e66363094d40959e2215a86e010209d5748c81387109012f2dee60ab15d"},"schema_version":"1.0"},"canonical_sha256":"e175f26ec4ae98d0d4e6cd7962e8e70799502a7e34c3fb89fbc73e987b678940","source":{"kind":"arxiv","id":"1407.5488","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5488","created_at":"2026-05-18T02:47:13Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5488v1","created_at":"2026-05-18T02:47:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5488","created_at":"2026-05-18T02:47:13Z"},{"alias_kind":"pith_short_12","alias_value":"4F27E3WEV2MN","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4F27E3WEV2MNBVHG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4F27E3WE","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4F27E3WEV2MNBVHGZV4WF2HHA6","target":"record","payload":{"canonical_record":{"source":{"id":"1407.5488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-21T13:26:54Z","cross_cats_sorted":[],"title_canon_sha256":"a4e1a319239f83536f1612b3dd5c93089c450b8c12ae31332f4c73cf7a10183d","abstract_canon_sha256":"77a70e66363094d40959e2215a86e010209d5748c81387109012f2dee60ab15d"},"schema_version":"1.0"},"canonical_sha256":"e175f26ec4ae98d0d4e6cd7962e8e70799502a7e34c3fb89fbc73e987b678940","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:13.924966Z","signature_b64":"AYBgxyR8eldY+juRaYBbebOVTwEW2dy2g/UaNZManwty3mNesysbrzBmwp94BmTZw0pscHa1+E2OfVp6Z0DlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e175f26ec4ae98d0d4e6cd7962e8e70799502a7e34c3fb89fbc73e987b678940","last_reissued_at":"2026-05-18T02:47:13.924307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:13.924307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.5488","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-18T02:47:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhaw/wgY2ZCC0nernr39wHWwfMTIaGVlp87YDYR3XvJqRh7cnV+riVCShQuDigAvY+vvOHrm5kjgCXVyeRZLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:13:54.270824Z"},"content_sha256":"c17957ebebaeadbea5e6f925752466ab737ff1e8b20f178f8e7579946ae72fcf","schema_version":"1.0","event_id":"sha256:c17957ebebaeadbea5e6f925752466ab737ff1e8b20f178f8e7579946ae72fcf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4F27E3WEV2MNBVHGZV4WF2HHA6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"L(2,1)-labelling of Circular-arc Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Anita Pal, Madhumangal Pal, Satyabrata Paul","submitted_at":"2014-07-21T13:26:54Z","abstract_excerpt":"An L(2,1)-labelling of a graph $G=(V, E)$ is $\\lambda_{2,1}(G)$ a function $f$ from the vertex set V (G) to the set of non-negative integers such that adjacent vertices get numbers at least two apart, and vertices at distance two get distinct numbers. The L(2,1)-labelling number denoted by $\\lambda_{2,1}(G)$ of $G$ is the minimum range of labels over all such labelling. In this article, it is shown that, for a circular-arc graph $G$, the upper bound of $\\lambda_{2,1}(G)$ is $\\Delta+3\\omega$, where $\\Delta$ and $\\omega$ represents the maximum degree of the vertices and size of maximum clique re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5488","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-18T02:47:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IqH/24p3YXfpO/neaUVi7D2bC2yQFJyBhbkmp0v4fdQFhsf8+ypJbPWD7YrbL5ldmhGLVIxyvo0h5ZAaJLFmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:13:54.271505Z"},"content_sha256":"1e792ee473cc7e86b282d003c5a7637a4648f2122742a117f7031582c865c648","schema_version":"1.0","event_id":"sha256:1e792ee473cc7e86b282d003c5a7637a4648f2122742a117f7031582c865c648"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4F27E3WEV2MNBVHGZV4WF2HHA6/bundle.json","state_url":"https://pith.science/pith/4F27E3WEV2MNBVHGZV4WF2HHA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4F27E3WEV2MNBVHGZV4WF2HHA6/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-08T16:13:54Z","links":{"resolver":"https://pith.science/pith/4F27E3WEV2MNBVHGZV4WF2HHA6","bundle":"https://pith.science/pith/4F27E3WEV2MNBVHGZV4WF2HHA6/bundle.json","state":"https://pith.science/pith/4F27E3WEV2MNBVHGZV4WF2HHA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4F27E3WEV2MNBVHGZV4WF2HHA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4F27E3WEV2MNBVHGZV4WF2HHA6","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":"77a70e66363094d40959e2215a86e010209d5748c81387109012f2dee60ab15d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-21T13:26:54Z","title_canon_sha256":"a4e1a319239f83536f1612b3dd5c93089c450b8c12ae31332f4c73cf7a10183d"},"schema_version":"1.0","source":{"id":"1407.5488","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5488","created_at":"2026-05-18T02:47:13Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5488v1","created_at":"2026-05-18T02:47:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5488","created_at":"2026-05-18T02:47:13Z"},{"alias_kind":"pith_short_12","alias_value":"4F27E3WEV2MN","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4F27E3WEV2MNBVHG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4F27E3WE","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:1e792ee473cc7e86b282d003c5a7637a4648f2122742a117f7031582c865c648","target":"graph","created_at":"2026-05-18T02:47: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":"An L(2,1)-labelling of a graph $G=(V, E)$ is $\\lambda_{2,1}(G)$ a function $f$ from the vertex set V (G) to the set of non-negative integers such that adjacent vertices get numbers at least two apart, and vertices at distance two get distinct numbers. The L(2,1)-labelling number denoted by $\\lambda_{2,1}(G)$ of $G$ is the minimum range of labels over all such labelling. In this article, it is shown that, for a circular-arc graph $G$, the upper bound of $\\lambda_{2,1}(G)$ is $\\Delta+3\\omega$, where $\\Delta$ and $\\omega$ represents the maximum degree of the vertices and size of maximum clique re","authors_text":"Anita Pal, Madhumangal Pal, Satyabrata Paul","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-21T13:26:54Z","title":"L(2,1)-labelling of Circular-arc Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5488","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:c17957ebebaeadbea5e6f925752466ab737ff1e8b20f178f8e7579946ae72fcf","target":"record","created_at":"2026-05-18T02:47: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":"77a70e66363094d40959e2215a86e010209d5748c81387109012f2dee60ab15d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-21T13:26:54Z","title_canon_sha256":"a4e1a319239f83536f1612b3dd5c93089c450b8c12ae31332f4c73cf7a10183d"},"schema_version":"1.0","source":{"id":"1407.5488","kind":"arxiv","version":1}},"canonical_sha256":"e175f26ec4ae98d0d4e6cd7962e8e70799502a7e34c3fb89fbc73e987b678940","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e175f26ec4ae98d0d4e6cd7962e8e70799502a7e34c3fb89fbc73e987b678940","first_computed_at":"2026-05-18T02:47:13.924307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:13.924307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AYBgxyR8eldY+juRaYBbebOVTwEW2dy2g/UaNZManwty3mNesysbrzBmwp94BmTZw0pscHa1+E2OfVp6Z0DlAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:13.924966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5488","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c17957ebebaeadbea5e6f925752466ab737ff1e8b20f178f8e7579946ae72fcf","sha256:1e792ee473cc7e86b282d003c5a7637a4648f2122742a117f7031582c865c648"],"state_sha256":"fda840b9129d07776bfdb79e90224caf1f3ad002455a6f60c15c8f325495ac61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yb1OcG3c8KvG6T1GORFkeUQlkmm2BGsm5mR94JqIFChwIYrzVW7p2v9JICn1bEb89y+08kg7qDxIMg1ZJkLoBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:13:54.275583Z","bundle_sha256":"e0923feffb0669d0b30889d1daf8fcb03e8196e65b68cf0f0b42d2d55b06e337"}}