{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:E3J6I6UG4JGLH2WV4W6YWMPOLQ","short_pith_number":"pith:E3J6I6UG","canonical_record":{"source":{"id":"1510.03409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-12T19:45:51Z","cross_cats_sorted":[],"title_canon_sha256":"299a77660f181bdca0865b823466f48ff4f607b187b1bc70c1fe019c5fe858a9","abstract_canon_sha256":"afa6949b1ed47c00be073284fa2cbfefd7ea737f30480fd09047c0755dd83acd"},"schema_version":"1.0"},"canonical_sha256":"26d3e47a86e24cb3ead5e5bd8b31ee5c3f3b6fdcadcbd274add7955f74c1583b","source":{"kind":"arxiv","id":"1510.03409","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03409","created_at":"2026-05-18T01:30:26Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03409v1","created_at":"2026-05-18T01:30:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03409","created_at":"2026-05-18T01:30:26Z"},{"alias_kind":"pith_short_12","alias_value":"E3J6I6UG4JGL","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E3J6I6UG4JGLH2WV","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E3J6I6UG","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:E3J6I6UG4JGLH2WV4W6YWMPOLQ","target":"record","payload":{"canonical_record":{"source":{"id":"1510.03409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-12T19:45:51Z","cross_cats_sorted":[],"title_canon_sha256":"299a77660f181bdca0865b823466f48ff4f607b187b1bc70c1fe019c5fe858a9","abstract_canon_sha256":"afa6949b1ed47c00be073284fa2cbfefd7ea737f30480fd09047c0755dd83acd"},"schema_version":"1.0"},"canonical_sha256":"26d3e47a86e24cb3ead5e5bd8b31ee5c3f3b6fdcadcbd274add7955f74c1583b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:26.359538Z","signature_b64":"eO5tK8TfDQJypSkxK2kp5LYau7iAmfm/Zf9pH8i8JuBbg5FBJRzIm/x2xiS1/QKBOob7kul+Mceql5hPMBIfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26d3e47a86e24cb3ead5e5bd8b31ee5c3f3b6fdcadcbd274add7955f74c1583b","last_reissued_at":"2026-05-18T01:30:26.358942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:26.358942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.03409","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-18T01:30:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/oLg2vopgIgNbcWbCu5U/BCYy+eQXYR2qZJxv2VOXQPuHDNkSQQNbb9rcf3NAOCqALTx7fJIodAMO1ZO8JOeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:51:32.681728Z"},"content_sha256":"bad59b06b87643d80c5443edfd105a10bf29653d106cee5befc3a38bcc2c8f7f","schema_version":"1.0","event_id":"sha256:bad59b06b87643d80c5443edfd105a10bf29653d106cee5befc3a38bcc2c8f7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:E3J6I6UG4JGLH2WV4W6YWMPOLQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LiteMat: a scalable, cost-efficient inference encoding scheme for large RDF graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Bernd Amann, Hubert Naacke, Olivier Cur\\'e, Tendry Randriamalala","submitted_at":"2015-10-12T19:45:51Z","abstract_excerpt":"The number of linked data sources and the size of the linked open data graph keep growing every day. As a consequence, semantic RDF services are more and more confronted with various \"big data\" problems. Query processing in the presence of inferences is one them. For instance, to complete the answer set of SPARQL queries, RDF database systems evaluate semantic RDFS relationships (subPropertyOf, subClassOf) through time-consuming query rewriting algorithms or space-consuming data materialization solutions. To reduce the memory footprint and ease the exchange of large datasets, these systems gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03409","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-18T01:30:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8YMcnXAQwSol553qQikCJzus10+hLSqu7L/B9+2gRA1YX7jM8jC21CBdevdN9/+le12LwCj3Benel3NeoAcSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:51:32.682410Z"},"content_sha256":"8d451cb8c7bb6d38dcf3a6d6747decc318183f3b2f407918fdb69dc265f5441a","schema_version":"1.0","event_id":"sha256:8d451cb8c7bb6d38dcf3a6d6747decc318183f3b2f407918fdb69dc265f5441a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3J6I6UG4JGLH2WV4W6YWMPOLQ/bundle.json","state_url":"https://pith.science/pith/E3J6I6UG4JGLH2WV4W6YWMPOLQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3J6I6UG4JGLH2WV4W6YWMPOLQ/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-07T18:51:32Z","links":{"resolver":"https://pith.science/pith/E3J6I6UG4JGLH2WV4W6YWMPOLQ","bundle":"https://pith.science/pith/E3J6I6UG4JGLH2WV4W6YWMPOLQ/bundle.json","state":"https://pith.science/pith/E3J6I6UG4JGLH2WV4W6YWMPOLQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3J6I6UG4JGLH2WV4W6YWMPOLQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E3J6I6UG4JGLH2WV4W6YWMPOLQ","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":"afa6949b1ed47c00be073284fa2cbfefd7ea737f30480fd09047c0755dd83acd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-12T19:45:51Z","title_canon_sha256":"299a77660f181bdca0865b823466f48ff4f607b187b1bc70c1fe019c5fe858a9"},"schema_version":"1.0","source":{"id":"1510.03409","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03409","created_at":"2026-05-18T01:30:26Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03409v1","created_at":"2026-05-18T01:30:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03409","created_at":"2026-05-18T01:30:26Z"},{"alias_kind":"pith_short_12","alias_value":"E3J6I6UG4JGL","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E3J6I6UG4JGLH2WV","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E3J6I6UG","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:8d451cb8c7bb6d38dcf3a6d6747decc318183f3b2f407918fdb69dc265f5441a","target":"graph","created_at":"2026-05-18T01:30:26Z","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":"The number of linked data sources and the size of the linked open data graph keep growing every day. As a consequence, semantic RDF services are more and more confronted with various \"big data\" problems. Query processing in the presence of inferences is one them. For instance, to complete the answer set of SPARQL queries, RDF database systems evaluate semantic RDFS relationships (subPropertyOf, subClassOf) through time-consuming query rewriting algorithms or space-consuming data materialization solutions. To reduce the memory footprint and ease the exchange of large datasets, these systems gen","authors_text":"Bernd Amann, Hubert Naacke, Olivier Cur\\'e, Tendry Randriamalala","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-12T19:45:51Z","title":"LiteMat: a scalable, cost-efficient inference encoding scheme for large RDF graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03409","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:bad59b06b87643d80c5443edfd105a10bf29653d106cee5befc3a38bcc2c8f7f","target":"record","created_at":"2026-05-18T01:30:26Z","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":"afa6949b1ed47c00be073284fa2cbfefd7ea737f30480fd09047c0755dd83acd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-12T19:45:51Z","title_canon_sha256":"299a77660f181bdca0865b823466f48ff4f607b187b1bc70c1fe019c5fe858a9"},"schema_version":"1.0","source":{"id":"1510.03409","kind":"arxiv","version":1}},"canonical_sha256":"26d3e47a86e24cb3ead5e5bd8b31ee5c3f3b6fdcadcbd274add7955f74c1583b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26d3e47a86e24cb3ead5e5bd8b31ee5c3f3b6fdcadcbd274add7955f74c1583b","first_computed_at":"2026-05-18T01:30:26.358942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:26.358942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eO5tK8TfDQJypSkxK2kp5LYau7iAmfm/Zf9pH8i8JuBbg5FBJRzIm/x2xiS1/QKBOob7kul+Mceql5hPMBIfAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:26.359538Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03409","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bad59b06b87643d80c5443edfd105a10bf29653d106cee5befc3a38bcc2c8f7f","sha256:8d451cb8c7bb6d38dcf3a6d6747decc318183f3b2f407918fdb69dc265f5441a"],"state_sha256":"44160305a40e0e411689c0fec74d0cfb9d33c34465c27d4ede6667add2425cd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jPTaN/iW+3Qs8PkNJ+0dd9cGt/EngsCXwc74Dk0NQ87M1ZIauerGzYAijCsqFVqvcT6Bp8ER0XKG2LHBnoMMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:51:32.685892Z","bundle_sha256":"8a547186518bfb92def58763ccc1f1816a09e655ab06146f12313ab27078d883"}}