{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UO5Y7BUSB5XVOZRD4TYUSAZ6FO","short_pith_number":"pith:UO5Y7BUS","canonical_record":{"source":{"id":"1906.11009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-26T12:04:55Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"c4a3f9950caf505b60c763a9f8595b469eb0823e7815ed15d4e8cdd38ca4bc0b","abstract_canon_sha256":"776f20ff58583de2a08bdcfcb3e130daac79362c690ff9eb0dbbf9996f9956b8"},"schema_version":"1.0"},"canonical_sha256":"a3bb8f86920f6f576623e4f149033e2bba25e3b30403021e1710a5db8a968454","source":{"kind":"arxiv","id":"1906.11009","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11009","created_at":"2026-05-17T23:42:10Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11009v1","created_at":"2026-05-17T23:42:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11009","created_at":"2026-05-17T23:42:10Z"},{"alias_kind":"pith_short_12","alias_value":"UO5Y7BUSB5XV","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UO5Y7BUSB5XVOZRD","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UO5Y7BUS","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UO5Y7BUSB5XVOZRD4TYUSAZ6FO","target":"record","payload":{"canonical_record":{"source":{"id":"1906.11009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-26T12:04:55Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"c4a3f9950caf505b60c763a9f8595b469eb0823e7815ed15d4e8cdd38ca4bc0b","abstract_canon_sha256":"776f20ff58583de2a08bdcfcb3e130daac79362c690ff9eb0dbbf9996f9956b8"},"schema_version":"1.0"},"canonical_sha256":"a3bb8f86920f6f576623e4f149033e2bba25e3b30403021e1710a5db8a968454","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:10.297339Z","signature_b64":"Wm8DGfQ5pDnjN5N3ltb52rqhNILrjhiwrlsWZtMT3JUh3OS3ayqz6XJhJq/tjLhTDtfwzE/VlEykko57QDHPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3bb8f86920f6f576623e4f149033e2bba25e3b30403021e1710a5db8a968454","last_reissued_at":"2026-05-17T23:42:10.296746Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:10.296746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.11009","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:42:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i8VlMfh7/D5fiRaaxzzL3T6MAQbqBNTELuHgHnf9DntmRJkEngqSH16ahRA1qskgnaBYXed+RDc7eOgGdOC/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:22:20.987850Z"},"content_sha256":"226b9d11ae691d7aafa61a13757823ed16858413c585268fb53f9426889318d4","schema_version":"1.0","event_id":"sha256:226b9d11ae691d7aafa61a13757823ed16858413c585268fb53f9426889318d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UO5Y7BUSB5XVOZRD4TYUSAZ6FO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Median Graph via Iterative Alternate Minimizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.CV","authors_text":"Benoit Ga\\\"uz\\`ere (LITIS), Luc Brun, Nicolas Boria, S'ebastien Bougleux","submitted_at":"2019-06-26T12:04:55Z","abstract_excerpt":"Computing a graph prototype may constitute a core element for clustering or classification tasks. However, its computation is an NP-Hard problem, even for simple classes of graphs. In this paper, we propose an efficient approach based on block coordinate descent to compute a generalized median graph from a set of graphs. This approach relies on a clear definition of the optimization process and handles labeling on both edges and nodes. This iterative process optimizes the edit operations to perform on a graph alternatively on nodes and edges. Several experiments on different datasets show the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11009","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:42:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tlD3Z/Rm56n5N5DRqstqvzonQCc4rhdzRD6ku7iACbB2sCSq9DNjT2x2I5znLUc2CtEz5DslN6EjJuEM11KNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:22:20.988194Z"},"content_sha256":"4f246d159a122200b8dfaad99c0ec2d648c3f3dccc1ec2a0c640d924d0633f49","schema_version":"1.0","event_id":"sha256:4f246d159a122200b8dfaad99c0ec2d648c3f3dccc1ec2a0c640d924d0633f49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UO5Y7BUSB5XVOZRD4TYUSAZ6FO/bundle.json","state_url":"https://pith.science/pith/UO5Y7BUSB5XVOZRD4TYUSAZ6FO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UO5Y7BUSB5XVOZRD4TYUSAZ6FO/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-12T05:22:20Z","links":{"resolver":"https://pith.science/pith/UO5Y7BUSB5XVOZRD4TYUSAZ6FO","bundle":"https://pith.science/pith/UO5Y7BUSB5XVOZRD4TYUSAZ6FO/bundle.json","state":"https://pith.science/pith/UO5Y7BUSB5XVOZRD4TYUSAZ6FO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UO5Y7BUSB5XVOZRD4TYUSAZ6FO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UO5Y7BUSB5XVOZRD4TYUSAZ6FO","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":"776f20ff58583de2a08bdcfcb3e130daac79362c690ff9eb0dbbf9996f9956b8","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-26T12:04:55Z","title_canon_sha256":"c4a3f9950caf505b60c763a9f8595b469eb0823e7815ed15d4e8cdd38ca4bc0b"},"schema_version":"1.0","source":{"id":"1906.11009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11009","created_at":"2026-05-17T23:42:10Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11009v1","created_at":"2026-05-17T23:42:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11009","created_at":"2026-05-17T23:42:10Z"},{"alias_kind":"pith_short_12","alias_value":"UO5Y7BUSB5XV","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UO5Y7BUSB5XVOZRD","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UO5Y7BUS","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:4f246d159a122200b8dfaad99c0ec2d648c3f3dccc1ec2a0c640d924d0633f49","target":"graph","created_at":"2026-05-17T23:42:10Z","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":"Computing a graph prototype may constitute a core element for clustering or classification tasks. However, its computation is an NP-Hard problem, even for simple classes of graphs. In this paper, we propose an efficient approach based on block coordinate descent to compute a generalized median graph from a set of graphs. This approach relies on a clear definition of the optimization process and handles labeling on both edges and nodes. This iterative process optimizes the edit operations to perform on a graph alternatively on nodes and edges. Several experiments on different datasets show the ","authors_text":"Benoit Ga\\\"uz\\`ere (LITIS), Luc Brun, Nicolas Boria, S'ebastien Bougleux","cross_cats":["q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-26T12:04:55Z","title":"Generalized Median Graph via Iterative Alternate Minimizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11009","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:226b9d11ae691d7aafa61a13757823ed16858413c585268fb53f9426889318d4","target":"record","created_at":"2026-05-17T23:42:10Z","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":"776f20ff58583de2a08bdcfcb3e130daac79362c690ff9eb0dbbf9996f9956b8","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-26T12:04:55Z","title_canon_sha256":"c4a3f9950caf505b60c763a9f8595b469eb0823e7815ed15d4e8cdd38ca4bc0b"},"schema_version":"1.0","source":{"id":"1906.11009","kind":"arxiv","version":1}},"canonical_sha256":"a3bb8f86920f6f576623e4f149033e2bba25e3b30403021e1710a5db8a968454","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3bb8f86920f6f576623e4f149033e2bba25e3b30403021e1710a5db8a968454","first_computed_at":"2026-05-17T23:42:10.296746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:10.296746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wm8DGfQ5pDnjN5N3ltb52rqhNILrjhiwrlsWZtMT3JUh3OS3ayqz6XJhJq/tjLhTDtfwzE/VlEykko57QDHPDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:10.297339Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.11009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:226b9d11ae691d7aafa61a13757823ed16858413c585268fb53f9426889318d4","sha256:4f246d159a122200b8dfaad99c0ec2d648c3f3dccc1ec2a0c640d924d0633f49"],"state_sha256":"30a02a6f0bc70c29e7e6f2edc427b02c1e4af632e5e1e57d0a71146e04246de9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2z/AIaQ8ulT6ETSBpVgnzLG7DN9rbP/N/Ft40G18HgijC3c/Hji1t2lNG1WQAI2obi2Qt245+aybMekQZBEPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T05:22:20.991270Z","bundle_sha256":"12c7c569a2fe5b55ff60e430be67e3f85230b65d02186c4febc881055fe12628"}}