{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:62SH7OEPLXIY3TREDOGGT6GYHR","short_pith_number":"pith:62SH7OEP","canonical_record":{"source":{"id":"1009.2832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-09-15T04:26:32Z","cross_cats_sorted":[],"title_canon_sha256":"522229439de64d212d2d2e498e0a2ad046ced5d6b7c42cc0c4ab7437a6c595b5","abstract_canon_sha256":"23abac6733f9475519793bea8b070e5f1cefd4a502ff32e97320bd79fcd08f6b"},"schema_version":"1.0"},"canonical_sha256":"f6a47fb88f5dd18dce241b8c69f8d83c79967f92951c1085357c3047d468d5dd","source":{"kind":"arxiv","id":"1009.2832","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2832","created_at":"2026-05-18T04:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2832v1","created_at":"2026-05-18T04:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2832","created_at":"2026-05-18T04:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"62SH7OEPLXIY","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"62SH7OEPLXIY3TRE","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"62SH7OEP","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:62SH7OEPLXIY3TREDOGGT6GYHR","target":"record","payload":{"canonical_record":{"source":{"id":"1009.2832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-09-15T04:26:32Z","cross_cats_sorted":[],"title_canon_sha256":"522229439de64d212d2d2e498e0a2ad046ced5d6b7c42cc0c4ab7437a6c595b5","abstract_canon_sha256":"23abac6733f9475519793bea8b070e5f1cefd4a502ff32e97320bd79fcd08f6b"},"schema_version":"1.0"},"canonical_sha256":"f6a47fb88f5dd18dce241b8c69f8d83c79967f92951c1085357c3047d468d5dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:55.484147Z","signature_b64":"KD5DitW3lrGwRthqDtvJYDNZUUuAZnEtfn0sMraAQI269FD8Fr9IDd98lYD0Q92xvTXy/OWKgmfZkCtbwgfkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6a47fb88f5dd18dce241b8c69f8d83c79967f92951c1085357c3047d468d5dd","last_reissued_at":"2026-05-18T04:40:55.483474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:55.483474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.2832","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-18T04:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hWXjvGahs2POGaG7NAlD/UJFSc72T1uu6+hg2nVOmwPNU1AJqqgYPXf5wLWHk8AJP9OGW4wdBvQ4aj11pYCOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:50:25.162700Z"},"content_sha256":"a3683dadfea50308982d03a35e43ef173ff3b2290a0ac6546088289047543a07","schema_version":"1.0","event_id":"sha256:a3683dadfea50308982d03a35e43ef173ff3b2290a0ac6546088289047543a07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:62SH7OEPLXIY3TREDOGGT6GYHR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharing Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"K. R. Sahasranand, Nithin Nagaraj","submitted_at":"2010-09-15T04:26:32Z","abstract_excerpt":"Almost all known secret sharing schemes work on numbers. Such methods will have difficulty in sharing graphs since the number of graphs increases exponentially with the number of nodes. We propose a secret sharing scheme for graphs where we use graph intersection for reconstructing the secret which is hidden as a sub graph in the shares. Our method does not rely on heavy computational operations such as modular arithmetic or polynomial interpolation but makes use of very basic operations like assignment and checking for equality, and graph intersection can also be performed visually. In certai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2832","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-18T04:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6uBERqU9j8vYoN5/63hkf2RuKknlfZpMq4vdaVxz18YsPvMU2vsByhVMD8IKluCzT79pz7J2gI8BQkAGrO9CCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:50:25.163041Z"},"content_sha256":"83d5896b5c733cc2f59bdbaa745e5ddf065ffc08ab9254ee8f8c75058a8ed38f","schema_version":"1.0","event_id":"sha256:83d5896b5c733cc2f59bdbaa745e5ddf065ffc08ab9254ee8f8c75058a8ed38f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/62SH7OEPLXIY3TREDOGGT6GYHR/bundle.json","state_url":"https://pith.science/pith/62SH7OEPLXIY3TREDOGGT6GYHR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/62SH7OEPLXIY3TREDOGGT6GYHR/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-25T18:50:25Z","links":{"resolver":"https://pith.science/pith/62SH7OEPLXIY3TREDOGGT6GYHR","bundle":"https://pith.science/pith/62SH7OEPLXIY3TREDOGGT6GYHR/bundle.json","state":"https://pith.science/pith/62SH7OEPLXIY3TREDOGGT6GYHR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/62SH7OEPLXIY3TREDOGGT6GYHR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:62SH7OEPLXIY3TREDOGGT6GYHR","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":"23abac6733f9475519793bea8b070e5f1cefd4a502ff32e97320bd79fcd08f6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-09-15T04:26:32Z","title_canon_sha256":"522229439de64d212d2d2e498e0a2ad046ced5d6b7c42cc0c4ab7437a6c595b5"},"schema_version":"1.0","source":{"id":"1009.2832","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2832","created_at":"2026-05-18T04:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2832v1","created_at":"2026-05-18T04:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2832","created_at":"2026-05-18T04:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"62SH7OEPLXIY","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"62SH7OEPLXIY3TRE","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"62SH7OEP","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:83d5896b5c733cc2f59bdbaa745e5ddf065ffc08ab9254ee8f8c75058a8ed38f","target":"graph","created_at":"2026-05-18T04:40:55Z","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":"Almost all known secret sharing schemes work on numbers. Such methods will have difficulty in sharing graphs since the number of graphs increases exponentially with the number of nodes. We propose a secret sharing scheme for graphs where we use graph intersection for reconstructing the secret which is hidden as a sub graph in the shares. Our method does not rely on heavy computational operations such as modular arithmetic or polynomial interpolation but makes use of very basic operations like assignment and checking for equality, and graph intersection can also be performed visually. In certai","authors_text":"K. R. Sahasranand, Nithin Nagaraj","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-09-15T04:26:32Z","title":"Sharing Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2832","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:a3683dadfea50308982d03a35e43ef173ff3b2290a0ac6546088289047543a07","target":"record","created_at":"2026-05-18T04:40:55Z","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":"23abac6733f9475519793bea8b070e5f1cefd4a502ff32e97320bd79fcd08f6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-09-15T04:26:32Z","title_canon_sha256":"522229439de64d212d2d2e498e0a2ad046ced5d6b7c42cc0c4ab7437a6c595b5"},"schema_version":"1.0","source":{"id":"1009.2832","kind":"arxiv","version":1}},"canonical_sha256":"f6a47fb88f5dd18dce241b8c69f8d83c79967f92951c1085357c3047d468d5dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6a47fb88f5dd18dce241b8c69f8d83c79967f92951c1085357c3047d468d5dd","first_computed_at":"2026-05-18T04:40:55.483474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:55.483474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KD5DitW3lrGwRthqDtvJYDNZUUuAZnEtfn0sMraAQI269FD8Fr9IDd98lYD0Q92xvTXy/OWKgmfZkCtbwgfkAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:55.484147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.2832","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3683dadfea50308982d03a35e43ef173ff3b2290a0ac6546088289047543a07","sha256:83d5896b5c733cc2f59bdbaa745e5ddf065ffc08ab9254ee8f8c75058a8ed38f"],"state_sha256":"1c3505de6e174e2f6fba624d96fb1264cecaf5150070a5b92b56f1cf7b3c7f76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YL0z6kwPcor+8CG9kJmvaPY87LVCeTgxtd7+4ZoHo4C5sC67Mb5dstQriZXY0yttYkC+C66Zw9MoR92Ty9r+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:50:25.164985Z","bundle_sha256":"1471a69a47555cef574da95b77910ebcf960a1748dde1ea39cc69a3098f467b2"}}