{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3D4P6FBD7SG4KS26GHX2KMVVOU","short_pith_number":"pith:3D4P6FBD","schema_version":"1.0","canonical_sha256":"d8f8ff1423fc8dc54b5e31efa532b575331b542f04b168703451c503d741e5f8","source":{"kind":"arxiv","id":"2502.00038","version":3},"attestation_state":"computed","paper":{"title":"The Spectral Barycentre of a Set of Graphs with Community Structure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","physics.data-an","stat.ML"],"primary_cat":"cs.SI","authors_text":"Fran\\c{c}ois G. Meyer","submitted_at":"2025-01-26T05:02:54Z","abstract_excerpt":"The notion of barycentre graph is of crucial importance for machine learning algorithms that process graph-valued data. The barycentre graph is a \"summary graph\" that captures the mean topology and connectivity structure of a training dataset of graphs. The construction of a barycentre requires the definition of a metric to quantify distances between pairs of graphs. In this work, we use a multiscale spectral distance that is defined using the eigenvalues of the normalized graph Laplacian. The eigenvalues -- but not the eigenvectors -- of the normalized Laplacian of the barycentre graph can be"},"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":"2502.00038","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2025-01-26T05:02:54Z","cross_cats_sorted":["cs.LG","physics.data-an","stat.ML"],"title_canon_sha256":"76d222da45cefd69740952d5040ff5db7f1f1eb307abfd2460da02f11e48f98e","abstract_canon_sha256":"b24b48e1821b3012423075da15fdc0cc4f8e488af771db04f4478b026fd4ac5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:17.341440Z","signature_b64":"VxTAYl1yx81dO9DQWs08VcVWrtZXZrE/sVCEusqxM9bpx11ubRXjM5VlJ9vt9++qt4Q8xpQtrY1SBlAZBwWiBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8f8ff1423fc8dc54b5e31efa532b575331b542f04b168703451c503d741e5f8","last_reissued_at":"2026-07-05T11:56:17.340969Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:17.340969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Spectral Barycentre of a Set of Graphs with Community Structure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","physics.data-an","stat.ML"],"primary_cat":"cs.SI","authors_text":"Fran\\c{c}ois G. Meyer","submitted_at":"2025-01-26T05:02:54Z","abstract_excerpt":"The notion of barycentre graph is of crucial importance for machine learning algorithms that process graph-valued data. The barycentre graph is a \"summary graph\" that captures the mean topology and connectivity structure of a training dataset of graphs. The construction of a barycentre requires the definition of a metric to quantify distances between pairs of graphs. In this work, we use a multiscale spectral distance that is defined using the eigenvalues of the normalized graph Laplacian. The eigenvalues -- but not the eigenvectors -- of the normalized Laplacian of the barycentre graph can be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00038","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.00038/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.00038","created_at":"2026-07-05T11:56:17.341019+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.00038v3","created_at":"2026-07-05T11:56:17.341019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00038","created_at":"2026-07-05T11:56:17.341019+00:00"},{"alias_kind":"pith_short_12","alias_value":"3D4P6FBD7SG4","created_at":"2026-07-05T11:56:17.341019+00:00"},{"alias_kind":"pith_short_16","alias_value":"3D4P6FBD7SG4KS26","created_at":"2026-07-05T11:56:17.341019+00:00"},{"alias_kind":"pith_short_8","alias_value":"3D4P6FBD","created_at":"2026-07-05T11:56:17.341019+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/3D4P6FBD7SG4KS26GHX2KMVVOU","json":"https://pith.science/pith/3D4P6FBD7SG4KS26GHX2KMVVOU.json","graph_json":"https://pith.science/api/pith-number/3D4P6FBD7SG4KS26GHX2KMVVOU/graph.json","events_json":"https://pith.science/api/pith-number/3D4P6FBD7SG4KS26GHX2KMVVOU/events.json","paper":"https://pith.science/paper/3D4P6FBD"},"agent_actions":{"view_html":"https://pith.science/pith/3D4P6FBD7SG4KS26GHX2KMVVOU","download_json":"https://pith.science/pith/3D4P6FBD7SG4KS26GHX2KMVVOU.json","view_paper":"https://pith.science/paper/3D4P6FBD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.00038&json=true","fetch_graph":"https://pith.science/api/pith-number/3D4P6FBD7SG4KS26GHX2KMVVOU/graph.json","fetch_events":"https://pith.science/api/pith-number/3D4P6FBD7SG4KS26GHX2KMVVOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3D4P6FBD7SG4KS26GHX2KMVVOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3D4P6FBD7SG4KS26GHX2KMVVOU/action/storage_attestation","attest_author":"https://pith.science/pith/3D4P6FBD7SG4KS26GHX2KMVVOU/action/author_attestation","sign_citation":"https://pith.science/pith/3D4P6FBD7SG4KS26GHX2KMVVOU/action/citation_signature","submit_replication":"https://pith.science/pith/3D4P6FBD7SG4KS26GHX2KMVVOU/action/replication_record"}},"created_at":"2026-07-05T11:56:17.341019+00:00","updated_at":"2026-07-05T11:56:17.341019+00:00"}