{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UQRM4RQU3VXWTJFB5OW646DBWV","short_pith_number":"pith:UQRM4RQU","schema_version":"1.0","canonical_sha256":"a422ce4614dd6f69a4a1ebadee7861b56bea0e18e2ecbbf83ff75b81873a021e","source":{"kind":"arxiv","id":"1806.08297","version":2},"attestation_state":"computed","paper":{"title":"Learning Graph Weighted Models on Pictures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.FL","authors_text":"Guillaume Rabusseau, Philip Amortila","submitted_at":"2018-06-21T15:44:51Z","abstract_excerpt":"Graph Weighted Models (GWMs) have recently been proposed as a natural generalization of weighted automata over strings and trees to arbitrary families of labeled graphs (and hypergraphs). A GWM generically associates a labeled graph with a tensor network and computes a value by successive contractions directed by its edges. In this paper, we consider the problem of learning GWMs defined over the graph family of pictures (or 2-dimensional words). As a proof of concept, we consider regression and classification tasks over the simple Bars & Stripes and Shifting Bits picture languages and provide "},"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":"1806.08297","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-06-21T15:44:51Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"09da8c0d974769faa98a2e8dceca0f5ea2e579dbf8a72f3b36a3d559858b3e5a","abstract_canon_sha256":"913c912afb1f429053b89512f76a3587ace1732b1d3e09bed33df6e3aa339e2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:22.618900Z","signature_b64":"mCxow+SgJALoW4sf0BW9+CEjBYrFUnKUrzCjmLfOFqNOat3VLfFl9VvAxYLBysrtN4kDkyyTrM+Le76kN+VKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a422ce4614dd6f69a4a1ebadee7861b56bea0e18e2ecbbf83ff75b81873a021e","last_reissued_at":"2026-05-17T23:59:22.618562Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:22.618562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Graph Weighted Models on Pictures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.FL","authors_text":"Guillaume Rabusseau, Philip Amortila","submitted_at":"2018-06-21T15:44:51Z","abstract_excerpt":"Graph Weighted Models (GWMs) have recently been proposed as a natural generalization of weighted automata over strings and trees to arbitrary families of labeled graphs (and hypergraphs). A GWM generically associates a labeled graph with a tensor network and computes a value by successive contractions directed by its edges. In this paper, we consider the problem of learning GWMs defined over the graph family of pictures (or 2-dimensional words). As a proof of concept, we consider regression and classification tasks over the simple Bars & Stripes and Shifting Bits picture languages and provide "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08297","kind":"arxiv","version":2},"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":"1806.08297","created_at":"2026-05-17T23:59:22.618616+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08297v2","created_at":"2026-05-17T23:59:22.618616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08297","created_at":"2026-05-17T23:59:22.618616+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQRM4RQU3VXW","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQRM4RQU3VXWTJFB","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQRM4RQU","created_at":"2026-05-18T12:32:56.356000+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/UQRM4RQU3VXWTJFB5OW646DBWV","json":"https://pith.science/pith/UQRM4RQU3VXWTJFB5OW646DBWV.json","graph_json":"https://pith.science/api/pith-number/UQRM4RQU3VXWTJFB5OW646DBWV/graph.json","events_json":"https://pith.science/api/pith-number/UQRM4RQU3VXWTJFB5OW646DBWV/events.json","paper":"https://pith.science/paper/UQRM4RQU"},"agent_actions":{"view_html":"https://pith.science/pith/UQRM4RQU3VXWTJFB5OW646DBWV","download_json":"https://pith.science/pith/UQRM4RQU3VXWTJFB5OW646DBWV.json","view_paper":"https://pith.science/paper/UQRM4RQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08297&json=true","fetch_graph":"https://pith.science/api/pith-number/UQRM4RQU3VXWTJFB5OW646DBWV/graph.json","fetch_events":"https://pith.science/api/pith-number/UQRM4RQU3VXWTJFB5OW646DBWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQRM4RQU3VXWTJFB5OW646DBWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQRM4RQU3VXWTJFB5OW646DBWV/action/storage_attestation","attest_author":"https://pith.science/pith/UQRM4RQU3VXWTJFB5OW646DBWV/action/author_attestation","sign_citation":"https://pith.science/pith/UQRM4RQU3VXWTJFB5OW646DBWV/action/citation_signature","submit_replication":"https://pith.science/pith/UQRM4RQU3VXWTJFB5OW646DBWV/action/replication_record"}},"created_at":"2026-05-17T23:59:22.618616+00:00","updated_at":"2026-05-17T23:59:22.618616+00:00"}