{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VTCBN73PZ4E4C5RBJKTFBLFJM2","short_pith_number":"pith:VTCBN73P","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"},"canonical_sha256":"acc416ff6fcf09c176214aa650aca9669ff090ebbcbec1b84f133e8673e50e8a","source":{"kind":"arxiv","id":"1803.00546","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00546","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00546v2","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00546","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"pith_short_12","alias_value":"VTCBN73PZ4E4","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VTCBN73PZ4E4C5RB","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VTCBN73P","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VTCBN73PZ4E4C5RBJKTFBLFJM2","target":"record","payload":{"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"},"canonical_sha256":"acc416ff6fcf09c176214aa650aca9669ff090ebbcbec1b84f133e8673e50e8a","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"},"source_kind":"arxiv","source_id":"1803.00546","source_version":2,"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:53:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RE+jkUgjRNhCx4Qwrxyg9a+/BlUu2nFVEZYXYx6bPEacQ6U/SR7G/UqxUR8e2v6LZWpIY+pqSPa/3sN3eLO5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:04:03.366116Z"},"content_sha256":"ca56887b0d39f2267f3cf3b3daef9cd05a2f118b42d0d428f1154745e356e7ec","schema_version":"1.0","event_id":"sha256:ca56887b0d39f2267f3cf3b3daef9cd05a2f118b42d0d428f1154745e356e7ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VTCBN73PZ4E4C5RBJKTFBLFJM2","target":"graph","payload":{"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"},"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:53:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADdzw9r9z9a3ZFYP2GpOp7yx31AT7jHp2XLqLcntJXxfOYQg3BnrYLp5/AzudCzbMjZ32aup2yC4PDUtnwekDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:04:03.366683Z"},"content_sha256":"267b079dde1f3361906f9047caa153a7e04c184ad06f99689948cd4b6a693549","schema_version":"1.0","event_id":"sha256:267b079dde1f3361906f9047caa153a7e04c184ad06f99689948cd4b6a693549"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTCBN73PZ4E4C5RBJKTFBLFJM2/bundle.json","state_url":"https://pith.science/pith/VTCBN73PZ4E4C5RBJKTFBLFJM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTCBN73PZ4E4C5RBJKTFBLFJM2/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-05-27T08:04:03Z","links":{"resolver":"https://pith.science/pith/VTCBN73PZ4E4C5RBJKTFBLFJM2","bundle":"https://pith.science/pith/VTCBN73PZ4E4C5RBJKTFBLFJM2/bundle.json","state":"https://pith.science/pith/VTCBN73PZ4E4C5RBJKTFBLFJM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTCBN73PZ4E4C5RBJKTFBLFJM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VTCBN73PZ4E4C5RBJKTFBLFJM2","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":"49d2f93b75b3ba52c9f715c40f2e714ee306eb979e23ad0f5c31e8611aa8a06e","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-03-01T18:31:07Z","title_canon_sha256":"294e7e09c7af7ec314e367fafe8b16d523d3bf591083746c7540ba1eb8a7ca20"},"schema_version":"1.0","source":{"id":"1803.00546","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00546","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00546v2","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00546","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"pith_short_12","alias_value":"VTCBN73PZ4E4","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VTCBN73PZ4E4C5RB","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VTCBN73P","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:267b079dde1f3361906f9047caa153a7e04c184ad06f99689948cd4b6a693549","target":"graph","created_at":"2026-05-17T23:53:09Z","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":"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","authors_text":"Alexander Artikis, Evangelos Michelioudakis, Georgios Paliouras","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-03-01T18:31:07Z","title":"Semi-Supervised Online Structure Learning for Composite Event Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00546","kind":"arxiv","version":2},"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:ca56887b0d39f2267f3cf3b3daef9cd05a2f118b42d0d428f1154745e356e7ec","target":"record","created_at":"2026-05-17T23:53:09Z","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":"49d2f93b75b3ba52c9f715c40f2e714ee306eb979e23ad0f5c31e8611aa8a06e","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-03-01T18:31:07Z","title_canon_sha256":"294e7e09c7af7ec314e367fafe8b16d523d3bf591083746c7540ba1eb8a7ca20"},"schema_version":"1.0","source":{"id":"1803.00546","kind":"arxiv","version":2}},"canonical_sha256":"acc416ff6fcf09c176214aa650aca9669ff090ebbcbec1b84f133e8673e50e8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acc416ff6fcf09c176214aa650aca9669ff090ebbcbec1b84f133e8673e50e8a","first_computed_at":"2026-05-17T23:53:09.672699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:09.672699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PvYqn6aiGLMxGxkhE5m7fwfvB63u4ki9x6XYoxua7UtiP7AWO/mHT2TMAu23aQNGcO6Me5KPN2HMkM0uGhy4BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:09.673231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.00546","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca56887b0d39f2267f3cf3b3daef9cd05a2f118b42d0d428f1154745e356e7ec","sha256:267b079dde1f3361906f9047caa153a7e04c184ad06f99689948cd4b6a693549"],"state_sha256":"f93fac23b8f06042fbfbe2c7b50e21b084b0114a0b1cf4d6d0f63f14aa79f4df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OhrCe6nOJCF4WGf708URwpdZZIoMnQcOI+v4s7es6tb6B9BNP5FgLQyg7bZGme6xGNYtn/KXS0PlGWd39rmtBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:04:03.370181Z","bundle_sha256":"dec94d4222faeef1ac30a089502dfa624da42998e69992d99bf044a57a16ec59"}}