{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JM2CWCPPAR62V67G3EVAUZKXFK","short_pith_number":"pith:JM2CWCPP","canonical_record":{"source":{"id":"1207.1591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2012-07-06T11:48:24Z","cross_cats_sorted":[],"title_canon_sha256":"81d0a3c20a5731808276108a093d90ca35fbe53fc0198efefbf9cc8fd33dddd7","abstract_canon_sha256":"50c24ee50c8c3aea4bae8be2cf9a3e0edd95a537aa0196326b4cf1e375d7c098"},"schema_version":"1.0"},"canonical_sha256":"4b342b09ef047daafbe6d92a0a65572ab3cd9d6fcb9a176a7c9133f7387c64de","source":{"kind":"arxiv","id":"1207.1591","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1591","created_at":"2026-05-18T03:51:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1591v1","created_at":"2026-05-18T03:51:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1591","created_at":"2026-05-18T03:51:36Z"},{"alias_kind":"pith_short_12","alias_value":"JM2CWCPPAR62","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JM2CWCPPAR62V67G","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JM2CWCPP","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JM2CWCPPAR62V67G3EVAUZKXFK","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2012-07-06T11:48:24Z","cross_cats_sorted":[],"title_canon_sha256":"81d0a3c20a5731808276108a093d90ca35fbe53fc0198efefbf9cc8fd33dddd7","abstract_canon_sha256":"50c24ee50c8c3aea4bae8be2cf9a3e0edd95a537aa0196326b4cf1e375d7c098"},"schema_version":"1.0"},"canonical_sha256":"4b342b09ef047daafbe6d92a0a65572ab3cd9d6fcb9a176a7c9133f7387c64de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:36.752234Z","signature_b64":"Img+5YF/PD7kIJZWZYkDb6uNRU8+mcpaF/AoyuKkJcNGMwEF1f8GXVapao7xBEQ/y8rPIs9ikpXX+V2Ig5twBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b342b09ef047daafbe6d92a0a65572ab3cd9d6fcb9a176a7c9133f7387c64de","last_reissued_at":"2026-05-18T03:51:36.751501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:36.751501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1591","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-18T03:51:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QFnoNVUjkyCJnCbrZbXqYvPR6kR/5RsYaKPGy3ITV8h0yRbMECRBnehf6hObScGxMX5jjWtVqSOdk35JevkMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:10:18.185092Z"},"content_sha256":"ee493de1580133de59541098863764fc6852d49e5e2aa6ff8aef31a932874aa1","schema_version":"1.0","event_id":"sha256:ee493de1580133de59541098863764fc6852d49e5e2aa6ff8aef31a932874aa1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JM2CWCPPAR62V67G3EVAUZKXFK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Secure Dynamic Job Scheduling on Smart Grid using RSA Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Ashim Roy, G. Sireesha, Ismatha Begum, P. Radha Krishna Reddy, S. Siva Ramaiah","submitted_at":"2012-07-06T11:48:24Z","abstract_excerpt":"Grid computing is a computation methodology using group of clusters connected over high-speed networks that involves coordinating and sharing computational power, data storage and network resources. Integrating a set of clusters of workstations into one large computing environment can improve the availability of computing power. The goal of scheduling is to achieve highest possible system throughput and to match the application need with the available computing resources. A secure scheduling model is presented, that performs job grouping activity at runtime. In a Grid environment, security is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1591","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-18T03:51:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FQz3Mb7vlsC6QOW48B6/jozqWMML9xJhEblSi4rO6lIpPxjeALwKK7QR4S23igjyhUkp6D86l9hFa3+SERmaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:10:18.185457Z"},"content_sha256":"ab3757c31e73dd1f867130b9113c543936c15510a079b9e879a241ce6d6dd403","schema_version":"1.0","event_id":"sha256:ab3757c31e73dd1f867130b9113c543936c15510a079b9e879a241ce6d6dd403"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JM2CWCPPAR62V67G3EVAUZKXFK/bundle.json","state_url":"https://pith.science/pith/JM2CWCPPAR62V67G3EVAUZKXFK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JM2CWCPPAR62V67G3EVAUZKXFK/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-05T12:10:18Z","links":{"resolver":"https://pith.science/pith/JM2CWCPPAR62V67G3EVAUZKXFK","bundle":"https://pith.science/pith/JM2CWCPPAR62V67G3EVAUZKXFK/bundle.json","state":"https://pith.science/pith/JM2CWCPPAR62V67G3EVAUZKXFK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JM2CWCPPAR62V67G3EVAUZKXFK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JM2CWCPPAR62V67G3EVAUZKXFK","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":"50c24ee50c8c3aea4bae8be2cf9a3e0edd95a537aa0196326b4cf1e375d7c098","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2012-07-06T11:48:24Z","title_canon_sha256":"81d0a3c20a5731808276108a093d90ca35fbe53fc0198efefbf9cc8fd33dddd7"},"schema_version":"1.0","source":{"id":"1207.1591","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1591","created_at":"2026-05-18T03:51:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1591v1","created_at":"2026-05-18T03:51:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1591","created_at":"2026-05-18T03:51:36Z"},{"alias_kind":"pith_short_12","alias_value":"JM2CWCPPAR62","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JM2CWCPPAR62V67G","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JM2CWCPP","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:ab3757c31e73dd1f867130b9113c543936c15510a079b9e879a241ce6d6dd403","target":"graph","created_at":"2026-05-18T03:51:36Z","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":"Grid computing is a computation methodology using group of clusters connected over high-speed networks that involves coordinating and sharing computational power, data storage and network resources. Integrating a set of clusters of workstations into one large computing environment can improve the availability of computing power. The goal of scheduling is to achieve highest possible system throughput and to match the application need with the available computing resources. A secure scheduling model is presented, that performs job grouping activity at runtime. In a Grid environment, security is ","authors_text":"Ashim Roy, G. Sireesha, Ismatha Begum, P. Radha Krishna Reddy, S. Siva Ramaiah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2012-07-06T11:48:24Z","title":"A Secure Dynamic Job Scheduling on Smart Grid using RSA Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1591","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:ee493de1580133de59541098863764fc6852d49e5e2aa6ff8aef31a932874aa1","target":"record","created_at":"2026-05-18T03:51:36Z","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":"50c24ee50c8c3aea4bae8be2cf9a3e0edd95a537aa0196326b4cf1e375d7c098","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2012-07-06T11:48:24Z","title_canon_sha256":"81d0a3c20a5731808276108a093d90ca35fbe53fc0198efefbf9cc8fd33dddd7"},"schema_version":"1.0","source":{"id":"1207.1591","kind":"arxiv","version":1}},"canonical_sha256":"4b342b09ef047daafbe6d92a0a65572ab3cd9d6fcb9a176a7c9133f7387c64de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b342b09ef047daafbe6d92a0a65572ab3cd9d6fcb9a176a7c9133f7387c64de","first_computed_at":"2026-05-18T03:51:36.751501Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:36.751501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Img+5YF/PD7kIJZWZYkDb6uNRU8+mcpaF/AoyuKkJcNGMwEF1f8GXVapao7xBEQ/y8rPIs9ikpXX+V2Ig5twBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:36.752234Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1591","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee493de1580133de59541098863764fc6852d49e5e2aa6ff8aef31a932874aa1","sha256:ab3757c31e73dd1f867130b9113c543936c15510a079b9e879a241ce6d6dd403"],"state_sha256":"f05ab8a34a50bee2033de6035ab55a9388b0ce6ebe730dc3a0699ab3903c7834"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"grP213Vmjsx5FBPB2QCOcpkR+V2x6oizUEU8HTeN4Bu5EgOs45g1wV4+6qmDhmvJX+VbLRpJH7XwifMgHNgwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:10:18.187549Z","bundle_sha256":"a73c4f9efd187939f3ac801d287ca306ef81be23e6addda4fc395f2719f29a73"}}