{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HXT4Q2CRC2HXUKVQMHNH2CURSE","short_pith_number":"pith:HXT4Q2CR","canonical_record":{"source":{"id":"1312.0001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-28T04:11:36Z","cross_cats_sorted":[],"title_canon_sha256":"e68e7ae98e5c43532f28822639ce028867cf5d126b079356d274e8a843cb4ad1","abstract_canon_sha256":"077cdf02f318e87b33ac051be6474b85081c6793144cd94dcd0c8b6721ee9d9b"},"schema_version":"1.0"},"canonical_sha256":"3de7c86851168f7a2ab061da7d0a919124a4279a7378a378032f4559badcc5dc","source":{"kind":"arxiv","id":"1312.0001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0001","created_at":"2026-05-18T03:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0001v1","created_at":"2026-05-18T03:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0001","created_at":"2026-05-18T03:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"HXT4Q2CRC2HX","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HXT4Q2CRC2HXUKVQ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HXT4Q2CR","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HXT4Q2CRC2HXUKVQMHNH2CURSE","target":"record","payload":{"canonical_record":{"source":{"id":"1312.0001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-28T04:11:36Z","cross_cats_sorted":[],"title_canon_sha256":"e68e7ae98e5c43532f28822639ce028867cf5d126b079356d274e8a843cb4ad1","abstract_canon_sha256":"077cdf02f318e87b33ac051be6474b85081c6793144cd94dcd0c8b6721ee9d9b"},"schema_version":"1.0"},"canonical_sha256":"3de7c86851168f7a2ab061da7d0a919124a4279a7378a378032f4559badcc5dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:47.123904Z","signature_b64":"22TCGQPpNocs/7FCixc991tPu9mkj/ypeiH7dfG4GQKoIEdfCVJBOY7/pCFs2aUD4WwVAJr7EVC+GoCg3LkmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3de7c86851168f7a2ab061da7d0a919124a4279a7378a378032f4559badcc5dc","last_reissued_at":"2026-05-18T03:05:47.123285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:47.123285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.0001","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:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/HnuhIg/IOj38xXrWFgpQi0miOwwF8E55xWt1FT6Y0UPFG5bY2opGPT8LSbB6x75kG8coH8XE09YJNvtzK/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:07:56.867116Z"},"content_sha256":"8af254904f8444a7cfe556f2953af37248213d37ba755e1adcb6dc3b4818f395","schema_version":"1.0","event_id":"sha256:8af254904f8444a7cfe556f2953af37248213d37ba755e1adcb6dc3b4818f395"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HXT4Q2CRC2HXUKVQMHNH2CURSE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Proposal for the Characterization of Multi-Dimensional Inter-relationships of RDF Graphs Based on Set Theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ayan Chakraborty, Debajyoti Mukhopadhyay, Shiladitya Munshi","submitted_at":"2013-11-28T04:11:36Z","abstract_excerpt":"In this paper a Set Theoretic approach has been reported for analyzing inter-relationship between any numbers of RDF Graphs. An RDF Graph represents triples in Resource Description Format of semantic web. So the identification and characterization of criteria for inter-relationship of RDF Graphs shows a new road in semantic search. Using set theoretic approach, a sound framing criteria can be designed that examine whether two RDF Graphs are related and if yes, how these relationships could be described with formal set theory. Along with this, by introducing RDF Schema, the inter-relationship s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0001","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:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WTkIVU+WkS1wB9LK7APuN2nQyq0C2SL5WgynFcjnaSWbTshWqVDtc/8tnT0hF+lwB08z5uLwZqUGTNFJMb8EDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:07:56.867490Z"},"content_sha256":"2b05760f31204c4d3c2bce2f682fe2e7b65ab54105d23d0bcfccf706d2913ba9","schema_version":"1.0","event_id":"sha256:2b05760f31204c4d3c2bce2f682fe2e7b65ab54105d23d0bcfccf706d2913ba9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXT4Q2CRC2HXUKVQMHNH2CURSE/bundle.json","state_url":"https://pith.science/pith/HXT4Q2CRC2HXUKVQMHNH2CURSE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXT4Q2CRC2HXUKVQMHNH2CURSE/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-26T10:07:56Z","links":{"resolver":"https://pith.science/pith/HXT4Q2CRC2HXUKVQMHNH2CURSE","bundle":"https://pith.science/pith/HXT4Q2CRC2HXUKVQMHNH2CURSE/bundle.json","state":"https://pith.science/pith/HXT4Q2CRC2HXUKVQMHNH2CURSE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXT4Q2CRC2HXUKVQMHNH2CURSE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HXT4Q2CRC2HXUKVQMHNH2CURSE","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":"077cdf02f318e87b33ac051be6474b85081c6793144cd94dcd0c8b6721ee9d9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-28T04:11:36Z","title_canon_sha256":"e68e7ae98e5c43532f28822639ce028867cf5d126b079356d274e8a843cb4ad1"},"schema_version":"1.0","source":{"id":"1312.0001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0001","created_at":"2026-05-18T03:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0001v1","created_at":"2026-05-18T03:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0001","created_at":"2026-05-18T03:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"HXT4Q2CRC2HX","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HXT4Q2CRC2HXUKVQ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HXT4Q2CR","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:2b05760f31204c4d3c2bce2f682fe2e7b65ab54105d23d0bcfccf706d2913ba9","target":"graph","created_at":"2026-05-18T03:05:47Z","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":"In this paper a Set Theoretic approach has been reported for analyzing inter-relationship between any numbers of RDF Graphs. An RDF Graph represents triples in Resource Description Format of semantic web. So the identification and characterization of criteria for inter-relationship of RDF Graphs shows a new road in semantic search. Using set theoretic approach, a sound framing criteria can be designed that examine whether two RDF Graphs are related and if yes, how these relationships could be described with formal set theory. Along with this, by introducing RDF Schema, the inter-relationship s","authors_text":"Ayan Chakraborty, Debajyoti Mukhopadhyay, Shiladitya Munshi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-28T04:11:36Z","title":"A Proposal for the Characterization of Multi-Dimensional Inter-relationships of RDF Graphs Based on Set Theoretic Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0001","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:8af254904f8444a7cfe556f2953af37248213d37ba755e1adcb6dc3b4818f395","target":"record","created_at":"2026-05-18T03:05:47Z","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":"077cdf02f318e87b33ac051be6474b85081c6793144cd94dcd0c8b6721ee9d9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-28T04:11:36Z","title_canon_sha256":"e68e7ae98e5c43532f28822639ce028867cf5d126b079356d274e8a843cb4ad1"},"schema_version":"1.0","source":{"id":"1312.0001","kind":"arxiv","version":1}},"canonical_sha256":"3de7c86851168f7a2ab061da7d0a919124a4279a7378a378032f4559badcc5dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3de7c86851168f7a2ab061da7d0a919124a4279a7378a378032f4559badcc5dc","first_computed_at":"2026-05-18T03:05:47.123285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:47.123285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"22TCGQPpNocs/7FCixc991tPu9mkj/ypeiH7dfG4GQKoIEdfCVJBOY7/pCFs2aUD4WwVAJr7EVC+GoCg3LkmDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:47.123904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8af254904f8444a7cfe556f2953af37248213d37ba755e1adcb6dc3b4818f395","sha256:2b05760f31204c4d3c2bce2f682fe2e7b65ab54105d23d0bcfccf706d2913ba9"],"state_sha256":"a266c7dd44b4aa2a3bed281e9deb9dcc94f1946d2289b7f72c8cb8c10df0aee5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C1krNT96rAwIm6dkOyw/0pyZ/X/z0VW1/Ugd79MxM3CNQ4P52yn0Kc6moAs+mZPdMoh3ZDWC50x/hkai0K+BCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T10:07:56.869370Z","bundle_sha256":"462386a12e6c62c37d88b004684f3001e4f9ef0c2d3b836caaff1f995c6f3963"}}