{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7FHM7WD7XZ4O7WSPTT5F2XDRFL","short_pith_number":"pith:7FHM7WD7","schema_version":"1.0","canonical_sha256":"f94ecfd87fbe78efda4f9cfa5d5c712ac9f9bac3130c0f51d1bc36bc47d7b881","source":{"kind":"arxiv","id":"2608.08710","version":1},"attestation_state":"computed","paper":{"title":"Structured Sheaf Learning of Consistent Connection Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Gabriele D'Acunto, Leonardo Di Nino, Paolo Di Lorenzo, Sergio Barbarossa","submitted_at":"2026-08-09T13:51:34Z","abstract_excerpt":"Connection graphs (CGs) extend classical graphs by associating vector-valued signals to nodes and orthogonal transport maps across edges, making them a natural model for synchronization and manifold-based signal processing. Despite their growing use, learning CGs directly from observations remains challenging because the network topology and the underlying geometric structure are coupled through non-Euclidean orthogonality constraints. In this work, we address this inverse problem by learning a consistent connection graph from noisy vector-valued signals. Exploiting the spectral characterizati"},"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":"2608.08710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-08-09T13:51:34Z","cross_cats_sorted":[],"title_canon_sha256":"7b18d3ee4cf2eb7723bac11e6b10d67d8e3dc13a008d7792dc92ddebe978696c","abstract_canon_sha256":"4d68cb233b7e0c946db36178038839ab10f8c85c2db521b97f33cf3480e41580"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:25:06.833256Z","signature_b64":"Qkp+SKFBWZrDIMeMacIJJP4nvMb6tq+x3byyjMzmI48ipFKWPC5XUfswgt2wa2STE1WcfL/pUUHG3WsepjZpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f94ecfd87fbe78efda4f9cfa5d5c712ac9f9bac3130c0f51d1bc36bc47d7b881","last_reissued_at":"2026-08-11T01:25:06.830747Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:25:06.830747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured Sheaf Learning of Consistent Connection Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Gabriele D'Acunto, Leonardo Di Nino, Paolo Di Lorenzo, Sergio Barbarossa","submitted_at":"2026-08-09T13:51:34Z","abstract_excerpt":"Connection graphs (CGs) extend classical graphs by associating vector-valued signals to nodes and orthogonal transport maps across edges, making them a natural model for synchronization and manifold-based signal processing. Despite their growing use, learning CGs directly from observations remains challenging because the network topology and the underlying geometric structure are coupled through non-Euclidean orthogonality constraints. In this work, we address this inverse problem by learning a consistent connection graph from noisy vector-valued signals. Exploiting the spectral characterizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08710","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.08710/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":"2608.08710","created_at":"2026-08-11T01:25:06.831578+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.08710v1","created_at":"2026-08-11T01:25:06.831578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08710","created_at":"2026-08-11T01:25:06.831578+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FHM7WD7XZ4O","created_at":"2026-08-11T01:25:06.831578+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FHM7WD7XZ4O7WSP","created_at":"2026-08-11T01:25:06.831578+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FHM7WD7","created_at":"2026-08-11T01:25:06.831578+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/7FHM7WD7XZ4O7WSPTT5F2XDRFL","json":"https://pith.science/pith/7FHM7WD7XZ4O7WSPTT5F2XDRFL.json","graph_json":"https://pith.science/api/pith-number/7FHM7WD7XZ4O7WSPTT5F2XDRFL/graph.json","events_json":"https://pith.science/api/pith-number/7FHM7WD7XZ4O7WSPTT5F2XDRFL/events.json","paper":"https://pith.science/paper/7FHM7WD7"},"agent_actions":{"view_html":"https://pith.science/pith/7FHM7WD7XZ4O7WSPTT5F2XDRFL","download_json":"https://pith.science/pith/7FHM7WD7XZ4O7WSPTT5F2XDRFL.json","view_paper":"https://pith.science/paper/7FHM7WD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.08710&json=true","fetch_graph":"https://pith.science/api/pith-number/7FHM7WD7XZ4O7WSPTT5F2XDRFL/graph.json","fetch_events":"https://pith.science/api/pith-number/7FHM7WD7XZ4O7WSPTT5F2XDRFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FHM7WD7XZ4O7WSPTT5F2XDRFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FHM7WD7XZ4O7WSPTT5F2XDRFL/action/storage_attestation","attest_author":"https://pith.science/pith/7FHM7WD7XZ4O7WSPTT5F2XDRFL/action/author_attestation","sign_citation":"https://pith.science/pith/7FHM7WD7XZ4O7WSPTT5F2XDRFL/action/citation_signature","submit_replication":"https://pith.science/pith/7FHM7WD7XZ4O7WSPTT5F2XDRFL/action/replication_record"}},"created_at":"2026-08-11T01:25:06.831578+00:00","updated_at":"2026-08-11T01:25:06.831578+00:00"}