{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:A4EOSAF4FKADAQ5FWJ2QXW3AUW","short_pith_number":"pith:A4EOSAF4","canonical_record":{"source":{"id":"1311.2139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-09T06:47:22Z","cross_cats_sorted":[],"title_canon_sha256":"87e90e5ed6a5ce1fa093a23646cd9bfc3c4208be4b3f31907a290d03304423fa","abstract_canon_sha256":"89f60573e3f9e386306b54f58e558065b802ec78ae2b91407cb5b6a4bdefbd86"},"schema_version":"1.0"},"canonical_sha256":"0708e900bc2a803043a5b2750bdb60a5ad329abed6f4349893f12480c1b99f9f","source":{"kind":"arxiv","id":"1311.2139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2139","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2139v1","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2139","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"A4EOSAF4FKAD","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A4EOSAF4FKADAQ5F","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A4EOSAF4","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:A4EOSAF4FKADAQ5FWJ2QXW3AUW","target":"record","payload":{"canonical_record":{"source":{"id":"1311.2139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-09T06:47:22Z","cross_cats_sorted":[],"title_canon_sha256":"87e90e5ed6a5ce1fa093a23646cd9bfc3c4208be4b3f31907a290d03304423fa","abstract_canon_sha256":"89f60573e3f9e386306b54f58e558065b802ec78ae2b91407cb5b6a4bdefbd86"},"schema_version":"1.0"},"canonical_sha256":"0708e900bc2a803043a5b2750bdb60a5ad329abed6f4349893f12480c1b99f9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:33.417484Z","signature_b64":"exvvTBkudJioPxZ7KWkuQVkH6QUMriB3D12DgkW3CWMw9GpiV2oOakUbb2IICbZ45T9xkWhMKnDbNNtqRQ2bDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0708e900bc2a803043a5b2750bdb60a5ad329abed6f4349893f12480c1b99f9f","last_reissued_at":"2026-05-18T03:07:33.416536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:33.416536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.2139","source_version":1,"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-18T03:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LIYQzvbF8vRmej/8T9w7tQtifnYzqr2vkxX5L38ew3ZHlDhay9FLioqZFTqGtKcg1EMvOAQzI6a27vbjvhd4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:17:47.482669Z"},"content_sha256":"66a4b571056f96fbebf621624c5fbf4fb85061fc4cd8e4e2bf2ff8c299c369e3","schema_version":"1.0","event_id":"sha256:66a4b571056f96fbebf621624c5fbf4fb85061fc4cd8e4e2bf2ff8c299c369e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:A4EOSAF4FKADAQ5FWJ2QXW3AUW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large Margin Semi-supervised Structured Output Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"P. Balamurugan, Shirish Shevade, Sundararajan Sellamanickam","submitted_at":"2013-11-09T06:47:22Z","abstract_excerpt":"In structured output learning, obtaining labelled data for real-world applications is usually costly, while unlabelled examples are available in abundance. Semi-supervised structured classification has been developed to handle large amounts of unlabelled structured data. In this work, we consider semi-supervised structural SVMs with domain constraints. The optimization problem, which in general is not convex, contains the loss terms associated with the labelled and unlabelled examples along with the domain constraints. We propose a simple optimization approach, which alternates between solving"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2139","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":""},"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-18T03:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+nKkbCRSJWxTHR+3o50XU+BS9Q4OgIbozn0NXIh3VNMIB6/ISs4b4HvccJzW033qITXZ/fanXXDt90bEmoBhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:17:47.483013Z"},"content_sha256":"5880f63c0e7f52a05d6744a4b99062c36a86a12eebc2ec740ca698e011d23663","schema_version":"1.0","event_id":"sha256:5880f63c0e7f52a05d6744a4b99062c36a86a12eebc2ec740ca698e011d23663"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4EOSAF4FKADAQ5FWJ2QXW3AUW/bundle.json","state_url":"https://pith.science/pith/A4EOSAF4FKADAQ5FWJ2QXW3AUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4EOSAF4FKADAQ5FWJ2QXW3AUW/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-06-03T20:17:47Z","links":{"resolver":"https://pith.science/pith/A4EOSAF4FKADAQ5FWJ2QXW3AUW","bundle":"https://pith.science/pith/A4EOSAF4FKADAQ5FWJ2QXW3AUW/bundle.json","state":"https://pith.science/pith/A4EOSAF4FKADAQ5FWJ2QXW3AUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4EOSAF4FKADAQ5FWJ2QXW3AUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:A4EOSAF4FKADAQ5FWJ2QXW3AUW","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":"89f60573e3f9e386306b54f58e558065b802ec78ae2b91407cb5b6a4bdefbd86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-09T06:47:22Z","title_canon_sha256":"87e90e5ed6a5ce1fa093a23646cd9bfc3c4208be4b3f31907a290d03304423fa"},"schema_version":"1.0","source":{"id":"1311.2139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2139","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2139v1","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2139","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"A4EOSAF4FKAD","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A4EOSAF4FKADAQ5F","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A4EOSAF4","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:5880f63c0e7f52a05d6744a4b99062c36a86a12eebc2ec740ca698e011d23663","target":"graph","created_at":"2026-05-18T03:07:33Z","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":"In structured output learning, obtaining labelled data for real-world applications is usually costly, while unlabelled examples are available in abundance. Semi-supervised structured classification has been developed to handle large amounts of unlabelled structured data. In this work, we consider semi-supervised structural SVMs with domain constraints. The optimization problem, which in general is not convex, contains the loss terms associated with the labelled and unlabelled examples along with the domain constraints. We propose a simple optimization approach, which alternates between solving","authors_text":"P. Balamurugan, Shirish Shevade, Sundararajan Sellamanickam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-09T06:47:22Z","title":"Large Margin Semi-supervised Structured Output Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2139","kind":"arxiv","version":1},"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:66a4b571056f96fbebf621624c5fbf4fb85061fc4cd8e4e2bf2ff8c299c369e3","target":"record","created_at":"2026-05-18T03:07:33Z","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":"89f60573e3f9e386306b54f58e558065b802ec78ae2b91407cb5b6a4bdefbd86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-09T06:47:22Z","title_canon_sha256":"87e90e5ed6a5ce1fa093a23646cd9bfc3c4208be4b3f31907a290d03304423fa"},"schema_version":"1.0","source":{"id":"1311.2139","kind":"arxiv","version":1}},"canonical_sha256":"0708e900bc2a803043a5b2750bdb60a5ad329abed6f4349893f12480c1b99f9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0708e900bc2a803043a5b2750bdb60a5ad329abed6f4349893f12480c1b99f9f","first_computed_at":"2026-05-18T03:07:33.416536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:33.416536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"exvvTBkudJioPxZ7KWkuQVkH6QUMriB3D12DgkW3CWMw9GpiV2oOakUbb2IICbZ45T9xkWhMKnDbNNtqRQ2bDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:33.417484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66a4b571056f96fbebf621624c5fbf4fb85061fc4cd8e4e2bf2ff8c299c369e3","sha256:5880f63c0e7f52a05d6744a4b99062c36a86a12eebc2ec740ca698e011d23663"],"state_sha256":"58f4b5d03ca930deac176ed3c67192a5dff23421a891c101bd68e942728c05c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SarHUNb63JP/uqHCVIeXCnoS5KViXTqbTLi/m2qiHdY7+VWMW7IS730fRGdlNp0b14kUBmjQBibgFKdKbbRhBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:17:47.485251Z","bundle_sha256":"0139027ee03038ba03a1b359e8a296dce55e39afc3d830d128f7dac7ce866554"}}