{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EHVPPNZW6K4OSHH3MJLSYFYU7Q","short_pith_number":"pith:EHVPPNZW","schema_version":"1.0","canonical_sha256":"21eaf7b736f2b8e91cfb62572c1714fc12b82210a5dae4bbda273527cd1e45b8","source":{"kind":"arxiv","id":"1609.03765","version":1},"attestation_state":"computed","paper":{"title":"Graph Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ulle Endriss, Umberto Grandi","submitted_at":"2016-09-13T11:08:23Z","abstract_excerpt":"Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference orders), when consolidating conflicting views regarding the relationships between arguments in a debate (graphs as abstract argumentation frameworks), or when computing a consensus between several alternative clusterings of a given dataset (graphs as equivalence relations). In this paper, we introduce"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1609.03765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-13T11:08:23Z","cross_cats_sorted":[],"title_canon_sha256":"8ff903faaccf84535ed7d3addd6393cacee195bda211b667f93823cde434449b","abstract_canon_sha256":"4b0f0983fb66efc8dd8e4819c056eae0a73ffa0da6b62d74344145a548da01ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:38.118480Z","signature_b64":"egEgxiGTnrJyc3/FZM7t5fX3CdVQvrqkWXWz8k0Z/DX6rXdk4R7M0ankKywjVJEelxjx56s83A8FeW1KUe1ZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21eaf7b736f2b8e91cfb62572c1714fc12b82210a5dae4bbda273527cd1e45b8","last_reissued_at":"2026-05-18T00:13:38.117840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:38.117840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ulle Endriss, Umberto Grandi","submitted_at":"2016-09-13T11:08:23Z","abstract_excerpt":"Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference orders), when consolidating conflicting views regarding the relationships between arguments in a debate (graphs as abstract argumentation frameworks), or when computing a consensus between several alternative clusterings of a given dataset (graphs as equivalence relations). In this paper, we introduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03765","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.03765","created_at":"2026-05-18T00:13:38.117917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03765v1","created_at":"2026-05-18T00:13:38.117917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03765","created_at":"2026-05-18T00:13:38.117917+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHVPPNZW6K4O","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHVPPNZW6K4OSHH3","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHVPPNZW","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EHVPPNZW6K4OSHH3MJLSYFYU7Q","json":"https://pith.science/pith/EHVPPNZW6K4OSHH3MJLSYFYU7Q.json","graph_json":"https://pith.science/api/pith-number/EHVPPNZW6K4OSHH3MJLSYFYU7Q/graph.json","events_json":"https://pith.science/api/pith-number/EHVPPNZW6K4OSHH3MJLSYFYU7Q/events.json","paper":"https://pith.science/paper/EHVPPNZW"},"agent_actions":{"view_html":"https://pith.science/pith/EHVPPNZW6K4OSHH3MJLSYFYU7Q","download_json":"https://pith.science/pith/EHVPPNZW6K4OSHH3MJLSYFYU7Q.json","view_paper":"https://pith.science/paper/EHVPPNZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03765&json=true","fetch_graph":"https://pith.science/api/pith-number/EHVPPNZW6K4OSHH3MJLSYFYU7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/EHVPPNZW6K4OSHH3MJLSYFYU7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHVPPNZW6K4OSHH3MJLSYFYU7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHVPPNZW6K4OSHH3MJLSYFYU7Q/action/storage_attestation","attest_author":"https://pith.science/pith/EHVPPNZW6K4OSHH3MJLSYFYU7Q/action/author_attestation","sign_citation":"https://pith.science/pith/EHVPPNZW6K4OSHH3MJLSYFYU7Q/action/citation_signature","submit_replication":"https://pith.science/pith/EHVPPNZW6K4OSHH3MJLSYFYU7Q/action/replication_record"}},"created_at":"2026-05-18T00:13:38.117917+00:00","updated_at":"2026-05-18T00:13:38.117917+00:00"}