{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RNYUVCTKSLAPCTXZNFW5G4DAIS","short_pith_number":"pith:RNYUVCTK","canonical_record":{"source":{"id":"1907.10492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-22T03:13:22Z","cross_cats_sorted":["cs.AI","cs.DB","cs.GT"],"title_canon_sha256":"aa1d177dea77d2f4c2d10baca36e2a6c3be98ae70b5c19208f4238d3a5debabe","abstract_canon_sha256":"97b7f57a2119b1558b195f4d121d4d300cc7885d4da2ee079b83af76e638c54f"},"schema_version":"1.0"},"canonical_sha256":"8b714a8a6a92c0f14ef9696dd37060449ca7d834e42244e3b0fcfa3c0396b9a2","source":{"kind":"arxiv","id":"1907.10492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10492","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10492v1","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10492","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"pith_short_12","alias_value":"RNYUVCTKSLAP","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RNYUVCTKSLAPCTXZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RNYUVCTK","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RNYUVCTKSLAPCTXZNFW5G4DAIS","target":"record","payload":{"canonical_record":{"source":{"id":"1907.10492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-22T03:13:22Z","cross_cats_sorted":["cs.AI","cs.DB","cs.GT"],"title_canon_sha256":"aa1d177dea77d2f4c2d10baca36e2a6c3be98ae70b5c19208f4238d3a5debabe","abstract_canon_sha256":"97b7f57a2119b1558b195f4d121d4d300cc7885d4da2ee079b83af76e638c54f"},"schema_version":"1.0"},"canonical_sha256":"8b714a8a6a92c0f14ef9696dd37060449ca7d834e42244e3b0fcfa3c0396b9a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:37.754682Z","signature_b64":"oeXKSIhYa3is+z59y7QyobKfgMiXnfu+iGbLvAkTX4Xzkp4WpyXnyVjD9ftoYIKJ6iL8+ET/UVY1GU/RW1faBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b714a8a6a92c0f14ef9696dd37060449ca7d834e42244e3b0fcfa3c0396b9a2","last_reissued_at":"2026-05-17T23:39:37.754194Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:37.754194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.10492","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-17T23:39:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zxBqh8Tf84l9swuy+d1+GjY3MxEHpGFPPjMzR8TatI6ZzZkD7QWskbeZW92pxRSbpP4NU7ygAh8NPYaBePToAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:08:50.776153Z"},"content_sha256":"5f68f067379e5bbdd468bb2a78734d0f50eb6a6a892a828f0ac9f02a91f26435","schema_version":"1.0","event_id":"sha256:5f68f067379e5bbdd468bb2a78734d0f50eb6a6a892a828f0ac9f02a91f26435"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RNYUVCTKSLAPCTXZNFW5G4DAIS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Social Choice Methods for Database Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB","cs.GT"],"primary_cat":"cs.LO","authors_text":"France), Francesco Belardinelli (Department of Computing, Imperial College London, Laboratoire IBISC, UK, Umberto Grandi (IRIT, University of Evry, University of Toulouse","submitted_at":"2019-07-22T03:13:22Z","abstract_excerpt":"Knowledge can be represented compactly in multiple ways, from a set of propositional formulas, to a Kripke model, to a database. In this paper we study the aggregation of information coming from multiple sources, each source submitting a database modelled as a first-order relational structure. In the presence of integrity constraints, we identify classes of aggregators that respect them in the aggregated database, provided these are satisfied in all individual databases. We also characterise languages for first-order queries on which the answer to a query on the aggregated database coincides w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10492","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-17T23:39:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gty5R7K8vDQ2rKCAEMaZszPNRaGfXWi1mKXBAvKY1JMnGRlJeneSAt5/KGrwoOpTuQP0JjLPKkyCkhQdXfq9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:08:50.776523Z"},"content_sha256":"83495b68b0766c39a119e5d851eb2fff48b028c4d5a62bd84e9194fe029756c6","schema_version":"1.0","event_id":"sha256:83495b68b0766c39a119e5d851eb2fff48b028c4d5a62bd84e9194fe029756c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNYUVCTKSLAPCTXZNFW5G4DAIS/bundle.json","state_url":"https://pith.science/pith/RNYUVCTKSLAPCTXZNFW5G4DAIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNYUVCTKSLAPCTXZNFW5G4DAIS/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-05-29T21:08:50Z","links":{"resolver":"https://pith.science/pith/RNYUVCTKSLAPCTXZNFW5G4DAIS","bundle":"https://pith.science/pith/RNYUVCTKSLAPCTXZNFW5G4DAIS/bundle.json","state":"https://pith.science/pith/RNYUVCTKSLAPCTXZNFW5G4DAIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNYUVCTKSLAPCTXZNFW5G4DAIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RNYUVCTKSLAPCTXZNFW5G4DAIS","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":"97b7f57a2119b1558b195f4d121d4d300cc7885d4da2ee079b83af76e638c54f","cross_cats_sorted":["cs.AI","cs.DB","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-22T03:13:22Z","title_canon_sha256":"aa1d177dea77d2f4c2d10baca36e2a6c3be98ae70b5c19208f4238d3a5debabe"},"schema_version":"1.0","source":{"id":"1907.10492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10492","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10492v1","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10492","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"pith_short_12","alias_value":"RNYUVCTKSLAP","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RNYUVCTKSLAPCTXZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RNYUVCTK","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:83495b68b0766c39a119e5d851eb2fff48b028c4d5a62bd84e9194fe029756c6","target":"graph","created_at":"2026-05-17T23:39:37Z","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":"Knowledge can be represented compactly in multiple ways, from a set of propositional formulas, to a Kripke model, to a database. In this paper we study the aggregation of information coming from multiple sources, each source submitting a database modelled as a first-order relational structure. In the presence of integrity constraints, we identify classes of aggregators that respect them in the aggregated database, provided these are satisfied in all individual databases. We also characterise languages for first-order queries on which the answer to a query on the aggregated database coincides w","authors_text":"France), Francesco Belardinelli (Department of Computing, Imperial College London, Laboratoire IBISC, UK, Umberto Grandi (IRIT, University of Evry, University of Toulouse","cross_cats":["cs.AI","cs.DB","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-22T03:13:22Z","title":"Social Choice Methods for Database Aggregation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10492","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:5f68f067379e5bbdd468bb2a78734d0f50eb6a6a892a828f0ac9f02a91f26435","target":"record","created_at":"2026-05-17T23:39:37Z","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":"97b7f57a2119b1558b195f4d121d4d300cc7885d4da2ee079b83af76e638c54f","cross_cats_sorted":["cs.AI","cs.DB","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-22T03:13:22Z","title_canon_sha256":"aa1d177dea77d2f4c2d10baca36e2a6c3be98ae70b5c19208f4238d3a5debabe"},"schema_version":"1.0","source":{"id":"1907.10492","kind":"arxiv","version":1}},"canonical_sha256":"8b714a8a6a92c0f14ef9696dd37060449ca7d834e42244e3b0fcfa3c0396b9a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b714a8a6a92c0f14ef9696dd37060449ca7d834e42244e3b0fcfa3c0396b9a2","first_computed_at":"2026-05-17T23:39:37.754194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:37.754194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oeXKSIhYa3is+z59y7QyobKfgMiXnfu+iGbLvAkTX4Xzkp4WpyXnyVjD9ftoYIKJ6iL8+ET/UVY1GU/RW1faBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:37.754682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.10492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f68f067379e5bbdd468bb2a78734d0f50eb6a6a892a828f0ac9f02a91f26435","sha256:83495b68b0766c39a119e5d851eb2fff48b028c4d5a62bd84e9194fe029756c6"],"state_sha256":"0dd41c3e8a14ab0ef72281f5387865e40b2d7c74c2137b01021322492e280292"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n9CCgmbazV2nfSG9iC5Bfsx2IMBRmuB7gjAeyixULUwzFQfT6HD2bUZUCRHQtS1a6rzDwpgNonPN8q7TyXxBBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:08:50.778614Z","bundle_sha256":"d2a5dfbcd1dd0429b59e3ba5960fcdd1261e85507faf0b3521812cc9e049cae8"}}