{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VTCBN73PZ4E4C5RBJKTFBLFJM2","short_pith_number":"pith:VTCBN73P","schema_version":"1.0","canonical_sha256":"acc416ff6fcf09c176214aa650aca9669ff090ebbcbec1b84f133e8673e50e8a","source":{"kind":"arxiv","id":"1803.00546","version":2},"attestation_state":"computed","paper":{"title":"Semi-Supervised Online Structure Learning for Composite Event Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Alexander Artikis, Evangelos Michelioudakis, Georgios Paliouras","submitted_at":"2018-03-01T18:31:07Z","abstract_excerpt":"Online structure learning approaches, such as those stemming from Statistical Relational Learning, enable the discovery of complex relations in noisy data streams. However, these methods assume the existence of fully-labelled training data, which is unrealistic for most real-world applications. We present a novel approach for completing the supervision of a semi-supervised structure learning task. We incorporate graph-cut minimisation, a technique that derives labels for unlabelled data, based on their distance to their labelled counterparts. In order to adapt graph-cut minimisation to first o"},"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":"1803.00546","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-03-01T18:31:07Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"294e7e09c7af7ec314e367fafe8b16d523d3bf591083746c7540ba1eb8a7ca20","abstract_canon_sha256":"49d2f93b75b3ba52c9f715c40f2e714ee306eb979e23ad0f5c31e8611aa8a06e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:09.673231Z","signature_b64":"PvYqn6aiGLMxGxkhE5m7fwfvB63u4ki9x6XYoxua7UtiP7AWO/mHT2TMAu23aQNGcO6Me5KPN2HMkM0uGhy4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acc416ff6fcf09c176214aa650aca9669ff090ebbcbec1b84f133e8673e50e8a","last_reissued_at":"2026-05-17T23:53:09.672699Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:09.672699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-Supervised Online Structure Learning for Composite Event Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Alexander Artikis, Evangelos Michelioudakis, Georgios Paliouras","submitted_at":"2018-03-01T18:31:07Z","abstract_excerpt":"Online structure learning approaches, such as those stemming from Statistical Relational Learning, enable the discovery of complex relations in noisy data streams. However, these methods assume the existence of fully-labelled training data, which is unrealistic for most real-world applications. We present a novel approach for completing the supervision of a semi-supervised structure learning task. We incorporate graph-cut minimisation, a technique that derives labels for unlabelled data, based on their distance to their labelled counterparts. In order to adapt graph-cut minimisation to first o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00546","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":"1803.00546","created_at":"2026-05-17T23:53:09.672789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.00546v2","created_at":"2026-05-17T23:53:09.672789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00546","created_at":"2026-05-17T23:53:09.672789+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTCBN73PZ4E4","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTCBN73PZ4E4C5RB","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTCBN73P","created_at":"2026-05-18T12:32:59.047623+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/VTCBN73PZ4E4C5RBJKTFBLFJM2","json":"https://pith.science/pith/VTCBN73PZ4E4C5RBJKTFBLFJM2.json","graph_json":"https://pith.science/api/pith-number/VTCBN73PZ4E4C5RBJKTFBLFJM2/graph.json","events_json":"https://pith.science/api/pith-number/VTCBN73PZ4E4C5RBJKTFBLFJM2/events.json","paper":"https://pith.science/paper/VTCBN73P"},"agent_actions":{"view_html":"https://pith.science/pith/VTCBN73PZ4E4C5RBJKTFBLFJM2","download_json":"https://pith.science/pith/VTCBN73PZ4E4C5RBJKTFBLFJM2.json","view_paper":"https://pith.science/paper/VTCBN73P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.00546&json=true","fetch_graph":"https://pith.science/api/pith-number/VTCBN73PZ4E4C5RBJKTFBLFJM2/graph.json","fetch_events":"https://pith.science/api/pith-number/VTCBN73PZ4E4C5RBJKTFBLFJM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTCBN73PZ4E4C5RBJKTFBLFJM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTCBN73PZ4E4C5RBJKTFBLFJM2/action/storage_attestation","attest_author":"https://pith.science/pith/VTCBN73PZ4E4C5RBJKTFBLFJM2/action/author_attestation","sign_citation":"https://pith.science/pith/VTCBN73PZ4E4C5RBJKTFBLFJM2/action/citation_signature","submit_replication":"https://pith.science/pith/VTCBN73PZ4E4C5RBJKTFBLFJM2/action/replication_record"}},"created_at":"2026-05-17T23:53:09.672789+00:00","updated_at":"2026-05-17T23:53:09.672789+00:00"}