{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2KKTU255DEKPAFGSKV6GCJJRLT","short_pith_number":"pith:2KKTU255","canonical_record":{"source":{"id":"1612.03950","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-12T22:21:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cc519209f9e26f88169f30028d6ca17c6b3eba3ddf9334f054080f5a8a862f2f","abstract_canon_sha256":"446b72c0eeab992ae25c0fe3d01c7320510d078530f24ed8fcca350fd031a82c"},"schema_version":"1.0"},"canonical_sha256":"d2953a6bbd1914f014d2557c6125315ce92c97d111062b4fcccc976579d5f8de","source":{"kind":"arxiv","id":"1612.03950","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03950","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03950v2","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03950","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"pith_short_12","alias_value":"2KKTU255DEKP","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2KKTU255DEKPAFGS","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2KKTU255","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2KKTU255DEKPAFGSKV6GCJJRLT","target":"record","payload":{"canonical_record":{"source":{"id":"1612.03950","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-12T22:21:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cc519209f9e26f88169f30028d6ca17c6b3eba3ddf9334f054080f5a8a862f2f","abstract_canon_sha256":"446b72c0eeab992ae25c0fe3d01c7320510d078530f24ed8fcca350fd031a82c"},"schema_version":"1.0"},"canonical_sha256":"d2953a6bbd1914f014d2557c6125315ce92c97d111062b4fcccc976579d5f8de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:17.556293Z","signature_b64":"/oDH/c0zhe9PnNM3LOqtcTXmOVrhjlbxYBEA7Xpqej7UyXmgQ5RAOm0l+04+jadxJFP4KO0STI6Xp8sC6RmMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2953a6bbd1914f014d2557c6125315ce92c97d111062b4fcccc976579d5f8de","last_reissued_at":"2026-05-18T00:20:17.555621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:17.555621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.03950","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-18T00:20:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ePOw6fjstgC7Vmf2Wl6kQOsDgS63ZB1jvwhitgLzyhfrMZNtj7rZg8XfBGc/LdsYMotRlaLhMPXZVYiEBjA0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:51:45.326035Z"},"content_sha256":"240932e9cd3e86c33dbaa285d00ee6fa9c4163d723d6f25f5e0d1d834f535cba","schema_version":"1.0","event_id":"sha256:240932e9cd3e86c33dbaa285d00ee6fa9c4163d723d6f25f5e0d1d834f535cba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2KKTU255DEKPAFGSKV6GCJJRLT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonnegative Matrix Factorization for identification of unknown number of sources emitting delayed signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Boian S. Alexandrov, Filip L. Iliev, Valentin G. Stanev, Velimir V. Vesselinov","submitted_at":"2016-12-12T22:21:41Z","abstract_excerpt":"Factor analysis is broadly used as a powerful unsupervised machine learning tool for reconstruction of hidden features in recorded mixtures of signals. In the case of a linear approximation, the mixtures can be decomposed by a variety of model-free Blind Source Separation (BSS) algorithms. Most of the available BSS algorithms consider an instantaneous mixing of signals, while the case when the mixtures are linear combinations of signals with delays is less explored. Especially difficult is the case when the number of sources of the signals with delays is unknown and has to be determined from t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03950","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-18T00:20:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rq5vjLdortk+YBJDmyPwuYt0avKo/jRYSh8TOhUzti7OLJGUOth1RF4oE7wbKApxTkjGV+kpumK9WmtZTonEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:51:45.326387Z"},"content_sha256":"9c1d892d71279271b0e01aeea06563436c3f91f4eea43ec1591b0a4ba734289f","schema_version":"1.0","event_id":"sha256:9c1d892d71279271b0e01aeea06563436c3f91f4eea43ec1591b0a4ba734289f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KKTU255DEKPAFGSKV6GCJJRLT/bundle.json","state_url":"https://pith.science/pith/2KKTU255DEKPAFGSKV6GCJJRLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KKTU255DEKPAFGSKV6GCJJRLT/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-02T19:51:45Z","links":{"resolver":"https://pith.science/pith/2KKTU255DEKPAFGSKV6GCJJRLT","bundle":"https://pith.science/pith/2KKTU255DEKPAFGSKV6GCJJRLT/bundle.json","state":"https://pith.science/pith/2KKTU255DEKPAFGSKV6GCJJRLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KKTU255DEKPAFGSKV6GCJJRLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2KKTU255DEKPAFGSKV6GCJJRLT","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":"446b72c0eeab992ae25c0fe3d01c7320510d078530f24ed8fcca350fd031a82c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-12T22:21:41Z","title_canon_sha256":"cc519209f9e26f88169f30028d6ca17c6b3eba3ddf9334f054080f5a8a862f2f"},"schema_version":"1.0","source":{"id":"1612.03950","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03950","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03950v2","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03950","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"pith_short_12","alias_value":"2KKTU255DEKP","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2KKTU255DEKPAFGS","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2KKTU255","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:9c1d892d71279271b0e01aeea06563436c3f91f4eea43ec1591b0a4ba734289f","target":"graph","created_at":"2026-05-18T00:20:17Z","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":"Factor analysis is broadly used as a powerful unsupervised machine learning tool for reconstruction of hidden features in recorded mixtures of signals. In the case of a linear approximation, the mixtures can be decomposed by a variety of model-free Blind Source Separation (BSS) algorithms. Most of the available BSS algorithms consider an instantaneous mixing of signals, while the case when the mixtures are linear combinations of signals with delays is less explored. Especially difficult is the case when the number of sources of the signals with delays is unknown and has to be determined from t","authors_text":"Boian S. Alexandrov, Filip L. Iliev, Valentin G. Stanev, Velimir V. Vesselinov","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-12T22:21:41Z","title":"Nonnegative Matrix Factorization for identification of unknown number of sources emitting delayed signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03950","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:240932e9cd3e86c33dbaa285d00ee6fa9c4163d723d6f25f5e0d1d834f535cba","target":"record","created_at":"2026-05-18T00:20:17Z","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":"446b72c0eeab992ae25c0fe3d01c7320510d078530f24ed8fcca350fd031a82c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-12T22:21:41Z","title_canon_sha256":"cc519209f9e26f88169f30028d6ca17c6b3eba3ddf9334f054080f5a8a862f2f"},"schema_version":"1.0","source":{"id":"1612.03950","kind":"arxiv","version":2}},"canonical_sha256":"d2953a6bbd1914f014d2557c6125315ce92c97d111062b4fcccc976579d5f8de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2953a6bbd1914f014d2557c6125315ce92c97d111062b4fcccc976579d5f8de","first_computed_at":"2026-05-18T00:20:17.555621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:17.555621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/oDH/c0zhe9PnNM3LOqtcTXmOVrhjlbxYBEA7Xpqej7UyXmgQ5RAOm0l+04+jadxJFP4KO0STI6Xp8sC6RmMBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:17.556293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03950","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:240932e9cd3e86c33dbaa285d00ee6fa9c4163d723d6f25f5e0d1d834f535cba","sha256:9c1d892d71279271b0e01aeea06563436c3f91f4eea43ec1591b0a4ba734289f"],"state_sha256":"1803a0cdfa1e99443c2a0e0c2ef8cfc12201cf730fcd005130572e7c83e470a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m0EzaqAElotRhgyBzxeFk7r4FlCWNa2gDO8WbY6qEL7BVgb0DtDWHGWPlLZqw7xhsRbAskaJ3q7ij2yWlqR1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:51:45.328331Z","bundle_sha256":"687f88d0e9df3fb5b2633fa7d683cb1b196d0d428419acc3e0718d3417d178c8"}}